Triple

T9312310
Position Surface form Disambiguated ID Type / Status
Subject libsodium E224033 entity
Predicate implementsPrimitive P43638 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: [libsodium, implementsPrimitive, Curve25519]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Curve25519
Context triple: [libsodium, implementsPrimitive, 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. 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.
  • D. Ed448
    Ed448 is a modern high-security elliptic-curve digital signature algorithm designed for strong cryptographic assurance and efficient performance.
  • E. 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.
  • 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_69ca8425f4fc81909c1c586e9a5b7530 completed March 30, 2026, 2:09 p.m.
NER Named-entity recognition batch_69cd20ae96e481909a1af9ea1c91f2b2 completed April 1, 2026, 1:42 p.m.
NED1 Entity disambiguation (via context triple) batch_69d0c797640c8190be003e321faf3b86 completed April 4, 2026, 8:11 a.m.
Created at: March 30, 2026, 7:37 p.m.