BIG | ZPrize.io: #ZKProof Competition

Recently we were notified by @trailofbits about a critical vulnerability in our implementation of PLONK, the proving system Dusk Network uses to create zk-proofs. Read all about it here: dusk.network/news/plonk-vul…

If you’re in NYC on Saturday come along to the hackathon where we’ll be deconstructing, designing and coding ZKP’s. Stoked to showcase how blockchains are made scalable and private with the ZK-garage gang @joshbfitzgerald, @julesdesmit, @shumochu, @CPerezz19, Todd & David

If you have been paying attention, you have: - Learned rust - Migrated from JS to WASM - Figured out XOR/hash-based consensus - Understood the concept of parallel execution with zkp/state hash/signature matching Now go do something with it. This is how you win.

Fun fact: Zero-Knowledge SNARKs (Succinct Non-Interactive Argument of Knowledge) are named snarks after an imaginary animal from a Lewis Carroll poem, "The Hunting of the Snark" poetryfoundation.org/poems/43909/th…

Now joined by @davidsrz from @0xPolygonHermez to talk STARKs & SNARKs, zk-rollups and the zero-knowledge ecosystem on @0xPolygon

Zero-knowledge rollups use validity proofs to prove the data is correct. Proofs can be SNARKs or STARKs (won't go into details - but feel free to look them up). Since Zk-rollups use validity proofs, the time to finality is much quicker, and no long wait time for withdrawals.

Want to learn some technical background about zero-knowledge -SNARKs? This thread is very well written, love the untechnical examples which make it easy to understand! Very much recommended 👏👇

Primul satelit crypto a fost lansat pe orbită de Cryptosat, prin SpaceX (Falcon 9), ca să înceapa dezvoltarea unei rețele cryptografice în spațiu. Get this: vor testa SNARKs (zero knowledge proof - am mai vb de asta) și mai multe detalii aici⬇️ crazy.. beincrypto.com/spacex-rocket-…

Tradeoffs in ZKPs (Specifically ZK-SNARKs) in order of importance: - Verification time - Proof generation resources - Proof generation time - Proof size

@GagolAdam of @Aleph__Zero at #blocksplit during his talk about the privacy limitations of #DeFi systems based on ZK-SNARKs. #LFG $AZERO

GM Y'all! An Exploration of Zero-Knowledge Proofs and zk-SNARKs fisher.wharton.upenn.edu/wp-content/upl…

Do any other cryptography newbies wanna work through this intro to zk-SNARKs together? 👉👈 arxiv.org/pdf/1906.07221…

"zkSNARKs enable developers to program new cryptographic primitives, without having to think about elliptic curves, bilinear pairings, polynomial commitments, or other crypto math." 0xparc.org/blog/zk-group-… A must read by @gubsheep

Great opportunity to standardize some amazing #ZKP solutions via #ZKProof. Super positive this time... we'll move fast! Excited for the #Plumo, #Semaphore, #zkInterface, #ProofsOfLiabilities, #zkBenchmarkingFramework, #AirAssembly, #CommitNProve, #Saver & #TurboPLONK proposals

TurboPLONK means Universal SNARKs can now outperform Groth16 on certain circuits, and gas costs are almost identical. Brings fast privacy on Ethereum a huge step closer.

Just implemented Poseidon Hash function in #Circom, #Javascript and as a Smart contract in #EVM. This allows verification circuits of Merkle trees with less than 400 constraints per level. @barrywhitehat @kobigurk @identhree github.com/iden3/circomli…

Benchmarked the Poseidon hash function against MiMC when applied to quinary and binary Merkle trees. TL;DR: choose Poseidon over MiMC in any M. tree to save gas and snark constraints, and use quinary trees to maximize tree depth (but you pay more gas). ethresear.ch/t/gas-and-circ…

1st Place in #Cryptography - Poseidon Grand Winner of the Cryptography Track, implements Poseidon hash function in the Zei library, including numerical computation + turbo-PLONK circuit, providing great insight into Zei. #Findora poseidon-hash.info gitcoin.co/hackathon/find…

3/3 To improve the speed of the hash function, the team migrated from the Pedersen Hash Function to Poseidon hash function, as it operates directly on the underlying data type of the circuit. This helps to reduce the cost of connecting all the different parts of the circuits.

This afternoon I attended a very nice PhD defense by @luca_defeo's student Édouard Rousseau on “Efficient Arithmetic of Finite Field Extensions” (the manuscript doesn't seem online yet, but probably will be shortly; in the mean time, this bit is: hal-unc.archives-ouvertes.fr/MC2/hal-021369…‌). •1/6