zk-SNARKs
E773515
zk-SNARKs are a form of zero-knowledge cryptographic proof that allows one party to prove the validity of a statement to another without revealing any underlying information and with very short, quickly verifiable proofs.
All labels observed (4)
| Label | Occurrences |
|---|---|
| zk-SNARKs canonical | 3 |
| Groth16 zk-SNARK construction | 1 |
| “Non-interactive zero-knowledge arguments for voting” | 1 |
| “Short non-interactive zero-knowledge proofs” | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T9029541 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: zk-SNARKs Context triple: [Zcash, usesTechnology, zk-SNARKs]
-
A.
Zcash
Zcash is a privacy-focused cryptocurrency that uses zero-knowledge proofs to enable shielded, confidential transactions on a public blockchain.
-
B.
Verifiable Random Function
A Verifiable Random Function (VRF) is a cryptographic primitive that produces pseudo-random outputs along with proofs that anyone can verify to confirm the outputs were correctly generated from a given input and secret key.
-
C.
Merkle puzzles
Merkle puzzles are an early cryptographic protocol that introduced the concept of public-key exchange by allowing two parties to establish a shared secret over an insecure channel using computationally asymmetric “puzzle” problems.
-
D.
The Knowledge Complexity of Interactive Proof Systems
"The Knowledge Complexity of Interactive Proof Systems" is a seminal theoretical computer science paper that introduced the notion of zero-knowledge proofs, fundamentally shaping modern cryptography and complexity theory.
-
E.
Shamir secret sharing scheme
The Shamir secret sharing scheme is a cryptographic method that divides a secret into multiple parts so that only a specified threshold of parts can reconstruct the original secret, while fewer parts reveal nothing.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: zk-SNARKs Target entity description: zk-SNARKs are a form of zero-knowledge cryptographic proof that allows one party to prove the validity of a statement to another without revealing any underlying information and with very short, quickly verifiable proofs.
-
A.
Zcash
Zcash is a privacy-focused cryptocurrency that uses zero-knowledge proofs to enable shielded, confidential transactions on a public blockchain.
-
B.
Verifiable Random Function
A Verifiable Random Function (VRF) is a cryptographic primitive that produces pseudo-random outputs along with proofs that anyone can verify to confirm the outputs were correctly generated from a given input and secret key.
-
C.
Merkle puzzles
Merkle puzzles are an early cryptographic protocol that introduced the concept of public-key exchange by allowing two parties to establish a shared secret over an insecure channel using computationally asymmetric “puzzle” problems.
-
D.
Equihash
Equihash is a memory-hard, proof-of-work hashing algorithm designed to be ASIC-resistant and used in cryptocurrencies such as Zcash.
-
E.
The Knowledge Complexity of Interactive Proof Systems
"The Knowledge Complexity of Interactive Proof Systems" is a seminal theoretical computer science paper that introduced the notion of zero-knowledge proofs, fundamentally shaping modern cryptography and complexity theory.
- F. None of above. chosen
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
cryptographic primitive
ⓘ
zero-knowledge proof system ⓘ |
| aimsTo |
hide witness information
ⓘ
prove statement correctness ⓘ |
| basedOn |
bilinear pairings
ⓘ
elliptic curve cryptography ⓘ quadratic arithmetic programs ⓘ rank-1 constraint systems ⓘ |
| comparedTo | interactive zero-knowledge proofs ⓘ |
| differsFrom |
bulletproofs
ⓘ
zk-STARKs ⓘ |
| ensures |
completeness
ⓘ
soundness ⓘ zero-knowledge property ⓘ |
| formalizedAs | non-interactive argument system in the common reference string model ⓘ |
| fullForm | zero-knowledge Succinct Non-interactive Argument of Knowledge ⓘ |
| hasAdvantage |
very fast verification time
ⓘ
very small proof size ⓘ |
| hasComponent |
prover algorithm
ⓘ
setup algorithm ⓘ verifier algorithm ⓘ |
| hasDisadvantage |
reliance on pairing-friendly curves
ⓘ
trusted setup requirement in many schemes ⓘ |
| hasOutput | succinct proof ⓘ |
| hasProperty |
argument of knowledge
ⓘ
fast verification ⓘ non-interactive ⓘ probabilistic soundness ⓘ publicly verifiable ⓘ short proofs ⓘ succinct ⓘ zero-knowledge ⓘ |
| requires | trusted setup in many constructions ⓘ |
| researchArea |
blockchain privacy
ⓘ
modern cryptography ⓘ verifiable computation ⓘ |
| securityAssumption |
cryptographic pairing hardness assumptions
ⓘ
discrete logarithm hardness ⓘ knowledge of exponent assumption ⓘ |
| usedFor |
anonymous transactions
ⓘ
blockchain scalability ⓘ confidential smart contracts ⓘ privacy-preserving proofs ⓘ proofs of correct computation ⓘ verifiable computation ⓘ |
| usedIn |
Zcash
ⓘ
layer-2 blockchain protocols ⓘ privacy-focused cryptocurrencies ⓘ |
| usedToProve | knowledge of a witness for an NP statement ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: zk-SNARKs Description of subject: zk-SNARKs are a form of zero-knowledge cryptographic proof that allows one party to prove the validity of a statement to another without revealing any underlying information and with very short, quickly verifiable proofs.
Referenced by (6)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: zk-SNARKs
linked to: zk-SNARKs
linked to: zk-SNARKs