SENDING PROOF OF ALIGNMENT.
I just got eligibly aligned with 136425 ALIGNED 🟩 @AlignedFndn.
If you are an engineer or a researcher check if you are aligned at: https://t.co/yN7Hs4yRoW
For the First Time in History, a ZK Proof has been Verified on Bitcoin Signet!
Yesterday, we announced the successful launch of our Stwo Verifier on Bitcoin Signet.
Now, it's time to decrypt all the details 🤓
👇🧵
Looking to make sense of the mechanics for permutation arguments, lookup arguments, and range checks?
Sharing a spreadsheet with concrete examples that will hopefully save you a few hours/days of headache.
https://t.co/nyGYActXRO
New folding paper with my Ph.D. student Jessica Chen: We break through the "witness barrier" and go beyond the "lookup singularity". We show how to do reads AND writes to memory by committing to just 4 small elements. We also show how to avoid committing to intermediate witnesses
We wrote a short note introducing BabySpartan, a SNARK for (non-uniform) Plonkish arithmetization where the prover only commits to “small” values (when the witness contains small field elements). The note is here: https://t.co/nrXh8BOnr2.
@Paul_Gafni @tracecrypto1 @RiscZero I'm a bit confused with respect to "You need to send them a witness that's potentially tens of gigabytes". In the picture, the prover's input is 50MB (which I'm assuming is the witness size?). How did we go from 50MB (current scheme) to "tens of GB" (under folding schemes)? 1/2
Using Nova over secp/secq, proving time for 300 aggregated secp256k1 sigs is clocking at 8.44s on my mac. I ported it to wasm, you can try it from your browser - tested on desktop chrome.
Writeup: https://t.co/mmGPA67ApO
App: https://t.co/BlZN0n0Dc1
Repo: https://t.co/SqoQhH6O2h
Excited and honored to join the contributors list to the incredible
gnark library by @gnark_team
gnark is a zk-SNARK Go library that boasts exceptional speed and unmatched performance - truly amazing.🚀 🚀 🚀
https://t.co/xvUFvVVUU3
This paper is finally out https://t.co/YxEvafUxJ1! A new ZKP protocol based on Plonk that can be fully distributed with only O(1) communication per machine! It was accepted by S&P 2024, and here's a post explaining the ideas and properties. https://t.co/ourZ7z1DTZ
I enjoyed getting into the weeds of Lasso+Jolt in this Study Club Session and fielding tons of thoughtful questions! It should be a useful resource for anyone looking to learn more about these tools.
@kobigurk@fede_intern@oskarth Here’s Nova’s folding performance for sha256 reproduced by others: https://t.co/GzpqnJiFwh. Summary: folding is as fast as starky and 100x faster than plonky2. This is one benchmark (we need more!) and Nova needs parallel proving (a la ParaNova). HN will make folding even faster!
An incomplete guide to Folding: Nova, Sangria, SuperNova, HyperNova, Protostar.
In this article, we figure out how folding works and what are its key applications.
Check the article here: https://t.co/Nu3iNrEfQS
Highlights below 🧵 👇
1/
Introducing Lasso and Jolt, two new works that I hope will change how SNARKs are designed and built. You can read about them here: https://t.co/vQIoYnGQxE (1/6)
Crypto runs on the open source ethos. When projects don’t follow it, the ecosystem suffers.
We were disappointed to see that @zksync copied our code without attribution and made misleading claims about the original work, so we wrote this post.
https://t.co/8VnoYVWgI8
.@TheMijCipher found an insecure Fiat-Shamir transformation in Incognito Chain’s aggregate bulletproofs that could have allowed attackers to forge range proofs, mint arbitrarily large tokens, and drain millions of dollars in user funds without detection. https://t.co/C0DwgcNlat