Triple
T2002171
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Daniel J. Bernstein |
E43494
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Curve25519 |
E192664
|
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: Curve25519 | Statement: [Daniel J. Bernstein, notableWork, Curve25519]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Curve25519 Context triple: [Daniel J. Bernstein, notableWork, Curve25519]
-
A.
Ed25519
Ed25519 is a high-speed, high-security elliptic-curve digital signature scheme widely used in modern cryptographic protocols and software.
-
B.
Curve25519-based schemes
chosen
Curve25519-based schemes are cryptographic protocols and algorithms that use the Curve25519 elliptic curve to provide efficient, high-security public-key operations such as key exchange and digital signatures.
-
C.
Ed448
Ed448 is a modern high-security elliptic-curve digital signature algorithm designed for strong cryptographic assurance and efficient performance.
-
D.
Koblitz curves
Koblitz curves are a special class of elliptic curves defined over binary fields that enable particularly efficient and fast implementations of elliptic curve cryptography.
-
E.
Elliptic Curve Digital Signature Algorithm
Elliptic Curve Digital Signature Algorithm is a public-key cryptographic method that uses elliptic curve mathematics to create compact, secure digital signatures for authentication and data integrity.
- 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_69a88715dbbc8190b2299e29e955d997 |
completed | March 4, 2026, 7:25 p.m. |
| NER | Named-entity recognition | batch_69abb8820cec8190a945e5daeb8c9df6 |
completed | March 7, 2026, 5:32 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ae0342ef8c8190b7771076282981c3 |
completed | March 8, 2026, 11:16 p.m. |
Created at: March 4, 2026, 7:37 p.m.