Triple
T4381591
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Ralph Merkle |
E99141
|
entity |
| Predicate | developedConcept |
P73
|
FINISHED |
| Object | Merkle tree |
E105392
|
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: Merkle tree | Statement: [Ralph Merkle, developedConcept, Merkle tree]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Merkle tree Context triple: [Ralph Merkle, developedConcept, Merkle tree]
-
A.
Merkle tree
chosen
A Merkle tree is a cryptographic data structure that uses a tree of hash values to efficiently and securely verify the integrity and consistency of large sets of data.
-
B.
Merkle
Merkle is a surname most prominently associated with Ralph Merkle, a pioneering computer scientist and cryptographer known for his foundational work in public-key cryptography and Merkle trees.
-
C.
Merkle–Damgård construction
The Merkle–Damgård construction is a fundamental method for building collision-resistant cryptographic hash functions from fixed-size compression functions, used in many classic hash algorithms like MD5 and SHA-1.
-
D.
SHA-256
SHA-256 is a widely used cryptographic hash function from the SHA-2 family that produces a 256-bit hash value for securing data integrity and authentication.
-
E.
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.
- 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_69b3454ea8f48190a49c2436624d6ef6 |
completed | March 12, 2026, 10:59 p.m. |
| NER | Named-entity recognition | batch_69b352613dd481909e008a8db239a108 |
completed | March 12, 2026, 11:55 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b5f5e210108190bf14731ce3774b6b |
completed | March 14, 2026, 11:57 p.m. |
Created at: March 12, 2026, 11:18 p.m.