bibibi.ccLoading…
X account @succinctjt named that a new paper with collaborators argues that the size of binary-field hash-based SNARK proofs cannot be halved through the previously hypothesized unproven conjecture.
1/ Hash-based SNARK proofs are hundreds of KB, too large for many applications. Researchers hoped to halve their size using unproven conjectures. Our new paper rules out this route for binary-field SNARKs.
With @QuangVDao @skominers @kaizhengcs
https://t.co/6JQI2plaKx
1/ Hash-based SNARK proofs are hundreds of KB, too large for many applications. Researchers hoped to halve their size using unproven conjectures. Our new paper rules out this route for binary-field SNARKs.
With @QuangVDao @skominers @kaizhengcs
https://t.co/6JQI2plaKx
The following is analysis, separate from reported facts. Verify important claims independently.
Zero-knowledge proofs and binary-field SNARK ecosystem: If the paper's conclusion holds, research and product design relying on this proof-size compression approach will need to be adjusted, potentially limiting some application designs sensitive to proof size.
The information comes from researcher X's post, which includes a paper link, but the supplied material does not contain the paper's content or independent verification, so the applicability and rigor of the technical conclusion cannot be confirmed.
Subject of focus: zero-knowledge proofs and binary-field SNARK ecosystem. Observation period: medium to long term
Loading event timeline…