1/3 Gm, I’ve been diving into zk-SNARKs and STARKs, starting with Groth16. I found the zk-book by @RareSkills_io to be an excellent resource. To help with my learning, I created a summary schema that I’m sharing in case it’s useful to others.

RT @roberto_bayardo: I wrote a thing. At @commonwarexyz, we're building components that massively scale blockchains. Check out why we thi…

@DefiGod5 @agfviggiano @safe But with only 1 leaked key how would you generate the other signatures? Or am I missing your point?

@DefiGod5 @agfviggiano @safe what's the permit trick I'm curious? USDC could have been taken the same way as ETH/WETH.

@zerosnacks @mattsse_ I remember having to use "testFail" because expectRevert did not work well when the revert was NOT expected on the very next call but a later one. Has this been fixed?

RT @pumatheuma: For me, the biggest missing piece in Ethereum leadership is people who embody a product and customer-centric mindset. We a…

RT @dankrad: So finally we are talking about how the current plan is just way too unambitious. If Ethereum wants to win, we need to be am…

I mean... really?

@mobin_hk81 Sir you left the jwt...

@optimizoor Having to define 2 versions of the same fn for "memory" and "calldata". Not being to copy complex structs from calldata to storage. Stack too deep errors should not exist anymore. Private symbols conflict with other contract private symbols when doing inheritance.

Hey @mattsse_ @gakonst! As you frequently ask for feedback about what could be better for devEx (and because Christmas is coming), here is my whishlist: 1. Cheatcode to generate MPT proofs. 2. (Harder) Have 1. be supported on forked chains with local state changes.

RT @WilsonCusack: Wanted to do a quick video talking about Spend Permissions and why we pivoted (for now) from "Session Keys." @ilikesymm…

RT @WilsonCusack: Builders building with smart wallet. If you're at Devcon, find @0xlsr @ilikesymmetry and @esliu23 to learn more about -…

(Partially) getting rid of "stack too deep" seems like a must-have (and if I had to pick only one improvement, I would pick this one). Also, Clippy style lints would be soooo good.

RT @base: Fault proofs are now live on Base Mainnet, marking a key milestone on our path to decentralization With this upgrade, anyone can…

Hey @gakonst, I was reading your writeup about RSA accumulator. Are you aware of an equivalent scheme that would keep old inclusion proofs valid even after the acc changed (but assuming the proven value is still in the committed set)?

@VitalikButerin @dlubarov @FabricCrypto Fast proving is great, but when trying to verify on-chain, you always end up wrapping it in a BN254 proof, which takes too long. Are there any solutions to address that?

@atomictag @weikengchen Trying this approach currently. Could you shoot me a DM? Thanks!

@weikengchen Thanks for the info. I thought FFT was used to speed up Lagrange polynomial computation, but I was wrong. It's a bummer because I need to use Lagrange polynomials for on-chain verification but I assume they're too inefficient for large polynomials?

@weikengchen @arkworks_rs @zkproofs @m2magician I don't know what the Lagrange based are (quite new to this field) so maybe? When commiting to a vec of elements, this vec gets interpolated in a Lagrange polynomial. This polynomial itself is a sum of Lagrange basis polynomials and I would like to commit to each of these.