Steph (@steph) • Hey
web3 builder & MPC experimentooor @nillion 👩🏻💻💫 7x web3 hackathon winner & ex-AWS dev 🌊 oceans404.eth Collect my free cryptography series 👇🏼
- 🦄 claimed oceans404.uni.ens on @uniswap
- how’s the wifi on those antarctica cruises? asking for a friend
- @orbapp v2 onboarding is 🔥
- gm @lens/orb v2 ✨
- mantra this week: Talk Less, Build More
mint to affirm https://zora.co/collect/base:0xc5183533f98aa1520e6eff0c4b184c8b2c1b781e/1?referrer=0x2F7A3f2Dda7Fd36ad4D0c002c0E8D7B1Dac668B7 @zora
- crossposting from @yup_io.lens >
- pov you scheduled a meeting with me this week
- Just became the #1952 backer of Based from @lens/BuildOnBase on @lens/soundxyz_
- tag yourself, im the bird running towards the waves
📍hermosa beach, california
- would be cool to have a profile with a calendar and book time based on credits. Could be built with Lens easily
- This week I rediscovered an old favorite and have had it on repeat 🥲🔁 Mind over matter by Young the Giant https://open.spotify.com/track/5Az8KU81g2aLBbJN67F2CI?si=9x06l0-NTBiaMbBBovGI2w
- just ordered @lens/boysclub zine edition 2
- just remembered that back on Facebook, your “wall” showed anything you posted AND anything people publically wrote to you
shared digital space is kind of fun
- Officially introducing t2 as the **publishing home** on @lens/lensprotocol! We’re bringing a social layer to reading and writing, with a seamless mobile experience via @lens/orbapp.
Now available to everyone with a Lens handle, activate your t2 account today 👉 https://app.t2.world/t2xlens?
- having the choice of whether to use orb, buttrly, firefly, or all of the above for lens is actually so f*cking cool and revolutionary
- My opinion is that a decentralized social protocol should be as less opinionated as possible, capturing pretty much any social networking use-case. The services and products built on top should have an opinion, since its the opinion that people care for using the product.
For example, the rabbit hole discussion about how can we create a good spam prevention algorithm if agreeing on what is spam is hard/opinionated.
Create an opinion what is spam, ship it and receive feedback. If your product has demand, your opinion works, if not, tune in, ship it again. Also user choice comes from competition where the decentralized social users are able to choose the algos that are the best products for them. This latter part is what is missing and broken in the existing social networks.
- happy advent of code to all who observe 🎄
- Is there a way I can gate something (perhaps a MATIC reward) with Lens? For example: let’s say I want to give the first 10 people to collect my entire cryptography series 10 MATIC each + a gated thank you post
- Asymmetric encryption uses a key pair - a public and private key. Data encrypted with the public key can only be decrypted with the private key
- I’m starting a collectible cryptography series👇🏼
Symmetric encryption uses the same secret key to encrypt and decrypt data.
- how do you get verified on lens 👀
- who do you know in the MPC (multi party compute) space? I’m trying to connect with more MPC builders, PMs, and dev rels to chat about better mental models and educational resources
- do yourself a favor and collect tonight’s sunset 🌅
- gm, we are officially on @lens/lensprotocol 🌿
- huge congrats to @lens/steph for joining nillion! i know you will build the best developer ecosystem there!
also, thank you for sharing this news here first!
- 📣 hey frens, this is a @lens/lensprotocol 1st announcement (Twitter doesn’t know yet 🤫)
After a summer exploring post-quantum cryptography, MPC, and decentralized tech beyond blockchains I’m stoked to re-enter the arena to lead devrel at Nillion Network. 🎉
Nillion isn’t a blockchain. Rather than ordering and validating transactions, Nillion is building a decentralized network of nodes that collaborate to compute on secret data.
The Nillion network keeps data private by masking it, then distributing these masked inputs across nodes. Nodes can process and compute on data without needing to recombine masks or communicate with other nodes.
The Nillion protocol is an innovation on MPC (Multi Party Computation). The classic MPC example is the “millionaire’s problem” where a group decides the richest friend should pay for lunch. The group needs to figure out who has to pay the bill while keeping each of their individual net worths (the inputs) private.
Similarly, Nillion is useful anywhere you want to securely store and/or compute on high value data. You can run algorithms on “invisible data” or private datasets without needing to see the underlying data. For example
- Truly private, quantum secure messaging apps
- AI/ML training on sensitive health data
- Income tax calculation across accounts
The Nillion team has been heads down researching and building for the last 2 years. I’m stoked to get to bring this tech to devs. What’s next? Stay tuned for docs, developer community, testnet, and beyond. 🚀
- I just voted on @ens "Public Goods Round 10" https://snapshot.org/#/small-grants.eth/proposal/0x1f9519840ebb3974ad5ccb45edf9865e1a5710a2f27ba13ca147251311fdfa26 #Snapshot
- Denver day trip ✈️
- dreamy September sunsets 🌅
- Today I made sourdough everything bagels 🥯
I wish you could smell these babies through the phone 🤤
- connecting @disco.lens did:3:kjzl6cwe1jw145ua71a7icai7aw58k19ed87gtrjj4r04t8n73ws6q7npjchs5z
- any time I fork a repo I want a snack 🍿
- Just registered for the Onyx and @lensprotocol.lens Digital Identity Hackathon
- We're thrilled to join this 4-week innovation sprint powered by Encode Club with Onyx by J.P. Morgan as the premier sponsor.
Hackathon bounties for Lens devs:
🥇 Best App - 2.5k USDC
🥈 Runner-up App - 1.5k USDC
🏆 Best Integrations - 500 USDC (x2)
Get involved: https://www.encode.club/digital-identity-hackathon
- the one time a year my birthday doesn’t involve a verifiable credential or attestation 🥳
- it’s been just 24 hours since launching the Developers community, and there are already 100+ members!
it’s super cool to see builders joining and having conversations within!
if you're a dev and haven't joined the community yet, join now:
- fill in the blank:
- Avalon, Catalina 🛥️
- gm world!
- this campfire is collectible 🏕️🔥
- HAGS onchain
- hackathon jam sess with @jacqs.lens at @fwb.lens FEST 23 🧠
- community sunset at FWB Fest
- Momoka, the new infrastructure powering @lensprotocol, just hit 500,000 transactions at a total cost of ~ $173
With these updates our infrastructure is now ~250x less expensive while being ~165x more scalable than in the past. 🤯
💰 Cost of 100,000 transactions:
Old infrastructure ~ $10,000.00
Difference ~250,000% less expensive ⚡️
📈 Scalability of 100,000 transactions
Old infrastructure (~30 TPS) 55 minutes
Momoka (~50,000 TPS) 2 seconds
Difference ~ 165,000% more scalable ⚡️
Here’s how it works 🌫️
Blockchains today cannot scale to social TPS.
Traditional databases scale to up to millions of operations per second while most blockchains max out at a few hundred.
This is mainly because blockchain storage is an expensive bottleneck in terms of both cost and scalability.
Blockchain storage is more than just storage - it also enables composability, allowing your state to also be executed with other smart contracts and programs.
But with most social use cases, especially non-financial, that power and composability is not needed, so why would we continue to use it in this way?
For decentralized social applications, two of the main characteristics needed are permanent and immutable storage tied to a user’s identity.
What if those characteristics could be derived from another infrastructure layer, but at a much lower cost and with more scalability?
In the past, all Lens transactions were processed on the EVM via Polygon network.
What is the EVM at its root? It is a big state machine, holding the entire history of state changes of what has happened in what are known as archive nodes.
The expensive part of using EVM networks is performing these state updates.
BUT! The EVM only forces cost when you want to change the state in the next block.
The EVM does **not** charge anything to simulate if something could of happened on a certain block.
This means that you can leverage this to check that a transaction has been signed by the correct access control and would of passed for free *without any gas needed*.
When you do an EVM contract call, you are signing the transaction with your private key. The EVM verifies this and injects key helpers like msg.sender which is your public key to allow contracts to know it was you who did that.
Since transactions can be run for free to prove something has the correct access control conditions to run it, what if we swapped the storage updates to a place that can handle high TPS, cheap, immutable, one time payments and will be guaranteed for at least 100 years?
Momoka is an optimistic hybrid layer 3 solution from Lens Protocol that uses data availability storage on Arweave/Bundlr along with transaction proofs on Polygon to enable highly scalable and low-cost social graph data storage and verification. It allows proving social graph transactions would be valid on-chain without actually submitting them, enabling greater scalability while maintaining verifiability and user ownership.
Arweave is a decentralized blockchain-like infrastructure protocol, built specifically for storing data forever for a one off cost, and was launched over 6 years ago.
Bundlr Network is an Arweave scaling solution built to handle 50,000+ TPS. It functions similarly to a rollup in that it batches multiple transactions together and posts them to the underlying network.
An important characteristic of Bundlr is that it supports EVM addresses, allowing you to build EVM tech state on Arweave ⚡️. They also allow you to pay fees in any EVM native token you wish!
To enable this new functionality on Lens, Momoka introduces two new pieces of architecture - the Submitter and the Verifier.
Submitters are responsible for validating and constructing the metadata and submitting it to Arweave, providing proofs that anyone can contest.
The Verifier software listens for publications sent from whitelisted submitter addresses and verifies their validity.
Anyone can run a verifier using open-source software with a few commands.
Momoka is not limited to blocks and max limits as the restriction has been removed due to storage on Bundlr/Arweave.
Momoka gets timestamp proofs from Bundlr to be able to keep chain and off-chain actions in ordering and also to have a third party timestamp to avoid trust assumptions on Momoka.
With Momoka, users still own their content as it’s not possible to action a Momoka transaction if you do not pass the access control on-chain.
Momoka is fully trustless – anyone can check proofs with their own Polygon archive node!
We believe Momoka is core to the future of web3 social, enabling applications to scale to tens of thousands of operations per second while still enabling the differentiating features that make web3 social unique and special.
To learn more about Momoka, check out the following resources:
Momoka Verifier software
- touching grass and riding waves 🌊
- this is my first Twitter + Lens co-tweet from the @yup_io mobile app
loving the combined view of my social feeds
it’ll be interesting to compare engagement across platforms over the next few weeks 🤔
- Advancements in zero-knowledge proofs are poised to transform #Web3. From privacy-preserving oracle solutions to zkEVM layer 2s, zero-knowledge proofs can make blockchains, faster, more secure, and more accessible. Keep reading for a primer on how they work.
Imagine a cave with a single entrance but two pathways (paths A and B) that connect at a common door locked by a passphrase. Alice wants to prove to Bob she knows the passcode to the door but without revealing the code to Bob. To do this, Bob stands outside of the cave and Alice walks inside the cave, taking one of the two paths (without Bob knowing which path was taken). Bob then asks Alice to take one of the two paths back to the entrance of the cave (chosen at random). If Alice originally chose to take path A to the door, but then Bob asks her to take path B back, the only way to complete the puzzle is for Alice to have knowledge of the passcode for the locked door. This process can be repeated multiple times to prove Alice has knowledge of the door’s passcode and did not happen to choose the right path to take initially with a high degree of probability. After this process is complete, Bob has a high degree of confidence that Alice knows the door’s passcode without her having revealed it to him.
This general analogy can be extrapolated to a wide range of Web3 use cases. This process is used in zkEVMs to prove transaction validity, emerging oracle protocols like DECO to privately verify Web2 identity credentials, and on-chain games to create private "fog of war."
Projects at the forefront of zero-knowledge technology will be at SmartCon 2023. Join them by registering now: https://chn.lk/3zbOEAc