zkSNARK
Zero-Knowledge Succinct Non-Interactive Argument of Knowledge, a zero-knowledge proof construction that allows a prover to demonstrate to a verifier knowledge of a secret input satisfying a specific relation without revealing that input; proofs are small, fast to verify, and require no multiple rounds of interaction.
Timeline (last 90 days)
Anthropic has open-sourced FlashProve, a zkSNARK prototype released under the Apache 2.0 license, used to prove that an AI response comes from a committed set of weights without revealing the weights.
zkSNARK is the abbreviation of "zero-knowledge succinct non-interactive argument of knowledge", which allows a prover to convince a verifier that it knows a secret input satisfying a specific relation without revealing that input itself, with a small proof size, short verification time and no need for multiple rounds of interaction.
zkSNARK usually relies on cryptographic tools such as polynomial commitments and elliptic curve pairings; the larger the circuit, the higher the proof generation overhead, which is also why it was previously difficult for it to cover large-model inference workloads.
All Facts (3)
zkSNARK is the abbreviation of "zero-knowledge succinct non-interactive argument of knowledge", which allows a prover to convince a verifier that it knows a secret input satisfying a specific relation without revealing that input itself, with a small proof size, short verification time and no need for multiple rounds of interaction.
50%UnverifiedzkSNARK usually relies on cryptographic tools such as polynomial commitments and elliptic curve pairings; the larger the circuit, the higher the proof generation overhead, which is also why it was previously difficult for it to cover large-model inference workloads.
50%UnverifiedAnthropic has open-sourced FlashProve, a zkSNARK prototype released under the Apache 2.0 license, used to prove that an AI response comes from a committed set of weights without revealing the weights.
50%