Triple

T9312235
Position Surface form Disambiguated ID Type / Status
Subject OpenSSL E224032 entity
Predicate supportsAlgorithm P203 FINISHED
Object Diffie–Hellman key exchange E5655 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: Diffie–Hellman key exchange | Statement: [OpenSSL, supportsAlgorithm, Diffie–Hellman key exchange]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Diffie–Hellman key exchange
Context triple: [OpenSSL, supportsAlgorithm, Diffie–Hellman key exchange]
  • A. Diffie–Hellman key exchange chosen
    Diffie–Hellman key exchange is a foundational cryptographic protocol that enables two parties to securely establish a shared secret over an insecure communication channel.
  • B. Dragonfly key exchange
    Dragonfly key exchange is a password-authenticated key exchange (PAKE) protocol designed to provide secure mutual authentication and key establishment resistant to offline dictionary attacks.
  • C. Merkle puzzles
    Merkle puzzles are an early cryptographic protocol that introduced the concept of public-key exchange by allowing two parties to establish a shared secret over an insecure channel using computationally asymmetric “puzzle” problems.
  • D. Negotiated Finite Field Diffie-Hellman Ephemeral Parameters for Transport Layer Security (TLS)
    "Negotiated Finite Field Diffie-Hellman Ephemeral Parameters for Transport Layer Security (TLS)" is an IETF standard (RFC 7919) that defines secure, standardized finite-field Diffie-Hellman parameter sets for use in TLS to improve cryptographic security and interoperability.
  • 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.
  • 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.