Triple

T1712044
Position Surface form Disambiguated ID Type / Status
Subject DNSSEC E37203 entity
Predicate supportsAlgorithm P203 FINISHED
Object Ed448
Ed448 is a modern high-security elliptic-curve digital signature algorithm designed for strong cryptographic assurance and efficient performance.
 E192670 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: Ed448 | Statement: [DNSSEC, supportsAlgorithm, Ed448]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Ed448
Context triple: [DNSSEC, supportsAlgorithm, Ed448]
  • A. ElGamal
    ElGamal is a public-key cryptosystem based on the discrete logarithm problem, widely used for secure encryption and digital signatures in various cryptographic protocols.
  • B. Poly1305
    Poly1305 is a high-speed message authentication code (MAC) algorithm commonly used with stream ciphers like ChaCha20 to provide data integrity and authenticity.
  • C. Diffie–Hellman key exchange
    Diffie–Hellman key exchange is a foundational cryptographic protocol that enables two parties to securely establish a shared secret over an insecure communication channel.
  • D. Merkle
    Merkle is a surname most prominently associated with Ralph Merkle, a pioneering computer scientist and cryptographer known for his foundational work in public-key cryptography and Merkle trees.
  • E. Merkle–Damgård construction
    The Merkle–Damgård construction is a fundamental method for building collision-resistant cryptographic hash functions from fixed-size compression functions, used in many classic hash algorithms like MD5 and SHA-1.
  • 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: Ed448
Triple: [DNSSEC, supportsAlgorithm, Ed448]
Generated description
Ed448 is a modern high-security elliptic-curve digital signature algorithm designed for strong cryptographic assurance and efficient performance.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: Ed448
Target entity description: Ed448 is a modern high-security elliptic-curve digital signature algorithm designed for strong cryptographic assurance and efficient performance.
  • A. ElGamal
    ElGamal is a public-key cryptosystem based on the discrete logarithm problem, widely used for secure encryption and digital signatures in various cryptographic protocols.
  • B. Poly1305
    Poly1305 is a high-speed message authentication code (MAC) algorithm commonly used with stream ciphers like ChaCha20 to provide data integrity and authenticity.
  • C. Diffie–Hellman key exchange
    Diffie–Hellman key exchange is a foundational cryptographic protocol that enables two parties to securely establish a shared secret over an insecure communication channel.
  • D. Merkle
    Merkle is a surname most prominently associated with Ralph Merkle, a pioneering computer scientist and cryptographer known for his foundational work in public-key cryptography and Merkle trees.
  • E. Merkle–Damgård construction
    The Merkle–Damgård construction is a fundamental method for building collision-resistant cryptographic hash functions from fixed-size compression functions, used in many classic hash algorithms like MD5 and SHA-1.
  • 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_69a8861912dc8190931af43b4b9158a7 completed March 4, 2026, 7:20 p.m.
NER Named-entity recognition batch_69abaffc4e5c81908ce0b9cfe833445e completed March 7, 2026, 4:56 a.m.
NED1 Entity disambiguation (via context triple) batch_69ad8addf4a48190b19cdb861db5eecd completed March 8, 2026, 2:42 p.m.
NEDg Description generation batch_69ad957adf1c8190b7c8656c1984f998 completed March 8, 2026, 3:27 p.m.
NED2 Entity disambiguation (via description) batch_69ad97af6b388190b2af293599108df3 completed March 8, 2026, 3:37 p.m.
Created at: March 4, 2026, 7:30 p.m.