Triple

T9932106
Position Surface form Disambiguated ID Type / Status
Subject Ed25519 E192669 entity
Predicate fullName P16 FINISHED
Object Edwards-curve Digital Signature Algorithm over Curve25519 E299184 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: Edwards-curve Digital Signature Algorithm over Curve25519 | Statement: [Ed25519, fullName, Edwards-curve Digital Signature Algorithm over Curve25519]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Edwards-curve Digital Signature Algorithm over Curve25519
Context triple: [Ed25519, fullName, Edwards-curve Digital Signature Algorithm over Curve25519]
  • A. 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.
  • B. 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.
  • C. 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.
  • D. EdDSA chosen
    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.
  • E. 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.
  • 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_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.
Created at: March 30, 2026, 8:43 p.m.