Triple
T33027037
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | BLAKE2s |
E845069
|
entity |
| Predicate | secondPreimageResistanceBits |
P91186
|
FINISHED |
| Object | 256 bits |
—
|
LITERAL 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: 256 bits | Statement: [BLAKE2s, secondPreimageResistanceBits, 256 bits]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: secondPreimageResistanceBits Context triple: [BLAKE2s, secondPreimageResistanceBits, 256 bits]
-
A.
secondPreimageResistance
chosen
Indicates that, given one input and its output under a function (typically a hash), it is computationally infeasible to find a different input that produces the same output.
-
B.
preimageResistance
Indicates that it is computationally infeasible to find any input that maps to a given output under the function (e.g., a cryptographic hash), even when that output is known.
-
C.
collisionResistanceBits
Indicates the number of bits of security a cryptographic function provides against finding any two distinct inputs that produce the same output (a collision).
-
D.
collisionResistanceTarget
Indicates that the entity serves as the designated object or system that a collision-resistance mechanism is intended to protect against successful collisions.
-
E.
usesMerkleDamgårdConstruction
Indicates that a cryptographic hash function is built by iterating a fixed-size compression function over message blocks using the Merkle–Damgård construction.
- F. None of above.
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_69f34950749c8190ae05cd27adb16d58 |
completed | April 30, 2026, 12:21 p.m. |
| NER | Named-entity recognition | batch_69fec4cffed08190b5e5e7cc0c87493e |
completed | May 9, 2026, 5:23 a.m. |
| PD | Predicate disambiguation | batch_69fec2ea7fe08190bd751b39515f69d1 |
completed | May 9, 2026, 5:15 a.m. |
Created at: May 1, 2026, 1:23 a.m.