108 items match, 0 of them low signal.
LeanIMT+ is a new Merkle tree construction that enables efficient membership and non-membership proofs without the overhead of Sparse Merkle Trees.Privacy & Scaling
Ahead of Sonobe's first release, we had our folding-schemes and IVC library audited by both a human auditor and an AI auditor. This article summarizes their findings.Privacy & Scaling
A standalone WHIR verifier over the 31-bit KoalaBear field can verify a 2^22 polynomial opening on EVM with 100-bit Johnson-bound soundness for 5.65 MGas in software, or 4.33 MGas with experimental extension-field precompiles.Privacy & Scaling
Machina iO publishes a four-part series on circuit-specific decryption keys for FHE: a primitive that lets a decryption committee publish a key for one specific computation and then step away, removing the need for an always-online committee.Privacy & Scaling
PlasmaBlind is a new design for a private, scalable L2 on Ethereum. It uses a folding-scheme technique called BlindFold for sub-100 ms client-side proving and a linked dual-IVC architecture for ~270 to 360 ms aggregator cost per transaction.Privacy & Scaling
Privacy migration to post-quantum cryptography is more time-sensitive than authentication migration — harvest-now-decrypt-later turns every encrypted on-chain ciphertext into a permanent exposure.Privacy & Scaling
An early look at SpeakUp, a zkVM we're prototyping at PSE for client-side, privacy-first proving of WebAssembly programs. The draft design is public and we're looking for feedback.Privacy & Scaling
Everything here already leads the page above.