Triple

T12515618
Position Surface form Disambiguated ID Type / Status
Subject EdDSA E299184 entity
Predicate fullName P16 FINISHED
Object Edwards-curve Digital Signature Algorithm
Edwards-curve Digital Signature Algorithm is a modern public-key signature scheme that uses twisted Edwards-curve cryptography to provide fast, secure, and deterministic digital signatures.
E831082 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: Edwards-curve Digital Signature Algorithm | Statement: [EdDSA, fullName, Edwards-curve Digital Signature Algorithm]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Edwards-curve Digital Signature Algorithm
Context triple: [EdDSA, fullName, Edwards-curve Digital Signature Algorithm]
  • A. 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.
  • 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. Twisted Edwards curve
    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.
  • D. Elliptic Curve Cryptography
    Elliptic Curve Cryptography is a public-key cryptographic approach that uses the mathematics of elliptic curves over finite fields to provide strong security with relatively small key sizes.
  • E. 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.
  • 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: Edwards-curve Digital Signature Algorithm
Triple: [EdDSA, fullName, Edwards-curve Digital Signature Algorithm]
Generated description
Edwards-curve Digital Signature Algorithm is a modern public-key signature scheme that uses twisted Edwards-curve cryptography to provide fast, secure, and deterministic digital signatures.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Edwards-curve Digital Signature Algorithm
Target entity description: Edwards-curve Digital Signature Algorithm is a modern public-key signature scheme that uses twisted Edwards-curve cryptography to provide fast, secure, and deterministic digital signatures.
  • A. 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.
  • 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. 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.
  • D. Elliptic Curve Cryptography
    Elliptic Curve Cryptography is a public-key cryptographic approach that uses the mathematics of elliptic curves over finite fields to provide strong security with relatively small key sizes.
  • E. 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.
  • F. None of above.

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_69d6ada5cdd48190860d9ce30aff69be completed April 8, 2026, 7:33 p.m.
NER Named-entity recognition batch_69d9541f80148190976d1d912fe155d0 completed April 10, 2026, 7:48 p.m.
NED1 Entity disambiguation (via context triple) batch_69f64bbd58b88190baeb99380babf64f completed May 2, 2026, 7:08 p.m.
NEDg Description generation batch_69f64ce257348190b01179773992d414 completed May 2, 2026, 7:13 p.m.
NED2 Entity disambiguation (via description) batch_69f64da735f48190b051ce173c13e5b2 completed May 2, 2026, 7:16 p.m.
Created at: April 8, 2026, 9:57 p.m.