Random thought: SNARKs are nice partly because committing to zeroes is free. Can you get any savings in STARKs using hash function H', which is H'(x) = H(x) except for H'(0) = 0x0? Would the short-circuiting save any time when committing to real-life witnesses?.

RT @Ingo_zk: Benchmarks for ICICLE’s CPU and CUDA backends are now available on . Thank you @mmaker ! https://t.co/….

RT @mmaker: "Beyond the Circuit" was accepted at IACR's Communications in Cryptology! It contains a few simple protocols for simplifying fo….

RT @casparschwa: RIG is hiring an exceptional Protocol Architecture Researcher. (link to job description in next tweet). RIG is working on….

RT @Khovr: The deadline for Short Term #Poseidon Grants has been extended to 15th March 2025 All researchers from….

We’re extending the grant application deadline for research on strengthening (or breaking!) Poseidon until mid-March. If you're working on algebraic hash function security, now’s your chance -- apply now! 🔥.

RT @asanso: And part II that covers also MNT curves.

RT @soispoke: 🥷🦴🦖 zkFOCIL is here 🥷🦴🦖. by @asn_d6, Benedikt and @soispoke. tdlr: We propose an approach to improve FOCIL privacy by using a….

Similarly, if you are interested in implementing and benchmarking the SNARK-based LRS scheme from our post, drop us a message! We would love to get some prototypes out and start a formal specification of the scheme.

If you have expertise on Linkable Ring Signatures, and you can design a scheme that meets the requirements of our proposal, we would love to hear from you. Please apply for an Ethereum academic grant:

Introducing zkFOCIL, a protocol for private Ethereum inclusion lists! Based on FOCIL (EIP-7805) and powered by Linkable Ring Signatures, validators publish inclusion lists privately without revealing their identity. by @asn_d6, Benedikt and @soispoke.

RT @benediktbuenz: Accumulation/Folding schemes are all the hype. However, all current schemes have proofs that are linear in the circuit s….

RT @RandomString00: Two interesting application of KZH-fold: . A) Distributed PCD with low communication overhead, with concrete use cases….

You can find our research implementation in (major props to.@RandomString00 for the heavy lifting!). We know there’s plenty of room for optimizations and code improvements, and we'd love for people to experiment with KZH-fold and push its limits!.

KZH-fold is based on our KZH multilinear polynomial scheme. A hybrid between KZG and Hyrax, KZH features very fast opening proof times and is friendly to folding. It requires a KZG-like trusted setup and internally represents poly openings as vector-matrix-vector multiplication.

With minimal recursive overhead and sublinear communication cost, we believe KZH-fold is a good fit for decentralized applications that rely on distributed proving and recursion. Our primary use case was sig aggregation:

This work began with our project on Ethereum signature aggregation using folding. We realized that Nova's linear commmunication cost was a dealbreaker in P2P settings, so we designed KZH-fold as a lightweight alternative. KZH-fold strikes a nice balance between Nova and Halo.

🚀 Excited to share fresh work with a heavyweight team: @benediktbuenz @arantxazapico and @RandomString00!. KZH-fold is a pairing-based folding scheme with sublinear communication size and constant recursive overhead. Link:

RT @Khovr: Ethereum Foundation boosts the third-party cryptanalysis of Poseidon hash. It provides bounties for breaking small versions, aw….

Our research highlights open research challenges related to the scalability of PCD constructions. Join us in pushing forward the field of distributed prover PCD by helping out with the open research questions!.