Triple
T10595206
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | CFRG |
E250093
|
entity |
| Predicate | standardized |
P1371
|
FINISHED |
| Object | Verifiable Random Functions (VRFs) |
E413706
|
NE FINISHED |
How this triple was built (2 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: Verifiable Random Functions (VRFs) | Statement: [CFRG, standardized, Verifiable Random Functions (VRFs)]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Verifiable Random Functions (VRFs) Context triple: [CFRG, standardized, Verifiable Random Functions (VRFs)]
-
A.
Verifiable Random Function
chosen
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.
-
B.
Fiat–Shamir heuristic
The Fiat–Shamir heuristic is a cryptographic technique that transforms interactive proof systems into non-interactive ones using hash functions, widely used in digital signatures and zero-knowledge proofs.
-
C.
Naor–Reingold pseudorandom function
The Naor–Reingold pseudorandom function is a foundational cryptographic construction that provides a simple, efficient, and provably secure method for generating pseudorandom outputs from secret keys based on number-theoretic assumptions.
-
D.
RPOW (Reusable Proofs of Work)
RPOW (Reusable Proofs of Work) was an early digital cash system proposed by Hal Finney that aimed to make proof-of-work tokens transferable and reusable, serving as a conceptual precursor to modern cryptocurrencies.
-
E.
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.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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_69d381c9d3d48190a29ee491e1696a0e |
completed | April 6, 2026, 9:50 a.m. |
| NER | Named-entity recognition | batch_69d5278cbf9081909ef419b0144d5019 |
completed | April 7, 2026, 3:49 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d95e8de2e88190835954abb2ac2ece |
completed | April 10, 2026, 8:33 p.m. |
Created at: April 6, 2026, 12:41 p.m.