Leverage recursive zkRollups to batch thousands of L2 transactions into a single proof posted to Mina’s L1 🤌 Recursive zkRollups are a ZKP accumulator tool to efficiently process transactions and optimize blockspace utilization for zkApps. Read more ↓ https://t.co/VCvJOcpuSp

We have just applied for the first ever @LongHashX ZK cohort, supported by @zksync, @Scroll_ZKP, @LineaBuild, @taikoxyz and other partners! Join us as we accelerate the adoption of ZK tech in the Web3 space 👉

⚡️ Recursive ZK State Channels A Lightning Network (state channels) built using recursive ZK-Snark Proofs @___absent

Congrats to the #ETHTokyo 2023 hackathon winners for @minaprotocol zkApps 🎉🇯🇵🍜🗼🍣 • 1st place -⚡️Recursive ZK State Channels (think “Mina lightning network”) @___absent • 2nd place - ♣️ MINAaml VRF with Texas Hold ‘em poker UI demo @zerocloo @cheechyuanang @ChenWenKang1

Pretty cool to see a Lightning network utilising off-chain transactions for negligible fees with near-instant finality built on Mina with SnarkyJS during ETHTokyo! https://t.co/QP5CaVXMdD

Thank you to @ETHGlobal and the @MinaProtocol team for choosing my project as the winner prize! @blockchainbeard @karsenthil

My submission for Eth Tokyo: A new Lightning Network built using recursive ZK Snark Proofs. Built on Mina

0x378A519cc7c80a208AFDd1d06f8661f4d0344d36

hi, i want to make a discord for solidity / web3 devs, please reply and rt if you would like an invite.

Our new paper is finally on Eprint. We construct a confidential payment system on top of Ethereum. It works with Ethereum today and is compatible with other smart contracts. The techniques apply to account based payments in general. Also: extension to BP called Sigma-Bullets

The 3rd Winter School in Computer Science and Engineering: Blockchains and Cryptocurrencies https://t.co/Vft6TnsNSr @Avivz78 @el33th4xor @mpherlihy @ittaia Hagit Attiya Joseph Halpern

New paper on batching techniques for accumulators. Applications to stateless blockchains (miners only need 2kb digest to store the entire UTXOs) and shorter STARKs/Aurora. Also new succinct proofs for groups of unknown order: https://t.co/8JVvKSEXis Joint work: @benafisch & Dabo

Going to think loudly while I read David Chaum's @elixxir_io technical brief. Chaum is pretty much the forefather anonymous communication and is about as respected as you can be in this space. Now he's built a privacy PoS coin. I'll look silly criticizing this but, here I go.

A curious situation. The best known lower bound for the minimal length of superpermutations was proved by an anonymous user of a wiki mainly devoted to anime.

Tim Geithner, Ben Bernanke, and Hank Paulson argue in the New York Times that our main political problem is insufficient authority to bail out banks. I mean, just, speechless.

This year, more than 70% of open source projects will be abandoned. We think that something must be done about this.

Open source needs a change. Come chat with us about it here:

I think that having to pay gas is a huge UX/adoption challenge, and I'd hate to see ETH lose market share to other, more centralized, chains where gas is 'free' (e.g. inflation funded) /1 https://t.co/IwyWtxAYr0

More about STARKs for people who like getting into the weeds: https://t.co/ZSrvQL4dgb

|￣￣￣￣￣￣￣￣￣￣￣| DO WE REALLY NEED A MASSIVELY REPLICATED PERSISTENT EVENT STORE BASED ON A NON-HIERARCHICAL CONSENSUS ALGORITHM? |＿＿＿＿＿＿＿＿＿＿＿| (\__/) || (•ㅅ•) || / 　 づ