Triple

T9029541
Position Surface form Disambiguated ID Type / Status
Subject Zcash E216133 entity
Predicate usesTechnology P1485 FINISHED
Object zk-SNARKs
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.
E773515 NE FINISHED

How this triple was built (4 steps)

Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.

NER Named-entity recognition gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: zk-SNARKs | Statement: [Zcash, usesTechnology, zk-SNARKs]
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.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: zk-SNARKs
Triple: [Zcash, usesTechnology, zk-SNARKs]
Generated 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.
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

Provenance (5 batches)

The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.

Step Stage Batch ID Status When
creating Elicitation batch_69ca83a5fa88819088144801b4dd7245 completed March 30, 2026, 2:07 p.m.
NER Named-entity recognition batch_69cc6a9bcb508190b58751f1772407d4 completed April 1, 2026, 12:45 a.m.
NED1 Entity disambiguation (via context triple) batch_69cfdbc289648190834031537c8ce130 completed April 3, 2026, 3:24 p.m.
NEDg Description generation batch_69cfde57a18c8190b4b8c8d2f521bd2c completed April 3, 2026, 3:35 p.m.
NED2 Entity disambiguation (via description) batch_69cfdec619d081909fd6b268f4ce06b9 completed April 3, 2026, 3:37 p.m.
Created at: March 30, 2026, 7:08 p.m.