---
title: 'ODKE+: Multi-Field Technical Protocols'
url: https://www.emergentmind.com/topics/odke
type: topic
---

# ODKE+: Multi-Field Technical Protocols

ODKE+ designates several unrelated but highly technical protocols and systems across distinct fields. The ODKE+ designation has appeared in: (1) ontology-guided large language model (LLM)-based knowledge extraction pipelines for knowledge graphs, (2) optical direct key exchange protocols using binary intensity modulation and direct detection under eavesdropping, and (3) onion-routed, multi-circuit key establishment protocols for quantum-resilient session security. Each instantiation is detailed independently below, anchored in the published literature and experimental deployments.

## 1. Ontology-Guided Open-Domain Knowledge Extraction with LLMs

ODKE+ as presented in "Ontology-Guided Open-Domain Knowledge Extraction with LLMs" [2509.04696] specifies a modular production-scale system for the high-precision extraction and ingestion of open-domain facts from web sources—primarily Wikipedia—into large-scale knowledge graphs (KGs). The primary objective is to maintain KG completeness and temporal freshness through automated workflows, minimizing human curation costs and ensuring schema consistency across a broad predicate space.

### Pipeline Architecture

ODKE+ integrates five sequential modules:

1. **Extraction Initiator**: Continuously monitors for entity page creations or updates and compares KG state ($KG_t$) versus newly surfaced facts ($Web_{t'}$) to detect both "missing" ($M = \{ \langle e,p,o \rangle \in Web_{t'} \setminus KG_t \}$) and stale facts (where $\langle e,p,o_{\text{old}} \rangle$ is superseded by $o_{\text{new}}$).
2. **Evidence Retriever**: Fetches full text or structured snippets for flagged entities from a web crawl index; canonicalizes entity-to-URL mapping.
3. **Hybrid Knowledge Extractors**:
   - **Pattern-based**: Deploys high-precision, field-aligned extraction rules against semi-structured tables (e.g., infoboxes), comprising a Predicate Mapper, Value Extractor (regex/unit handling), and Aggregator.
   - **LLM-based with Ontology-Guided Prompting**: Constructs contextually pruned "ontology snippets" per entity type $t$, listing top-K predicates (ranked by $S(p,t) = \text{freq}_{kg}(p|t) / \max_{p'} \text{freq}_{kg}(p'|t)$), canonical descriptions, qualifiers ($Q_p$), normalization requirements, and allowable units ($U_p$). The snippet, combined with page context, forms a constrained JSON extraction prompt for the LLM.
4. **Grounder**: Validates candidate triples by querying a lightweight LLM in a factual-checking regime: for each assertion generated, it outputs "Yes" only if the supporting evidence is explicit in the source context.
5. **Corroborator**: Normalizes extracted values, aggregates candidates per $\langle e,p \rangle$, deduplicates, and applies a linear or AutoML-derived ranking function based on a feature vector $x_v = [\alpha, \beta, \gamma, \delta]$ (extractor type, model/rule confidence, document frequency, qualifier richness).

### Prompt Construction and Schema Guidance

Ontology-guided snippets are computed offline from KG schema and metadata, producing token-limited JSON fragments (predicate, description, qualifiers, normalization rules) tailored per type. LLM extraction prompts explicitly list allowed schema fields and instruct for exact-match, non-inferential, and non-hallucinatory extraction. The grounder employs minimalistic natural language assertions for efficient, low-latency support verification.

### Metrics and Results

- **Production metrics**: 19M high-confidence facts extracted, 195 predicates supported, 4M entity pages processed.
- **Precision**: 98.8% (weekly human QA), with raw LLM output at 91% pre-corroboration.
- **Coverage gain**: +10% answerable facts versus legacy, 48% predicate overlap with third-party KGs.
- **Update lag**: Average KG update latency reduced by 50 days.
- **Operational modes**: Batch (full re-crawl), and streaming (real-time entity edits, 150–250K new facts/day, <2h latency).
- **Empirical findings**: Post-grounding, hallucinations reduced by 35%. LLM-based methods are essential for full predicate coverage (>195), whereas pattern rules suffice for a small infobox subset.

### Summary Table: ODKE+ Knowledge Extraction Pipeline

| Module                | Primary Function                              | Key Feature              |
|-----------------------|-----------------------------------------------|--------------------------|
| Extraction Initiator  | Detects missing/stale facts                   | KG-page diffing          |
| Evidence Retriever    | Collects canonicalized source documents       | Deterministic URLs       |
| Knowledge Extractors  | Extracts candidate facts; hybridized LLM/pattern | Schema-constrained prompts |
| Grounder              | Validates factual support with secondary LLM  | Hallucination filtering  |
| Corroborator          | Ranks, normalizes, and exports triples        | Linear/AutoML scoring    |

## 2. Optical Direct Key Exchange Plus Protocol

In the cryptographic context, ODKE+ denotes "Optical Direct Key Exchange Plus," an intensity-modulation/direct-detection (IM/DD) protocol operating over optical channels, specifically optimized under passive eavesdropping models [2109.12335]. This protocol is a variant of classical key distribution using binary optical intensities and statistical security against an eavesdropper limited only by shot noise and device parameters.

### Protocol Model

- **Transmitter (Alice):** Encodes bits as optical pulses with mean photon numbers $n_A \in \{0, A\}$, uniform random bit selection.
- **Channel splitting:** Bob receives fraction $\eta_B$; eavesdropper (Eve) intercepts $\eta_E$ (beam-splitter model), $\eta_B + \eta_E \leq 1$.
- **Detection:** Both legitimate and adversarial receivers implement direct detection with additive Gaussian noise ($\sigma_B^2$, $\sigma_E^2$).

### Secret-Key Rate Analysis

The key rate per slot is
\[
K = p_{\text{raw}} \big\{ \xi [1-H_2(\epsilon)] - I(B;E) \big\}
\]
where:
- $p_{\text{raw}}$: non-erasure probability,
- $\epsilon$: Bob’s bit error rate,
- $H_2$: binary entropy,
- $I(B;E)$: Eve's mutual information on Bob’s bit,
- $\xi$: reconciliation efficiency.

Eve's information is computed via
\[
I(B;E) = \int_{-\infty}^\infty dt \, \varphi(t;\delta_E) \left\{ \epsilon \log_2 [\epsilon e^{\delta_E t} + (1-\epsilon)e^{-\delta_E t}] + (1-\epsilon) \log_2 [(1-\epsilon)e^{\delta_E t} + \epsilon e^{-\delta_E t}] - \log_2 \cosh(\delta_E t) \right\}
\]
with $\varphi(t;\delta_E)$ the normalized Gaussian density, and normalized modulation depths $\delta_B \equiv \eta_B A/(2\sigma_B)$, $\delta_E \equiv \eta_E A/(2\sigma_E)$.

In the strong-splitting limit ($\eta_E \gg \eta_B$), the rate simplifies to
\[
K \approx C(\kappa^*) \cdot \gamma^{as}(\xi) \cdot \frac{1}{2} R \log_2 e
\]
where $R = (\eta_B \sigma_E / \eta_E \sigma_B)^2$.

### Design Guidance

- **Modulation depth:** $A_{\text{opt}} = 2\sigma_E \delta_E^*/\eta_E$
- **Hard-decision thresholds:** $T_\pm = \eta_B A_{\text{opt}}/2 \pm \kappa^* \sigma_B$, $\kappa^*\approx0.6120$

System parameters are calibrated in real-time based on measured channel conditions ($\eta_B$, $\sigma_B$) and pre-tabulated optimal $(\delta_E^*, \kappa^*)$ pairs for given reconciliation efficiencies. This approach guarantees key rate maximization against passive, quantum-unbounded adversaries attuned only by physical noise constraints.

## 3. Onion-Routed Multi-Circuit Key Establishment for Quantum-Resilient Sessions

A third protocol labeled ODKE+ is specified in "Onion-Routed Multi-Circuit Key Establishment for Quantum-Resilient Sessions" [2605.21349]. Here, ODKE+ targets the "harvest-now, decrypt-later" (HNDL) threat from future cryptographically relevant quantum computers. It achieves session key confidentiality and unlinkability by partitioning a session key into $n$ cryptographically protected fragments, which are then independently transmitted over $n$ Tor circuits, each established using the NEWNYM Tor control signal.

### Threat Model

- **Adversary $\mathcal{A}$**: Archives all ciphertext and can eventually break classical public-key encryption. Controls a fraction $f$ of the Tor relay set ($P$ total relays) but not all.
- **Anonymity property**: $\mathcal{A}$'s probability of linking all $n$ fragments for a single session decays as $f^{2n}$, under the assumption of (quasi-)independent circuit selection.

### Protocol Steps

- Session tag and key parameters are agreed out-of-band.
- The client requests a session key (256–768 bits typical), specifying number of fragments $n$, from the Key Management Service (QKMS), via a Tor-based onion service proxy.
- QKMS splits the session key, optionally shuffles fragments, encrypts each with the client’s key (RSA-2048 or a hybrid KEM), and distributes fragments to the proxy’s channels.
- For each bundle/chunk of fragments, proxies trigger a new Tor circuit (SIGNAL NEWNYM), wait for stabilization, then POST to the client’s hidden service endpoint.
- Client reconstructs the session key after all $n$ encrypted fragments are received and decrypted.

Pseudocode is provided for all roles (QKMS, proxy, client) in the protocol [2605.21349].

### Security Analysis

- Per onion circuit, end-to-end correlation probability is approximately $f^2$.
- For $n$ independent circuits, adversary's success probability is $f^{2n}$.
- With $f=0.05$ and $n=10$, this implies $10^{-26}$ circuit correlations, effectively ensuring unlinkability between the key and the associated session.

### Parameterization and Performance

- **Number of fragments ($n$):** Security rises exponentially with $n$; latency increases linearly (Tor circuit build and stabilization dominate: per-circuit 0.5–1.5s typical).
- **Encryption:** RSA-2048 or hybrid KEM per fragment; AES-GCM for data after establishment.
- **Measured prototype:** 13–20s end-to-end latency (n=10), with ≈88% Tor-overhead; cryptographic processing ≈12%; per-fragment decryption cost 0.18–0.21s.
- **Trade-off:** High anonymity suitable for non-interactive, high-confidentiality session setup with multi-year security requirements.

| Parameter           | Security Impact                 | Latency Impact          |
|---------------------|---------------------------------|------------------------|
| $n$ (fragments)     | Anonymity $\sim f^{2n}$ (exp.)  | Linear in $n$          |
| $k$ (key length)    | Fragment size adjustment        | Crypto cost per frag.  |
| Fragment encryption | PQ-resilience (hybrid KEM)      | Extra per-fragment ops |

## 4. Core Insights and Lessons Learned

Across these diverse ODKE+ instantiations, the following principles underpin their effectiveness:

- **Layered, modular design** enhances both adaptability and production viability, whether for LLM-centric pipelines or distributed cryptographic protocols.
- **Schema and context anchoring** (in LLM-based extraction and PG KEM selection) delivers both precision and resilience to adversarial or unstructured input.
- **Hybridization** (pattern rules plus ML/LLM for extraction, PQ + classical for encryption) leverages complementary strengths, expanding coverage while containing operational costs and error rates.
- **Parameter tuning**—whether for key establishment anonymity (via $n$) or optical modulation (via $A_{\text{opt}}$, $T_{\text{opt}}$)—enables systems to dynamically optimize under real-world latency, resource, or security constraints.
- **Verification and corroboration** modules systematically reduce error rates (hallucinations, false positives) to practical thresholds for deployment.

## 5. Practical Applications and Impact

In KG construction, ODKE+ has demonstrated production-scale capacity to refresh knowledge graphs with millions of high-confidence, schema-compliant facts, substantially reducing update lag and boosting real-world task coverage [2509.04696]. In cryptography, ODKE+ protocols deliver sound, quantifiable security either rooted in physical channel statistics (optical, shot-noise-limited settings [2109.12335]) or in composite anonymity via network fragmentation and post-quantum cryptography (Tor-based sessions [2605.21349]). These results indicate broad applicability where trustworthiness, interpretability, and adversarial robustness are core operational requirements.

Source: https://www.emergentmind.com/topics/odke