Triple
T12515619
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | EdDSA |
E299184
|
entity |
| Predicate | usesCurveType |
P91194
|
FINISHED |
| Object | twisted Edwards curves |
E831082
|
NE FINISHED |
How this triple was built (3 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: twisted Edwards curves | Statement: [EdDSA, usesCurveType, twisted Edwards curves]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: twisted Edwards curves Context triple: [EdDSA, usesCurveType, twisted Edwards curves]
-
A.
Twisted Edwards curve
chosen
A Twisted Edwards curve is a type of elliptic curve with a specific algebraic form that enables especially fast and secure implementations of cryptographic operations such as digital signatures and key exchange.
-
B.
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.
-
C.
Tate curve
The Tate curve is a type of elliptic curve defined over non-archimedean local fields, central to John Tate’s work on p-adic uniformization and the study of elliptic curves with bad reduction.
-
D.
Curve448
Curve448 is a high-security elliptic curve designed for modern cryptographic protocols, particularly for efficient and secure key exchange and digital signatures.
-
E.
Montgomery ladder
The Montgomery ladder is a scalar multiplication algorithm on elliptic curves that provides efficient, uniform, and side-channel-resistant computation for cryptographic protocols such as those based on Curve25519.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: usesCurveType Context triple: [EdDSA, usesCurveType, twisted Edwards curves]
-
A.
commonlyUsedCurve
Indicates that the referenced curve is widely adopted or frequently used in common practice or standard applications.
-
B.
isCurved
Indicates that an object or path deviates smoothly from a straight line, forming a bend or arc.
-
C.
includesCurve
chosen
Indicates that one entity contains or encompasses a particular curve as part of its geometric or structural definition.
-
D.
curvePurpose
Indicates that a curve exists or is defined for a particular purpose, function, or intended use.
-
E.
relatedCurve
Indicates that one curve is associated with or derived from another curve in a defined relational way.
- F. None of above.
Provenance (4 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_69d6ada5cdd48190860d9ce30aff69be |
completed | April 8, 2026, 7:33 p.m. |
| NER | Named-entity recognition | batch_69d954b867dc8190af8a70f797e4d133 |
completed | April 10, 2026, 7:51 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69f64bbd58b88190baeb99380babf64f |
completed | May 2, 2026, 7:08 p.m. |
| PD | Predicate disambiguation | batch_69d954096af88190b6be81b008c82139 |
completed | April 10, 2026, 7:48 p.m. |
Created at: April 8, 2026, 9:57 p.m.