Triple

T9932115
Position Surface form Disambiguated ID Type / Status
Subject Ed448 E192670 entity
Predicate usesCurve P2367 FINISHED
Object Curve448
Curve448 is a high-security elliptic curve designed for modern cryptographic protocols, particularly for efficient and secure key exchange and digital signatures.
 E831085 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: Curve448 | Statement: [Ed448, usesCurve, Curve448]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Curve448
Context triple: [Ed448, usesCurve, Curve448]
  • A. Ed448
    Ed448 is a modern high-security elliptic-curve digital signature algorithm designed for strong cryptographic assurance and efficient performance.
  • 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. Curve25519-based schemes
    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.
  • D. brainpool curves
    Brainpool curves are a family of elliptic curves over prime fields designed to provide high-security, efficiently implementable alternatives to earlier standardized curves in elliptic curve cryptography.
  • E. EdDSA
    EdDSA (Edwards-curve Digital Signature Algorithm) is a modern public-key signature scheme designed for high performance, security, and resistance to side-channel attacks, commonly used with curves like Ed25519.
  • 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: Curve448
Triple: [Ed448, usesCurve, Curve448]
Generated description
Curve448 is a high-security elliptic curve designed for modern cryptographic protocols, particularly for efficient and secure key exchange and digital signatures.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: Curve448
Target entity description: Curve448 is a high-security elliptic curve designed for modern cryptographic protocols, particularly for efficient and secure key exchange and digital signatures.
  • A. Ed448
    Ed448 is a modern high-security elliptic-curve digital signature algorithm designed for strong cryptographic assurance and efficient performance.
  • 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. Curve25519-based schemes
    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.
  • D. brainpool curves
    Brainpool curves are a family of elliptic curves over prime fields designed to provide high-security, efficiently implementable alternatives to earlier standardized curves in elliptic curve cryptography.
  • E. EdDSA
    EdDSA (Edwards-curve Digital Signature Algorithm) is a modern public-key signature scheme designed for high performance, security, and resistance to side-channel attacks, commonly used with curves like Ed25519.
  • 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_69ca82dd978c8190947124ab0d3315ac completed March 30, 2026, 2:04 p.m.
NER Named-entity recognition batch_69cdb5b54f348190b8e70e7beff6098a completed April 2, 2026, 12:17 a.m.
NED1 Entity disambiguation (via context triple) batch_69d228d1620c8190ac7125b268dd6832 completed April 5, 2026, 9:18 a.m.
NEDg Description generation batch_69d22c3a6fc0819083a376736325a04e completed April 5, 2026, 9:32 a.m.
NED2 Entity disambiguation (via description) batch_69d22cabf39881908f45667751384df5 completed April 5, 2026, 9:34 a.m.
Created at: March 30, 2026, 8:43 p.m.