Triple

T7899047
Position Surface form Disambiguated ID Type / Status
Subject Hal Finney E183402 entity
Predicate workedOn P3 FINISHED
Object 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.
E696524 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: RPOW (Reusable Proofs of Work) | Statement: [Hal Finney, workedOn, RPOW (Reusable Proofs of Work)]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: RPOW (Reusable Proofs of Work)
Context triple: [Hal Finney, workedOn, RPOW (Reusable Proofs of Work)]
  • A. 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.
  • B. Practical Byzantine Fault Tolerance
    Practical Byzantine Fault Tolerance is a consensus algorithm for distributed systems that efficiently tolerates Byzantine (arbitrary) faults, enabling reliable operation even when some nodes behave maliciously or unpredictably.
  • 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. Raft consensus algorithm
    Raft consensus algorithm is a distributed consensus protocol designed to be more understandable and easier to implement than Paxos while providing equivalent fault-tolerant guarantees.
  • E. Bulletproof Wallets
    Bulletproof Wallets is a studio album by Wu-Tang Clan member Ghostface Killah, known for its soulful production, storytelling lyrics, and collaborations with fellow Wu-Tang affiliates.
  • 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: RPOW (Reusable Proofs of Work)
Triple: [Hal Finney, workedOn, RPOW (Reusable Proofs of Work)]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: RPOW (Reusable Proofs of Work)
Target entity description: 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.
  • A. 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.
  • B. Practical Byzantine Fault Tolerance
    Practical Byzantine Fault Tolerance is a consensus algorithm for distributed systems that efficiently tolerates Byzantine (arbitrary) faults, enabling reliable operation even when some nodes behave maliciously or unpredictably.
  • 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. Raft consensus algorithm
    Raft consensus algorithm is a distributed consensus protocol designed to be more understandable and easier to implement than Paxos while providing equivalent fault-tolerant guarantees.
  • E. Bulletproof Wallets
    Bulletproof Wallets is a studio album by Wu-Tang Clan member Ghostface Killah, known for its soulful production, storytelling lyrics, and collaborations with fellow Wu-Tang affiliates.
  • 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_69ca828d13088190b222be7aa9f9315c completed March 30, 2026, 2:02 p.m.
NER Named-entity recognition batch_69cb3a2ae5048190a6824d34b582c366 completed March 31, 2026, 3:06 a.m.
NED1 Entity disambiguation (via context triple) batch_69cb5bb719a08190a0545a361f559bf7 completed March 31, 2026, 5:29 a.m.
NEDg Description generation batch_69cb5f1f864c819086d3a2b04061ead0 completed March 31, 2026, 5:43 a.m.
NED2 Entity disambiguation (via description) batch_69cb76aede388190a56e066c3302c35e completed March 31, 2026, 7:24 a.m.
Created at: March 30, 2026, 5:01 p.m.