Triple
T33579832
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Miller algorithm |
E860121
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | pairing computation algorithm |
C53997
|
CONCEPT FINISHED |
How this triple was built (1 step)
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.
CD
Concept disambiguation
gpt-5-mini-2025-08-07
Target class: pairing computation algorithm Context triple: [Miller algorithm, instanceOf, pairing computation algorithm]
-
A.
Koblitz curve
A Koblitz curve is a special type of elliptic curve defined over a binary finite field that allows particularly efficient arithmetic using the Frobenius endomorphism, commonly used in elliptic curve cryptography.
-
B.
NIST-recommended elliptic curve
A NIST-recommended elliptic curve is a standardized elliptic curve over a finite field selected by the U.S. National Institute of Standards and Technology for use in secure public-key cryptography.
-
C.
Gröbner basis algorithm
A Gröbner basis algorithm is a computational procedure that transforms a set of multivariate polynomials into a special generating set (a Gröbner basis) that simplifies solving and analyzing polynomial ideal problems such as solving systems of equations, ideal membership, and elimination.
-
D.
algorithm in number theory
An algorithm in number theory is a finite, well-defined computational procedure designed to solve problems involving integers and their properties, such as divisibility, primality, and modular relationships.
-
E.
cryptographic protocol component
chosen
A cryptographic protocol component is a modular element—such as a key exchange, authentication step, or encryption mechanism—that participates in a larger protocol to provide specific security properties like confidentiality, integrity, or authenticity.
- F. None of above.
Provenance (1 batch)
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_69f3497d37848190afcbb5ef3f5c7376 |
completed | April 30, 2026, 12:22 p.m. |
Created at: May 1, 2026, 1:40 a.m.