zkSecurity
@zksecurityXYZ
Security audits, development, and research for ZKP, MPC, FHE, PQC, and more generally advanced cryptography. Contact us: hello@zksecurity.xyz
18 Following 6.9K Followers
Did you know that Clean has a website and a pragmatic introduction to formal verification for zk devs?
We’re happy to support the proximity prize challenge efforts, now with machine-verifiability!
currently hosts two challenges, to improve what we know about the security bounds of proximity gaps. Since the challenges are expressed in Lean, every accepted result carries a strong guarantee, in the same style as
This follows the series of efforts in the industry and in our team to utilize verifiability for fearless optimization.
Starting from a security bits baseline of 53 (lower bound) and 128 (upper bound), AIs (and people too) will collaborate to improve the state of the art, and hopefully interesting ideas that can advance science will rise out of it!
Show more
Aaaand we have reached SOTA on (emulated) fixed-based scalar multiplication as well:
Thanks to and all the other golfers that made this possible.
Aaand we are back, after fixing the scoring on
Shoutout to @zksecurityXYZ for being pivotal on both these goals
3 years ago when we started zkSecurity, we reviewed a number of RSA circuits.
they're not easy to review.
If you had told me then that 3 years later we wouldn't have to understand how these circuits work for them to be secure, there's no way I would have believed you.
The work that the clean team has managed to achieve is really insane. Props to @mitschabaude @pirapira @g_dellimmagine and rot256
Show more
btw it might not be clear but to participate in you really don't need to understand any of it, just download the llms.txt and ask your agent to beat the record, that's it.
If you do, you'll get added to the leaderboard and you'll be part of history! We're trying to find the most optimized circuits for SHA-256 and RSA right now, and it's only been a few hours so it's probably easy to get in there :D
Show more
looks like ordian from parity just pwned both SHA-256 and RSA challenges, finding the most optimized circuits for both!
EDIT: nevermind, as I wrote this @sleepdefic1t wrote a better RSA circuit! How long will he stay up there?
Show more
The club is on the lookout for new courses and now taking suggestions from fellow golfers: which circuits would you like to play next?🏌️
Reply with your suggestions for our greenskeepers. ⛳️
Show more
Today we are releasing
Part of this project is fueled by my deep distrust of LLMs and the fact that they are annoyingly useful. The answer is to make LLMs formally prove their claims!
Try it out, it's fun! ⛳️
Show more
really shows that finding the right abstraction is 99% of the work
Clean + LLMs = autoresearch for circuit optimisation! Have a look at the website or our release blog post. And have fun golfing 🏌️
Can you build the fastest circuit?
Prove it.
zkGolf is live. ⛳️
Can you build the fastest circuit?
Prove it.
zkGolf is live. ⛳️
On May 15, THORChain was drained for ~$10.7M. Root cause: a flawed implementation of GG20, an MPC-based threshold signature scheme.
Theoretically sound MPC schemes keep failing in implementation. So we built a reference for it 👇
Show more
You want to win a million dollar in the proximity prize? You'll have to first listen to this song we made
Sum-check as an Algebraic Tensor Reduction: Part III
