Network Working Group H. Jorgen Internet-Draft Kenosian Intended status: Experimental 30 June 2026 Expires: 1 January 2027 The TLS TimeToken Secure Protocol (tttps://) draft-helmprotocol-tttps-05 Abstract This document specifies the TLS TimeToken Secure Protocol (tttps://), a protocol extension that augments TLS 1.3 [RFC8446] with cryptographically verifiable temporal ordering. TTTPS is a blockchain-independent, general-purpose time-proof protocol that spans deployment environments from terrestrial networks to deep-space and Space-Air-Ground Integrated Network (SAGIN) relays, using a single opaque context identifier and a propagation-delay- adaptive tier to cover the full range from sub-100ms terrestrial ordering to multi-minute interplanetary light-time. Internet infrastructure assumes that channels are passive: noise is random and channel operators have no ordering preferences. This assumption is structurally violated when ordering has economic value -- NTP servers, BGP routing authorities, DNS resolvers, and transaction sequencers all have incentive to misrepresent ordering. This document formalises the problem as the Strategic Channel Controller Problem (SCCP), absent from classical information theory. Temporal ordering attacks are structurally more acute for autonomous AI agents than for human participants: as agent reaction times converge toward symmetry, ordering advantage can no longer be earned through superior human latency. No existing protocol -- including O(n^2) BFT consensus, which tolerates but does not eliminate Byzantine nodes -- provides a cryptographic pre-ingestion defense for this case. TTTPS introduces Proof-of-Time (PoT): a multi-source synthesised timestamp protected by the GRG integrity pipeline (Golomb-Rice -> Reed-Solomon -> Golay(23,12,7) -> HMAC), whose stage ordering is mathematically necessary (Theorems 1-3 of the companion paper [POT2026]). PoT achieves Byzantine temporal elimination at O(1) per record, independent of network size. An AdaptiveSwitch mechanism makes ordering manipulation economically self-defeating; the equilibrium threshold is derived in closed form and empirically calibrated from deployed data (Section 7.4). Jorgen Expires 1 January 2027 [Page 1] Internet-Draft TTTPS June 2026 A reference deployment produces 70,000+ verified records; 55% are generated by autonomous AI agents -- an unanticipated finding that confirms the structural severity of the ordering problem in agent economies. This document has Experimental status. The GRG pipeline specification will be published upon conclusion of pending patent proceedings (Section 13). Discussion Note This note is to be removed before publishing as an RFC. This document is being discussed on the dispatch@ietf.org mailing list. The authors have submitted a BoF request for IETF 126 (Vienna, July 2026) targeting the DISPATCH working group. Comments and participation are welcome. Changes from -04: * Header: revision -04 -> -05; dates updated (24 June 2026 / Expires 26 December 2026). * IANA Considerations: added a new subsection "URI Scheme Registration" recording that IANA has provisionally registered the "tttps" URI scheme [RFC7595] in the provisional URI Schemes registry, and added [RFC7595] to the normative references. * Section cross-reference consistency: corrected prose references that named the Implementation Status section and its subsections by their -03 numbers. In the rendered document the Implementation Status section is Section 14 (subsections 14.1-14.4) and References is Section 15; running text now matches these rendered numbers (formerly "Section 15.2", "Section 15.3", "Section 15.4", and "New Section 15: Implementation Status"). * Changelog wording: the Implementation Status section was first added in -03, not -04; the "New Section" wording in earlier changelog entries has been retained only where historically accurate and the stale section numbers corrected. * Interested Parties (Section 14.4): replaced the bracketed editorial placeholder with a plain-language status statement reflecting that no interested-party statements have been received at the time of this revision. Jorgen Expires 1 January 2027 [Page 2] Internet-Draft TTTPS June 2026 * Apart from the IANA URI Scheme Registration subsection noted above, no other normative or descriptive content changed; all remaining -04 text is carried forward verbatim. Changes from -03: * Header: revision -03 -> -04; dates updated (23 June 2026 / Expires 25 December 2026). * New subsection Formal Verification Artifacts (Section 14.3 in the rendered document) -- records the publicly available kenoslean PyPI package (version 0.1.0) and the Lean 4 / Mathlib formalisation of the G-Score / InsufficientKnowledge confidence primitive (sorry-free). (Interested Parties became Section 14.4.) * New Appendix E: Motivating Use Case -- a regulated therapeutic- design data-integrity scenario distinguishing record integrity (TTTPS) from computation integrity (formal verification), aligned with FDA 21 CFR Part 11. * References: [I-D.ietf-ntp-roughtime] (Roughtime, the protocol the D_chain mechanism depends on) and [I-D.ietf-rats-msg-wrap] (CMW) added as informative references; both are in the RFC Editor Queue as of June 2026 (status verified on the IETF Datatracker). [KENOSLEAN] and [CFR-21-Part-11] added. Changes from -02: * New Section 1.1: "Why This Protocol, Why Now" * New Section 2: Use Cases (satellite, 5G, financial, AI agents) * New Section 4.2: SS7 Legacy Infrastructure as a Strategic Channel Controller Problem Instance * New Section 10.8: Path Manipulation Attack Scenarios (3 scenarios) * New Section 10.9: Trust Model and Key Compromise Resilience * New Implementation Status section (RFC 7942; Section 14 in the rendered document) * Section 5.4 Verification: future-timestamp check, TLS binding step * References: SS7-VULN, GSMA-SS7, GPS-SPOOF, RFC6962, RFC9557 Jorgen Expires 1 January 2027 [Page 3] Internet-Draft TTTPS June 2026 Status of This Memo This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79. Internet-Drafts are working documents of the Internet Engineering Task Force (IETF). Note that other groups may also distribute working documents as Internet-Drafts. The list of current Internet- Drafts is at https://datatracker.ietf.org/drafts/current/. Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress." This Internet-Draft will expire on 1 January 2027. Copyright Notice Copyright (c) 2026 IETF Trust and the persons identified as the document authors. All rights reserved. This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (https://trustee.ietf.org/ license-info) in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document. Code Components extracted from this document must include Revised BSD License text as described in Section 4.e of the Trust Legal Provisions and are provided without warranty as described in the Revised BSD License. Table of Contents 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 6 1.1. Why This Protocol, Why Now . . . . . . . . . . . . . . . 7 1.2. Objectives . . . . . . . . . . . . . . . . . . . . . . . 8 1.3. Protocol Overview . . . . . . . . . . . . . . . . . . . . 8 1.4. Scope . . . . . . . . . . . . . . . . . . . . . . . . . . 9 1.5. Terminology . . . . . . . . . . . . . . . . . . . . . . . 10 2. Use Cases and Operational Requirements . . . . . . . . . . . 11 2.1. Satellite Communication Networks . . . . . . . . . . . . 11 2.2. 5G/6G Core Network Ordering . . . . . . . . . . . . . . . 12 2.3. Financial Infrastructure Timestamping . . . . . . . . . . 12 2.4. AI Agent Networks . . . . . . . . . . . . . . . . . . . . 13 2.5. Operational Requirements Summary . . . . . . . . . . . . 13 3. Requirements Language . . . . . . . . . . . . . . . . . . . . 14 4. Problem Statement . . . . . . . . . . . . . . . . . . . . . . 14 4.1. Documented Temporal Ordering Failures . . . . . . . . . . 14 Jorgen Expires 1 January 2027 [Page 4] Internet-Draft TTTPS June 2026 4.2. SS7 Legacy Infrastructure as a Strategic Channel Controller Problem Instance . . . . . . . . . . . . . . . . . . . . 15 4.3. The Shannon Gap: SCCP . . . . . . . . . . . . . . . . . . 16 4.4. Existing Mitigations and Their Limitations . . . . . . . 16 5. Proof-of-Time Structure . . . . . . . . . . . . . . . . . . . 17 5.1. PoT Wire Format . . . . . . . . . . . . . . . . . . . . . 17 5.2. Field Definitions . . . . . . . . . . . . . . . . . . . . 18 5.3. Generation Algorithm . . . . . . . . . . . . . . . . . . 20 5.4. Verification . . . . . . . . . . . . . . . . . . . . . . 20 6. GRG Integrity Pipeline . . . . . . . . . . . . . . . . . . . 21 6.1. External Interface . . . . . . . . . . . . . . . . . . . 21 6.2. Context Binding . . . . . . . . . . . . . . . . . . . . . 22 6.3. Stage External Properties . . . . . . . . . . . . . . . . 22 6.4. Stage Ordering Rationale . . . . . . . . . . . . . . . . 23 6.5. Verification Sequence . . . . . . . . . . . . . . . . . . 23 7. AdaptiveSwitch . . . . . . . . . . . . . . . . . . . . . . . 24 7.1. State Machine . . . . . . . . . . . . . . . . . . . . . . 24 7.2. Transition Conditions and Hysteresis . . . . . . . . . . 24 7.3. Penalty and Exponential Backoff . . . . . . . . . . . . . 24 7.4. Equilibrium Analysis (V* Threshold) . . . . . . . . . . . 25 8. Transport Binding . . . . . . . . . . . . . . . . . . . . . . 25 8.1. TLS 1.3 via TLS Exporter Label . . . . . . . . . . . . . 25 8.2. QUIC Integration . . . . . . . . . . . . . . . . . . . . 26 8.3. HTTP/3 Frame Type . . . . . . . . . . . . . . . . . . . . 27 8.4. Handshake Flow Diagrams . . . . . . . . . . . . . . . . . 27 8.4.1. TLS 1.3 Flow . . . . . . . . . . . . . . . . . . . . 27 8.4.2. QUIC Flow . . . . . . . . . . . . . . . . . . . . . . 28 8.4.3. HTTP/3 Flow . . . . . . . . . . . . . . . . . . . . . 28 8.5. Backward Compatibility . . . . . . . . . . . . . . . . . 28 9. Tier Structure . . . . . . . . . . . . . . . . . . . . . . . 28 10. The Self-Extending Time Standard (Deep Space) . . . . . . . . 30 10.1. TCB Propagation Along the D-Chain . . . . . . . . . . . 30 10.2. Positioning Without GNSS . . . . . . . . . . . . . . . . 31 10.3. Byzantine Resilience and Self-Healing . . . . . . . . . 32 11. Security Considerations . . . . . . . . . . . . . . . . . . . 32 11.1. Compromised NTP Sources and Path Attacks . . . . . . . . 33 11.2. Replay Prevention . . . . . . . . . . . . . . . . . . . 33 11.3. Sybil Time Sources . . . . . . . . . . . . . . . . . . . 34 11.4. Side-Channel Considerations . . . . . . . . . . . . . . 34 11.5. Byzantine Economic Attacks . . . . . . . . . . . . . . . 34 11.6. Delay-Based Temporal Attacks . . . . . . . . . . . . . . 34 11.7. GRG Pipeline Security . . . . . . . . . . . . . . . . . 35 11.8. Path Manipulation Attack Scenarios . . . . . . . . . . . 36 11.8.1. Scenario A: SS7 Gateway Compromise and Traffic Rerouting . . . . . . . . . . . . . . . . . . . . . . 36 11.8.2. Scenario B: SS7 Location Tracking and Ordering Inference . . . . . . . . . . . . . . . . . . . . . . 37 Jorgen Expires 1 January 2027 [Page 5] Internet-Draft TTTPS June 2026 11.8.3. Scenario C: Man-in-the-Middle with Timestamp Forgery . . . . . . . . . . . . . . . . . . . . . . . 37 11.9. Trust Model and Key Compromise Resilience . . . . . . . 38 11.9.1. Trust Hierarchy . . . . . . . . . . . . . . . . . . 38 11.9.2. Issuer Key Compromise Response . . . . . . . . . . . 39 11.9.3. Untrusted Substrate Guarantee . . . . . . . . . . . 39 12. Privacy Considerations . . . . . . . . . . . . . . . . . . . 40 12.1. Unlinkability . . . . . . . . . . . . . . . . . . . . . 40 12.2. Minimal Disclosure . . . . . . . . . . . . . . . . . . . 40 13. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 41 13.1. TLS Exporter Labels Registry . . . . . . . . . . . . . . 41 13.2. ALPN Protocol ID Registration . . . . . . . . . . . . . 41 13.3. TTTPS Tier Registry . . . . . . . . . . . . . . . . . . 41 13.4. Time Source Type Registry . . . . . . . . . . . . . . . 42 13.5. HTTP/3 and QUIC Stream Types . . . . . . . . . . . . . . 42 13.6. URI Scheme Registration . . . . . . . . . . . . . . . . 42 13.7. PoT Extension Type . . . . . . . . . . . . . . . . . . . 43 14. Intellectual Property . . . . . . . . . . . . . . . . . . . . 43 15. Implementation Status . . . . . . . . . . . . . . . . . . . . 43 15.1. Reference Implementation . . . . . . . . . . . . . . . . 43 15.2. Deployment Evidence . . . . . . . . . . . . . . . . . . 44 15.3. Formal Verification Artifacts . . . . . . . . . . . . . 44 15.4. Interested Parties . . . . . . . . . . . . . . . . . . . 45 16. References . . . . . . . . . . . . . . . . . . . . . . . . . 45 16.1. Normative References . . . . . . . . . . . . . . . . . . 45 16.2. Informative References . . . . . . . . . . . . . . . . . 46 Appendix A. AdaptiveSwitch TLA+ Specification . . . . . . . . . 49 Appendix B. GRG Pipeline Specification (Placeholder) . . . . . . 52 Appendix C. Test Vectors . . . . . . . . . . . . . . . . . . . . 53 Appendix D. FILO+GRG Delay Rejection Flow . . . . . . . . . . . 53 Appendix E. Motivating Use Case: Regulated Therapeutic Design Pipeline . . . . . . . . . . . . . . . . . . . . . . . . 55 E.1. Setting . . . . . . . . . . . . . . . . . . . . . . . . . 55 E.2. Problem . . . . . . . . . . . . . . . . . . . . . . . . . 55 E.3. Pillar 1 -- Record Integrity (TTTPS, 21 CFR 11.10(e)) . . 56 E.4. Pillar 2 -- Computation Integrity (formal verification, 21 CFR 11.10(a)) . . . . . . . . . . . . . . . . . . . . . . 56 E.5. Summary . . . . . . . . . . . . . . . . . . . . . . . . . 56 Acknowledgements . . . . . . . . . . . . . . . . . . . . . . . . 56 Author's Address . . . . . . . . . . . . . . . . . . . . . . . . 56 1. Introduction Every major class of internet ordering attack -- BGP hijacking that disrupts routing priority, NTP amplification attacks that bias financial settlement windows, SS7 gateway compromise that enables silent path manipulation -- shares one root cause: the network layer cannot prove WHEN an event occurred. Jorgen Expires 1 January 2027 [Page 6] Internet-Draft TTTPS June 2026 TLS proves WHO sent a message. DNSSEC proves WHAT the content is. No standard protocol proves WHEN -- in a manner cryptographically verifiable by any party without trusting any single intermediary. This document closes that gap. The gap is not theoretical. SS7, the signaling protocol underlying most of the world's telephone and mobile infrastructure, was designed in 1975 with no sender authentication. An operator controlling an SS7 gateway can silently reroute traffic, inject false location updates, and modify inter-operator timestamps without detection at the application layer [SS7-VULN]. TTTPS is specifically designed to operate above such an untrusted substrate: its Proof-of-Time (PoT) is path-independent, meaning that no network-layer manipulation -- including SS7 gateway compromise -- can produce a valid PoT without access to the Issuer's Ed25519 private key. The urgency of this gap has increased along two independent dimensions. First, autonomous AI agents executing financial transactions at machine speed have eliminated the latency buffer that historically made human-scale ordering fraud detectable; the broader trajectory toward increasingly autonomous, self-improving agents [Zhang2026] sharpens this exposure. Second, 70,612 PoT records generated over six months of experimental deployment reveal that 55% originate from AI agents -- an unanticipated finding that confirms ordering manipulation is already an operational problem, not a future risk. TTTPS introduces Proof-of-Time (PoT): a multi-source synthesised timestamp protected by the GRG integrity pipeline, bound to a cryptographic context identifier, and verifiable at O(1) cost independent of network size. TTTPS does not require trust in any single time source, any network path, or any SS7 gateway. 1.1. Why This Protocol, Why Now Three converging developments make this the appropriate moment for standardisation: (a) Infrastructure exposure. Documented SS7 vulnerabilities [SS7-VULN] enable timestamp manipulation at the signaling layer without application-layer detection. No existing protocol -- NTS [RFC8915], PTP [IEEE1588], or Roughtime [I-D.ietf-ntp-roughtime] -- provides a path-independent temporal proof at the application layer. (b) Agent proliferation. As autonomous AI agents [Zhang2026] execute transactions at machine speed, the window for human detection of temporal manipulation collapses. Protocol-layer enforcement becomes necessary. Jorgen Expires 1 January 2027 [Page 7] Internet-Draft TTTPS June 2026 (c) Running code. A reference implementation [OPENTTT] is deployed and has generated 70,612 verified PoT records. The experimental data (Section 14.2) demonstrates both the technical viability and the demand for the protocol. 1.2. Objectives The objectives of TTTPS are as follows: * Temporal origin authentication: prove "when" a message originated, complementing TLS's proof of "who". * Byzantine time source elimination: transform detection probability from P(detect) < 1 (Shannon model) to P(detect) >= 1 - 2^{-61} via GRG context binding. * Delay attack prevention: enforce that PoT submissions outside the tier tolerance window are rejected pre-ingestion, as defined for delay attacks in [RFC8915] Section 8.6. * Economic eviction of dishonest nodes: via AdaptiveSwitch equilibrium threshold V*, below which ordering manipulation is self-defeating. * Transport-layer agnosticism: operate over TLS 1.3 [RFC8446], QUIC [RFC9000], and HTTP/3 [RFC9114] without modification to those protocols. * Backward compatibility: deployable alongside existing TLS 1.3 without requiring server-side changes. * Experimental deployment: accumulate implementation experience prior to consideration for the Standards Track. * Privacy-preserving temporal attestation: PoT binds to context without revealing transaction content or participant identity. Primary use cases include MEV-resistant decentralised exchange (DEX) transaction ordering, AI agent-to-agent payment sequencing, IoT mission-critical command ordering, and financial settlement timestamping. 1.3. Protocol Overview TTTPS operates in two phases: Phase 1 -- PoT Generation: Jorgen Expires 1 January 2027 [Page 8] Internet-Draft TTTPS June 2026 Client PoT Issuer | | |--- Time synthesis request ---------->| | | Query NIST, Google, | | Cloudflare NTP (k>=3) | | T=median(T_1..T_k) | | |<-- PoT record (signed) -------------| | [ts | ctx_id | nonce | | | grg_commitment | Ed25519_sig] | Phase 2 -- TLS Binding (TLS Exporter, RFC 5705): Client Server |--- TLS ClientHello -------------->| |<-- TLS ServerHello + ... ---------| |<-- TLS Finished -----------------| | | | Both derive PoT binding key: | | EXPORTER-tttps-pot-binding | | = TLS-Exporter(label, pot_bytes, | | 32 octets) | | | |--- 1-RTT[PoT frame] ------------>| |<-- 1-RTT[PoT-Ack] --------------| Byzantine nodes that submit manipulated ordering are identified with probability >= 1 - 2^{-61} and economically penalised via AdaptiveSwitch FULL mode. TTTPS does NOT modify the TLS handshake. No new TLS Extension Type is required. This approach follows RFC 8915 Section 5.1. 1.4. Scope This document specifies: * The PoT data structure and wire format (Section 5) * The GRG Integrity Pipeline abstract interface (Section 6) * The AdaptiveSwitch Byzantine eviction mechanism (Section 7) * The TTTPS transport binding (Section 8) This document does NOT specify: Jorgen Expires 1 January 2027 [Page 9] Internet-Draft TTTPS June 2026 * Concrete implementation of GRG pipeline cryptographic operations (covered by pending patent; see Section 13) * Specific NTP server selection policies * External audit-log or anchoring substrate implementations * Pricing or fee schedules (implementation-defined; Section 9) * Satellite deployment specifics (see Section 2.1) 1.5. Terminology The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" are interpreted as described in BCP 14 [RFC2119] [RFC8174]. SCCP (Strategic Channel Controller Problem): A system satisfies SCCP if (i) a controller C has authority over message ordering; (ii) U(C) is strictly monotone in that ordering; (iii) no external party can verify original ordering without C's cooperation. Instances include NTP timestamp bias, BGP hijacking, DNS poisoning, and transaction sequencer MEV. Proof-of-Time (PoT): A cryptographically authenticated record of a synthesised timestamp, bound to a context identifier via GRG context binding, and protected against replay and delay. GRG Pipeline: A four-stage integrity pipeline: G_1 (Golomb-Rice encoding), R (Reed-Solomon erasure coding), G_2 (Golay(23,12,7) forward error correction), H (HMAC-SHA256 context binding). The stage ordering is mathematically necessary (Section 6.4). Implementation is proprietary; only the abstract interface and external properties are specified here. AdaptiveSwitch: A state machine classifying nodes as TURBO (ordering- compliant, ~50 ms verification, 20% fee discount) or FULL (potentially Byzantine, ~127 ms, exponential backoff). Byzantine Time Attack: An adversarial action in which a network participant reports a fabricated or manipulated timestamp to gain ordering advantage. Jorgen Expires 1 January 2027 [Page 10] Internet-Draft TTTPS June 2026 V* (Equilibrium threshold): V* = c_0 + lambda * Delta_tau. For MEV opportunity value V < V*, ordering manipulation is eliminated in the unique symmetric Nash equilibrium. Empirically calibrated from 151,423 Timeboost auctions: V* in [$8.67, $87.13]. FILO+GRG: The processing discipline in which PoT submissions are subject to two sequential gates (HMAC context gate, then AdaptiveSwitch recency gate) before entering the processing queue; within the queue, the most recently generated qualifying PoT is processed first. PoT Issuer: An entity authorised to generate and sign PoT records. Analogous in function to a Certificate Authority, but attesting time rather than identity. Tier: An ordered set of time resolution levels (T0_epoch through T3_micro) controlling the tier tolerance window for PoT submission recency. See Section 9. 2. Use Cases and Operational Requirements This section describes deployment scenarios in which existing protocols (NTS, PTP, Roughtime) are insufficient and TTTPS provides the necessary path-independent temporal proof. 2.1. Satellite Communication Networks Satellite operators route traffic through ground station networks that frequently traverse SS7 signaling infrastructure at terrestrial interconnects. An operator controlling a gateway at such an interconnect can: * Introduce artificial delays in timestamp synchronisation messages without detection at the application layer. * Reroute uplink/downlink traffic to infer ordering information about competing satellite operators. GEO satellite round-trip times (~600 ms) fall within the T1_block tier tolerance (2,000 ms), making TTTPS directly applicable. T-s1 (Earth-Moon, 3,000 ms) extends coverage to lunar relay scenarios. Jorgen Expires 1 January 2027 [Page 11] Internet-Draft TTTPS June 2026 Operational requirement: temporal proof that is independent of the ground network path. TTTPS satisfies this because GRG_Commitment = GRG(P || D_chain, ctx_id), where D_chain is derived from k >= 3 independent Roughtime sources queried before path traversal. No ground-path manipulation after generation can alter a valid PoT. 2.2. 5G/6G Core Network Ordering 5G core networks (3GPP Release 17+) use Service Based Architecture (SBA) in which Network Functions (NFs) exchange ordering-sensitive messages over HTTP/2. Many 5G deployments retain SS7-based interworking for legacy roaming. The N9 interface (UPF-to-UPF) and N14 interface (AMF-to-AMF) carry ordering-sensitive session establishment messages. A compromised SS7 interworking function can inject ordering manipulation at the MAP layer without HTTP/2-layer detection. TTTPS provides a transport-layer-agnostic temporal proof (Section 8) that operates over HTTP/3 without modification to 3GPP interfaces. T3_micro tier (100 ms) is appropriate for latency-sensitive 5G ordering. Operational requirement: sub-100ms ordering proof that survives SS7 interworking path traversal. 2.3. Financial Infrastructure Timestamping MiFID II (EU) and CAT (US) require submillisecond-accurate timestamps for regulated financial transactions. GPS-based timing, the current industry standard, is vulnerable to spoofing attacks that can shift reported timestamps by seconds [GPS-SPOOF]. TTTPS provides a multi-source temporal proof that detects GPS spoofing: if the GPS-derived timestamp diverges from the Roughtime- derived median by more than stratum_tolerance, PoT generation ABORTS (Section 5.3, step 3). This transforms GPS spoofing from an undetectable manipulation into a verifiable abort condition. Operational requirement: regulatorily auditable timestamp that survives GPS spoofing and does not depend on any single time infrastructure provider. Jorgen Expires 1 January 2027 [Page 12] Internet-Draft TTTPS June 2026 2.4. AI Agent Networks Autonomous AI agents executing financial or coordination transactions at machine speed generate ordering-sensitive messages at rates that eliminate human-scale audit cycles. The experimental deployment (Section 14.2) found that 55% of all PoT records were generated by AI agents -- consistent with the broader trajectory toward autonomous agent operation [Zhang2026]. As agent reaction times converge toward network propagation delay, ordering advantage can no longer be earned through superior reaction time. The remaining mechanism for ordering advantage is timestamp manipulation -- precisely the attack class TTTPS addresses. Operational requirement: O(1) temporal verification that scales to agent transaction rates without BFT overhead. 2.5. Operational Requirements Summary The use cases above share four requirements that existing protocols do not jointly satisfy: R1. Path independence: temporal proof must be valid regardless of which network path (including SS7) the PoT traverses after generation. R2. Cross-domain verification: proof must be verifiable by parties without access to the generation environment. R3. Pre-ingestion enforcement: invalid ordering must be detectable before the record enters system state, not after (unlike Roughtime's audit-only model). R4. O(1) scalability: verification cost must be independent of network size and number of participants. Table R: Protocol Coverage of Operational Requirements. | R1 Path | R2 Cross | R3 Pre- | R4 O(1) | Indep. | Domain | Ingest. | Scale ------------|----------|----------|----------|-------- NTS [8915] | No | No | No | Yes PTP [1588] | No | No | No | Yes Roughtime | Partial | Partial | No | O(log n) TTTPS | Yes | Yes | Yes | Yes Jorgen Expires 1 January 2027 [Page 13] Internet-Draft TTTPS June 2026 Requirement R3, pre-ingestion enforcement, is unique to TTTPS: as the R3 column shows, NTS, PTP, and Roughtime all enforce ordering only after a record is admitted (session rejection or retrospective audit signal), whereas TTTPS rejects non-conforming ordering before the record enters system state. 3. Requirements Language The key words "MUST", "MUST NOT", etc. in this document are to be interpreted as described in BCP 14 [RFC2119] [RFC8174] when, and only when, they appear in all capitals. 4. Problem Statement 4.1. Documented Temporal Ordering Failures The following documented attack classes motivate TTTPS. Each represents a deployed instance of the Strategic Channel Controller Problem (SCCP, Section 1.5) in which an ordering authority has both capability and incentive to misrepresent temporal ordering. (a) SS7 timestamp manipulation. The SS7 MAP protocol, used for inter-operator roaming signaling, transmits location and timing information without sender authentication. A gateway operator can inject false MAP UpdateLocation messages to shift perceived timestamps by seconds without detection [SS7-VULN][GSMA-SS7]. This is not a theoretical risk: SS7 attacks have been demonstrated against live networks in multiple countries. (b) BGP route hijacking. An AS operator controlling routing can reroute traffic to create artificial ordering delays. The 2010 China Telecom BGP incident diverted US military traffic for 18 minutes. Application-layer timestamps recorded during such diversions cannot be verified. (c) NTP amplification and bias. An NTP server operator can bias returned timestamps by amounts below stratum-check thresholds, shifting financial settlement windows by sub-second amounts sufficient to capture MEV ($0.11-$1.13/ms, calibrated from 151,423 Timeboost auctions [Messias2025]). (d) GPS spoofing. Civilian GPS signals are unencrypted. Spoofing hardware costing under $500 can shift GPS-derived timestamps by seconds within a local area [GPS-SPOOF]. MiFID II-compliant systems relying solely on GPS timestamps are vulnerable. Jorgen Expires 1 January 2027 [Page 14] Internet-Draft TTTPS June 2026 The common thread: in each case, a single infrastructure operator can manipulate temporal ordering without producing any detectable artefact at the application layer. TTTPS closes this gap by requiring that temporal ordering be cryptographically provable independent of any single infrastructure operator. 4.2. SS7 Legacy Infrastructure as a Strategic Channel Controller Problem Instance SS7 (Signaling System 7), designed in 1975, is the signaling backbone of the global telephone network and underlies most mobile roaming. Its MAP, ISUP, and Signaling Connection Control Part sub-protocols were designed for a closed network of trusted operators. They contain no mechanisms for: * Sender authentication of signaling messages * Integrity protection of timestamp fields * Detection of message injection or replay * Path verification for routed messages These omissions create the following Strategic Channel Controller Problem instances (using Definition 1.1.4 from Section 1.5): Gateway timestamp injection: An SS7 gateway operator (controller C) can modify timestamp fields in MAP messages without the receiving party detecting the modification. The receiving party's utility U(C) depends on the ordering implied by those timestamps (Strategic Channel Controller Problem condition (ii) satisfied). No external party can verify the original timestamp without C's cooperation (condition (iii) satisfied). Silent traffic rerouting: An SS7 SCCP (Signaling Connection Control Part) layer operator can reroute message traffic to alternate paths, introducing artificial delays that bias temporal ordering without any application-layer signal. Location tracking enabling ordering inference: SS7 MAP UpdateLocation messages can be used to track the geographic location of network nodes. An attacker with this information can infer network topology and exploit propagation- delay asymmetry for ordering advantage. Jorgen Expires 1 January 2027 [Page 15] Internet-Draft TTTPS June 2026 TTTPS defense: The GRG_Commitment is generated from multi-source Roughtime data BEFORE path traversal. No SS7 gateway manipulation after generation can alter a committed PoT without access to the Issuer's Ed25519 private key. TTTPS assumes no trust in any network layer below TLS. This constitutes what we term "untrusted substrate operation": TTTPS provides temporal ordering guarantees even when the underlying network infrastructure (including SS7 gateways) is controlled by an adversary. 4.3. The Shannon Gap: SCCP Shannon (1948) modelled a channel as Y = X + N_rand, where noise N is random and the channel operator is passive. All subsequent coding theory, information theory, and cryptographic channel models assume NOT-SCCP. This assumption is structurally violated by modern internet infrastructure. Table 1 maps documented attack classes to SCCP Definition 1.1.4 (Section 1.5). Table 1: SCCP instances in deployed infrastructure. Domain | SCCP mechanism | lambda --------------|-------------------------------|------------------ NTP server | Timestamp bias shifts | Low | settlement windows | BGP router | Traffic rerouting disrupts | Medium | ordering | DNS resolver | Forged response wins | Low | temporal race | SS7/MAP | Gateway compromise enables | High gateway | silent timestamp injection | (infra-level) | without application detection | Tx sequencer | Reordering extracts MEV | $0.11--1.13/ms AI agent | Agent ordering captures | High (scaling) coordinator | surplus | Shannon's noise model has no mechanism for strategic N. PoT changes this: Byzantine manipulation becomes cryptographically self- identifying and economically self-penalising. 4.4. Existing Mitigations and Their Limitations Table 2: Comparison with existing temporal protocols. Jorgen Expires 1 January 2027 [Page 16] Internet-Draft TTTPS June 2026 | Roughtime | NTS/PTP | PoT --------------|-----------|-----------|------------------ Timing | Retro. | Session | Pre-ingestion Enforcement | Signal | Reject | Economic penalty Cross-domain | No | No | Yes SCCP | No | No | Yes Complexity | O(log n) | O(1) | O(1) per record BFT overhead | N/A | N/A | O(1) vs O(n^2) Classical BFT protocols (PBFT [Castro1999], Tendermint) tolerate f < n/3 Byzantine nodes with O(n^2) message complexity; even O(n)- optimised BFT (HotStuff) requires coordination linear in the number of participants. PoT ELIMINATES Byzantine ordering manipulation at O(1) per record: the manipulation is not outvoted but cryptographically identified and economically penalised. As network size grows from n to 10n, classical BFT message overhead grows up to 100x; PoT overhead is unchanged. The urgency of this gap has increased as AI systems acquire autonomous capability to identify and exploit protocol-layer vulnerabilities without human direction [GLASSWING]. The same agentic capabilities that enable autonomous security research equally enable autonomous temporal attack on ordering-sensitive networks. TTTPS provides a pre-ingestion cryptographic defense that is independent of network size and agent count. 5. Proof-of-Time Structure 5.1. PoT Wire Format A PoT record is encoded as a fixed-structure binary sequence. All multi-byte integer fields are in network byte order (big-endian). Jorgen Expires 1 January 2027 [Page 17] Internet-Draft TTTPS June 2026 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Version (4) | Tier (4) | Source Cnt | Reserved | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | | + Timestamp (64 bits) + | nanoseconds since epoch | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Confidence (32 bits) | | parts-per-million | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | | + + | Nonce (256 bits) | + cryptographically random + | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | | + + | GRG Commitment (256 bits) | + output of GRG pipeline + | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | | + + | Ed25519 Signature (512 bits) | + over all preceding fields + | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Total: 3 + 8 + 4 + 32 + 32 + 64 = 143 bytes. (Version[1B] + SourceCnt[1B] + Reserved[1B] = 3 bytes for the header row; all remaining fields as shown.) 5.2. Field Definitions Version (4 bits): Protocol version. This document defines version 1 (0x1). Implementations MUST reject PoT records with unknown versions. Tier (4 bits): Identifies the time resolution level (Section 9). Values: 0x0 = T0_epoch, 0x1 = T1_block, 0x2 = T2_slot, 0x3 = T3_micro, 0x4 = T-s1_dspace (deep-space, propagation-delay adaptive tolerance). Values 0x5-0xF are reserved. Jorgen Expires 1 January 2027 [Page 18] Internet-Draft TTTPS June 2026 Source Count (8 bits): Number of independent NTP sources consulted. MUST be >= 3. Implementations SHOULD use >= 4. Reserved (8 bits): MUST be set to 0x00 by senders. Receivers MUST ignore this field. Timestamp (64 bits): Synthesised timestamp: T_synth = median(T_1, ..., T_k), k >= 3 sources from independent domains. Nanoseconds since Unix epoch. Synthesis MUST use at least three independent sources from distinct administrative domains (e.g., NIST, Google, Cloudflare). Confidence (32 bits): Synthesis quality metric in parts-per-million. Computed from inter-source agreement. Values above 1,000,000 ppm MUST NOT be issued. Nonce (256 bits): Cryptographically random value. MUST be generated with a cryptographically secure random number generator. Provides replay prevention in conjunction with Section 10.2. GRG Commitment (256 bits): Output of the GRG Integrity Pipeline (Section 6) applied to the preceding fields. The commitment cryptographically binds the PoT payload to its context (ctx_id, an opaque application-assigned context identifier). Ed25519 Signature (512 bits): Signature over all preceding fields using the PoT Issuer's Ed25519 private key [Bernstein2012], following EUF-CMA security. The signature seals the GRG Commitment (double seal property, Section 5.2). Issuer Integrity Property: The Issuer cannot forge a timestamp without detection. A forged timestamp T' != T produces a different payload P', which produces a different GRG_Commitment' != GRG_Commitment. The Ed25519 signature over (P || GRG_Commitment) then fails verification against the published Issuer public key. This is a mathematical consequence of EUF-CMA security, not a procedural control. The remaining trust assumption is that the Issuer's private key is not compromised. This is the same trust model as PKI (Certificate Authority), applied to time rather than identity. Issuer misbehaviour is auditable via an append-only commitment log of published PoT records. Jorgen Expires 1 January 2027 [Page 19] Internet-Draft TTTPS June 2026 5.3. Generation Algorithm 1. Query k >= 3 NTP sources from independent domains. 2. Compute T_synth = median(T_1, ..., T_k). 3. If max|T_i - T_synth| > stratum_tolerance: ABORT. 4. Generate 256-bit cryptographically random Nonce. 5. Assemble payload P = [Version | Tier | Source_Cnt | Reserved | Timestamp | Confidence | Nonce]. 6. Compute D_chain = SHA-256(k Roughtime attestations) (Section 5.4). 7. Compute GRG_Commitment = GRG(P || D_chain, ctx_id) (Section 6). 8. Compute Sig = Ed25519.Sign(sk, P || GRG_Commitment). 9. Output PoT = P || GRG_Commitment || Sig. 5.4. Verification Implementations MUST verify PoT records in the following order: 0. Future-timestamp rejection (defense-in-depth): If timestamp > submission_time: REJECT. Rationale: Ed25519 EUF-CMA prevents forged future PoTs at the cryptographic level, but this explicit check provides defense-in-depth against implementation errors. 1. Version check: reject unknown versions. 1a. TLS binding verification (normative): If PoT frame includes binding_key (Section 8.1): expected_key = TLS-Exporter( "EXPORTER-tttps-pot-binding", pot_without_sig, 32) If expected_key != binding_key_in_frame: REJECT. Prevents cross-session replay (Section 10.8.1). 1b. Roughtime chain integrity (normative): D_chain = SHA-256(k Roughtime attestations) GRG_Commitment = GRG(P || D_chain, ctx_id) Jorgen Expires 1 January 2027 [Page 20] Internet-Draft TTTPS June 2026 Theorem 0 (Inflow-to-Proof): forged timestamp T' != T produces GRG_Commitment' != GRG_Commitment. Issuer timestamp manipulation is mathematically detectable. 2. HMAC context gate (~6 microseconds): Recompute HMAC(k, shard_i) for all shards. If any HMAC fails: REJECT immediately. DO NOT proceed to Ed25519 verification. NOTE: HMAC-first order yields 16x cost reduction on invalid submissions. 3. Ed25519 signature verification (~100 microseconds): Verify Sig over the full PoT record. Ed25519 is called once per TLS session establishment, not per packet. Per-packet payload protection is provided by the underlying TLS 1.3 or QUIC AEAD record layer [RFC8446]. 4. Recency check (AdaptiveSwitch gate, Section 7): If submission_time - timestamp > tier_tolerance: REJECT. Trigger FULL mode per Section 7.3. 5. Nonce freshness: reject duplicate nonces. NOTE: The HMAC-first verification order (step 2 before step 3) achieves 16x cost reduction on invalid submissions. Invalid context binding -- which includes delayed resubmissions of valid PoTs in a different execution context -- is detected at the HMAC layer without incurring Ed25519 overhead. 6. GRG Integrity Pipeline 6.1. External Interface The GRG pipeline accepts a payload P and a context identifier ctx_id, and produces a 256-bit commitment: GRG_Commitment = GRG(P, ctx_id) The interface signature is written GRG(P, ctx_id). The payload P carries the Roughtime chain digest D_chain bound at generation; Sections 2.1, 5.3, and 5.4 write this binding explicitly as GRG(P || D_chain, ctx_id). The two forms denote the same commitment, since D_chain is part of the payload presented to the pipeline. Implementations of the GRG interface MUST satisfy: * Lossless round-trip: GRG_Inverse(GRG(P)) = P * Erasure tolerance: any k of n shards reconstruct P (where k and n are implementation-defined, minimum k=4, n=6) Jorgen Expires 1 January 2027 [Page 21] Internet-Draft TTTPS June 2026 * Bit-error correction: up to t=3 bit errors per 23-bit block are corrected * Context binding: GRG(P, ctx_id_A) != GRG(P, ctx_id_B) for ctx_id_A != ctx_id_B, with probability >= 1 - 2^{-61} Full pipeline specification is in Appendix B. Reference implementation: [OPENTTT]. 6.2. Context Binding The HMAC context key is derived as: k = SHA-256(ctx_id) NOTE: This key is publicly derivable by design. Purpose: domain separation (context binding), NOT secrecy. Security model: Confidentiality/Authenticity = Ed25519 private key (Issuer) Context binding = HMAC key (public, deterministic) Attack prevented: A PoT shard from pool A cannot be replayed into pool B even if an attacker knows both HMAC keys, because the Ed25519 signature over grg_commitment makes cross-context replay detectable at signature verification. This follows the domain-separation pattern of TLS 1.3 key schedule [RFC8446] Section 7.1, where labels are public constants providing domain separation without secrecy. 6.3. Stage External Properties Stage G_1 (Golomb-Rice): Achieves Shannon source coding bound for geometric distributions. PoT integer fields (timestamp delta, stratum, confidence) are geometrically distributed by construction (Poisson inter-arrival times, discretised). Output is byte-aligned. Complexity: O(n). Stage R (Reed-Solomon(4,6) over GF(2^8)): Achieves the Singleton bound as a Maximum Distance Separable (MDS) code. Any 4 of 6 shards reconstruct the original payload. Fixed- size equal shards output. Polynomial: x^8 + x^4 + x^3 + x^2 + 1. Jorgen Expires 1 January 2027 [Page 22] Internet-Draft TTTPS June 2026 Stage G_2 (Golay(23,12,7)): Achieves the Hamming bound exactly as a perfect code: sum_{i=0}^{3} C(23,i) = 2048 = 2^{11}. The unique non-trivial binary perfect code with t >= 2 correction (Tietavainen 1973). Corrects up to 3 bit errors per 23-bit block. Requires fixed-size input. Stage H (HMAC-SHA256, 8-byte tag): P(forge) <= 6 * 2^{-64} (union bound over 6 shards). Public key by design (context separation, not secrecy). Ed25519 seals GRG_Commitment: forging HMAC invalidates Ed25519 (double seal property). 6.4. Stage Ordering Rationale The ordering G_1 -> R -> G_2 -> H is mathematically necessary. Any permutation degrades one or more provably tight properties: G_1 before R (Theorem 1 of companion paper [POT2026]): G_1 output is byte-aligned, providing GF(2^8)-optimal symbol boundaries for Reed- Solomon. Applying R before G_1 yields strictly greater RS parity overhead. R before G_2 (Theorem 2 of companion paper): Golay(23,12,7) requires fixed 23-bit input blocks. G_1 output is variable-length. R produces fixed-size equal shards, enabling zero-waste Golay encoding. RS and Golay provide orthogonal protection: P(fail) = P(RS) * P(Golay) < P(RS) + P(Golay). G_2 before H (follows from Theorem 2): HMAC seals the post-Golay shards. Ed25519 wraps grg_commitment (double seal). These codes were selected for the same reason as deep-space missions: provably tight properties when retransmission is impossible. Golomb- Rice: JPL deep-space compression. Reed-Solomon: Cassini, Mars rovers. Golay(23,12,7) is the perfect-code core of the (24,12,8) extended Golay used for the Voyager 1 and 2 Saturn images transmitted across 10^9 km (1980-1981). 6.5. Verification Sequence See Section 5.4. HMAC verification MUST precede Ed25519. This provides early rejection of context-invalid submissions at ~6 microseconds vs ~100 microseconds for Ed25519. Jorgen Expires 1 January 2027 [Page 23] Internet-Draft TTTPS June 2026 7. AdaptiveSwitch 7.1. State Machine AdaptiveSwitch maintains per-node state in {TURBO, FULL}. +-------------------+ +----| TURBO |<---+ | | ~50 ms | | | | -20% fee | | match_rate >= 0.85 | | GRG overhead: | | (sustained) | | ~0.3 ms/record | | | +-------------------+ | | | | | match_rate < 0.85 match_rate >= 0.95 | OR GRG fail over 20 blocks | | | | +-------------------+ | +--->| FULL |----+ | ~127 ms | | standard fee | | backoff applied | +-------------------+ 7.2. Transition Conditions and Hysteresis TURBO entry: match_rate >= 0.95 sustained over >= 20 blocks. All PoT submissions within tier_tolerance. No GRG pipeline failures. TURBO maintenance: match_rate >= 0.85 (relaxed threshold prevents flapping). TURBO -> FULL: match_rate < 0.85 over any 20-block window, OR any GRG pipeline failure, OR any submission outside tier_tolerance (delay attack). The hysteresis asymmetry is deliberate: trust is earned slowly and lost quickly (hard to earn, easy to lose). 7.3. Penalty and Exponential Backoff On integrity failure in TURBO mode: Backoff penalty = 20 * 2^{f-1} blocks, maximum 320 blocks. (f = consecutive failure count) On submission outside tier_tolerance: Immediate FULL mode transition. Backoff applies to TURBO re-entry. Jorgen Expires 1 January 2027 [Page 24] Internet-Draft TTTPS June 2026 7.4. Equilibrium Analysis (V* Threshold) Let lambda = operator opportunity cost per millisecond. Let c_0 = baseline ordering cost. Let Delta_tau = 77 ms (TURBO vs FULL latency difference). V* = c_0 + lambda * Delta_tau For V < V*: ordering spam eliminated (E[S] = 0) in the unique symmetric Nash equilibrium. For V >= V*: spam reduced by c_PoT / c_0 factor. Empirical calibration from 151,423 Timeboost auctions (Arbitrum, April-July 2025): Phase | lambda ($/ms) | V* | Result ----------------|---------------|----------|------------------ Stable (May+) | 0.11 - 0.23 | $8.67 | Spam eliminated Central est. | 0.16 | $12.82 | Spam eliminated Competitive | 1.13 | $87.13 | Spam eliminated ETH L1 sandwich | -- | ($131) | Spam reduced The Ethereum L1 average sandwich MEV ($131) lies above V*_max, consistent with "reduced but not eliminated" for highest-value attacks. For V < $8.67, PoT eliminates ordering manipulation entirely. 8. Transport Binding 8.1. TLS 1.3 via TLS Exporter Label TTTPS uses the TLS Exporter mechanism [RFC5705] to derive PoT binding material from an established TLS 1.3 session, following the model of [RFC8915] Section 5.1. This approach requires NO new TLS Extension Type codepoint and is fully backward-compatible with existing TLS 1.3 implementations. It resolves the codepoint collision risk of draft-helmprotocol-tttps-00 (0xFF50, Private Use range). Exporter parameters: Label: "EXPORTER-tttps-pot-binding" Context: PoT record bytes (all fields except Sig) Length: 32 octets Usage: Jorgen Expires 1 January 2027 [Page 25] Internet-Draft TTTPS June 2026 binding_key = TLS-Exporter("EXPORTER-tttps-pot-binding", pot_record_without_sig, 32) The binding_key MUST be used to verify that the PoT was generated within the current TLS session context. This prevents cross-session replay. Verification procedure (normative): The verifier MUST execute the following after TLS handshake completion and upon receiving a PoT frame: expected_key = TLS-Exporter( "EXPORTER-tttps-pot-binding", pot_record_without_sig, 32) If expected_key != binding_key_in_PoT_frame: REJECT. The binding_key is carried in the first 32 octets of the PoT frame body, preceding the PoT record. Both client and server independently derive the same expected_key from the shared TLS session master secret. A PoT frame generated in session A cannot be replayed into session B because the TLS-Exporter output is session-specific (derived from the session's master secret per RFC 5705 Section 4). PoT Frame Extended Format (with binding): binding_key (32 octets) -- TLS Exporter output pot_record (143 octets) -- PoT record (Section 5.1) Total: 175 octets 8.2. QUIC Integration TTTPS operates over QUIC [RFC9000] post-handshake. The TLS Exporter is available after QUIC handshake completion. QUIC + TTTPS flow: Jorgen Expires 1 January 2027 [Page 26] Internet-Draft TTTPS June 2026 Client Server |--Initial[CRYPTO]-------------->| (TLS ClientHello) |<-Initial[CRYPTO]--------------| (TLS ServerHello) |<-Handshake[CRYPTO]------------| (TLS EncryptedExtensions) |--Handshake[CRYPTO]----------->| (TLS Finished) | | | Both derive binding key: | | TLS-Exporter("EXPORTER- | | tttps-pot-binding", ...) | | | |--1-RTT[STREAM:PoT frame]----->| |<-1-RTT[STREAM:PoT-Ack]--------| PoT frames MUST be sent in a dedicated QUIC stream. Stream type: 0x74 (defined in Section 12.4). 8.3. HTTP/3 Frame Type Over HTTP/3 [RFC9114], PoT records are conveyed in a dedicated HTTP/3 frame type. HTTP/3 PoT Frame format: Frame Type: 0x4C4F5400 (ASCII "LOT\0", IANA assigned, see Section 12.4) Frame Length: variable (175 bytes with binding_key, 143 bytes for binding-free deployments) Frame Body: PoT record (Section 5.1) PoT frames MAY appear in any HTTP/3 request or response stream. Servers MUST NOT reject requests solely on the basis of absent PoT frames (backward compatibility). 8.4. Handshake Flow Diagrams 8.4.1. TLS 1.3 Flow Jorgen Expires 1 January 2027 [Page 27] Internet-Draft TTTPS June 2026 Client Server |--ClientHello------------------>| |<-ServerHello-------------------| |<-EncryptedExtensions-----------| |<-Certificate ------------------| |<-CertificateVerify-------------| |<-Finished----------------------| |--[Certificate]---------------->| (optional) |--[CertificateVerify]---------->| (optional) |--Finished--------------------->| | | | TTTPS binding after Finished:| |--Application[PoT frame]------->| |<-Application[PoT-Ack]---------| 8.4.2. QUIC Flow See Section 8.2. 8.4.3. HTTP/3 Flow Client Server |--HEADERS[GET /resource]------->| |--PoT Frame-------------------->| |<-HEADERS[200 OK]---------------| |<-DATA[resource]----------------| |<-PoT-Ack Frame-----------------| 8.5. Backward Compatibility Servers that do not implement TTTPS MUST be able to process TLS 1.3, QUIC, and HTTP/3 connections that include TTTPS binding material. TTTPS MUST NOT modify the TLS handshake in a way that causes negotiation failure with non-TTTPS peers. Implementations SHOULD use ALPN [RFC7301] extension identifier "tttps/1" (IANA registration, Section 12) to negotiate TTTPS capability between peers. 9. Tier Structure TTTPS defines five time resolution tiers: Jorgen Expires 1 January 2027 [Page 28] Internet-Draft TTTPS June 2026 Tier | ID | Interval | Tolerance | Use Case ------------|------|-----------|------------|------------------ T0_epoch | 0x0 | 6.4 min | 60 s | Epoch ordering T1_block | 0x1 | 2 sec | 2 s | Fast settlement T2_slot | 0x2 | 12 sec | 12 s | Slot ordering T3_micro | 0x3 | 100 ms | 100 ms | High-frequency T-s1_dspace | 0x4 | adaptive | adaptive | Deep-space | | | (>= 3 s) | (Earth-Moon class) Tier tolerance defines the maximum acceptable submission delay (submission_time - timestamp). Submissions outside tolerance trigger FULL mode per Section 7.3. The T-s1_dspace tier (deep-space, ID 0x4) extends TTTPS to Space-Air- Ground Integrated Network (SAGIN) and deep-space relay deployments where one-way light-time is no longer negligible relative to the tolerance window. Unlike the terrestrial tiers, whose tolerance is a fixed constant, the T-s1_dspace tolerance is propagation-delay adaptive: it is configured per link as tier_tolerance = T_base + 2 * d_owlt where d_owlt is the measured or ephemeris-derived one-way light-time to the peer and T_base is a fixed processing margin (reference implementation: T_base = 3,000 ms). The factor of two accounts for the round-trip path. For the Earth-Moon class link the one-way light-time is approximately 1.28 s (mean Earth-Moon distance 384,400 km / c), giving a round-trip contribution of about 2.56 s and a representative tolerance near 3,000 ms; this is the reference anchor for the T-s1_dspace tier. For deeper targets the same formula yields proportionally larger windows driven purely by light-speed physics: an Earth-Mars relay (Earth-Mars distance varying from about 54.6 to 401 million km) has a one-way light-time ranging from roughly 3 minutes to 22 minutes, so its adaptive tolerance ranges from minutes to tens of minutes (round-trip on the order of 6 to 44 minutes). These values are physical lower bounds set by the speed of light, not protocol-tunable parameters; deployments MUST set d_owlt from the actual link geometry rather than assume a terrestrial constant. The wire encoding is unchanged: T-s1_dspace reuses the 4-bit Tier field (value 0x4) and the existing PoT record format (Section 5). Fee discounts in TURBO mode are implementation-defined. Reference implementation: 20% discount [OPENTTT]. Jorgen Expires 1 January 2027 [Page 29] Internet-Draft TTTPS June 2026 10. The Self-Extending Time Standard (Deep Space) The terrestrial tiers anchor every Proof-of-Time to a root reachable within a fixed tolerance window. Deep space breaks that assumption: once one-way light-time grows from milliseconds to minutes to hours, no single root can serve the whole network. The T-s1_dspace tier therefore does not extend the reach of one root -- it lets the time standard extend itself. Each JPL-registered node (a tracked object with a NAIF body identifier) becomes a stratum-0 issuer of Barycentric Coordinate Time (TCB) and propagates it to its neighbours along the D-chain. The standard grows hop by hop, with no central authority, as far as one chain of live links reaches. THE TIME STANDARD THAT EXTENDS ITSELF (one D-chain, no central authority) STAGE ANCHOR / RELAY ONE-WAY LIGHT-TIME ----- -------------- ------------------ (1) 6G SAGIN gnb / LEO / HAPS microseconds - ms | terrestrial root v (2) Cislunar luna:gateway-L2 ~1.28 s (Earth-Moon) | Moon relay v (3) Solar Sys mars-relay:DSN-14 ~3-22 min (Earth-Mars) | JPL stratum-0 node v (4) Beyond probe:voyager-N hours and up interstellar mesh each hop propagates TCB to its neighbour B from anchor A: t_B = t_A + (tau_B - tau_A) * (1 + Phi_rel/c^2 + v_rel^2 / 2c^2) The four stages are not separate protocols. They are the same PoT record (Section 5) and the same opaque ctx_id, carried across widening light-time by a single mechanism. Stage (1) is the terrestrial and near-Earth SAGIN deployment already covered by the lower tiers. Stages (2)-(4) reuse the propagation-delay-adaptive tolerance of Section tier-structure (tier_tolerance = T_base + 2 * d_owlt) and add the TCB propagation, positioning, and resilience mechanisms described below. 10.1. TCB Propagation Along the D-Chain A node converts its local proper time tau to TCB by the standard first-order relativistic relation TCB = tau * (1 + Phi/c^2 + v^2 / 2c^2) Jorgen Expires 1 January 2027 [Page 30] Internet-Draft TTTPS June 2026 where Phi = -sum_i GM_i / r_i is the (negative) Newtonian gravitational potential at the node and v its velocity in the chosen inertial frame. Near 1 AU the dominant solar term Phi/c^2 is of order -1e-8; the velocity term is of the same magnitude for orbital speeds. At picosecond ambition these terms are not negligible and MUST be carried explicitly. Absolute Phi and absolute v are hard to establish far from Earth. The protocol therefore propagates TCB between two neighbouring nodes A and B in _relative_ quantities, which are directly observable on the link itself: t_B = t_A + (tau_B - tau_A) * (1 + Phi_rel/c^2 + v_rel^2 / 2c^2) A is the nearest JPL-verified node on the D-chain. The relative velocity v_rel is obtained from the range-rate d(rho)/dt between A and B -- the time derivative of the measured round-trip range -- rather than from any absolute-velocity solution. Range-rate is a first-class observable of the peer exchange (Section deep-space- resilience): two successive round-trip-time measurements yield d(rho)/dt directly, and an optional Doppler shift on the carrier provides an independent cross-check. Because the relativistic correction in the propagation equation depends only on the relative geometry (Phi_rel, v_rel), a node never needs an inertial-frame velocity fix to issue a correct TCB to its neighbour. The error of each hop is bounded by how well that single short link is characterised, not by knowledge of the whole frame. 10.2. Positioning Without GNSS Both the gravitational and the light-time terms need position, and GNSS is unavailable beyond cislunar space. A node establishes position from the following sources, in order of preference; the source actually used is recorded in the out-of-band context so a verifier can weigh it: 1. GNSS, where the node is still within service volume. 2. X-ray pulsar navigation (XNAV): a least-squares fix from the pulse times-of-arrival of catalogued millisecond pulsars. Their long-term rotational stability rivals atomic frequency standards and their near-uniform distribution over the sky forms a naturally deployed, galaxy-wide clock ensemble -- a celestial GNSS that needs no infrastructure. Only the X-ray photon detector itself is external hardware; the navigation solution is computed on-node. Jorgen Expires 1 January 2027 [Page 31] Internet-Draft TTTPS June 2026 3. Neighbour ranging: multilateration from light-time / RTT to neighbours of known position. This is a second, independent positioning source that does not depend on the pulsar catalogue. 4. Analytic ephemeris, as a deterministic fallback. The wire encoding is unchanged throughout: positioning and TCB propagation operate in the verify path and the out-of-band context. They never enlarge the 143-byte PoT record (Section 5). 10.3. Byzantine Resilience and Self-Healing A deep-space node does not trust any single neighbour. It queries k peers, each over an authenticated exchange with a fresh nonce, and takes the Byzantine median of their propagated TCB estimates. With a majority of honest peers (f < N/2 faulty), the median is robust to the minority, and with N propagating nodes the statistical TCB error falls as 1/sqrt(N) -- so a dense mesh trades node count for precision and approaches sub-picosecond agreement as N grows large. A neighbour-connected topology is what makes this hold in practice: deep-space relays broadcast to nearby, well-characterised neighbours over short hops rather than one long jump. Each hop's Phi_rel and v_rel are small and accurately known, so per-hop error is small and accumulation stays bounded. The chain is self-healing: as long as one path of live links remains between a node and a JPL-verified anchor, time continuity holds; a severed link reroutes through the mesh without a central coordinator. The peer set feeding this median is not fixed. A node MAY weight candidate neighbours by a routing-evidence health signal -- an implementation-defined score reflecting a neighbour's serving capacity, recent trend, and link quality -- so that the median is drawn preferentially from healthy, well-connected peers and migrates away from failing ones. The same health signal an operator uses to select a serving node for ordinary data routing then also selects which neighbours anchor the time median: time propagation and health- aware routing become a single self-routing mechanism, and the mesh re-anchors automatically as nodes age, overheat, throttle, or drop out. The internal construction of this score is out of scope for this document. 11. Security Considerations Jorgen Expires 1 January 2027 [Page 32] Internet-Draft TTTPS June 2026 11.1. Compromised NTP Sources and Path Attacks This section addresses two threat models: compromised NTP servers and compromised network paths between the PoT Issuer and NTP servers (the standard IETF network adversary model). Compromised NTP server: A single compromised NTP source biases the synthesised timestamp by at most 1/k of the manipulation, where k >= 3 is the source count. For k=4 independent sources, single-source bias impact <= 0.25 of manipulation magnitude. Compromised network path (IETF adversary model): An attacker controlling the network path between the Issuer and one NTP server can inject delayed or replayed NTP responses. Two mitigations apply: (a) Multi-source median: T_synth = median(T_1, ..., T_k) across k >= 3 sources from distinct administrative domains. A path-level attacker must simultaneously compromise paths to a majority of sources (e.g., both NIST and Cloudflare paths) to bias the median. (b) Stratum tolerance check (Section 5.3, step 3): If max|T_i - T_synth| > stratum_tolerance, generation ABORTS. A single-path delay injection that pushes one source beyond tolerance is detected and rejected. NTS [RFC8915] on the path between Issuer and NTP servers provides an additional layer of path authentication. Implementations SHOULD use NTS-authenticated sources where available. Implementations MUST use sources from distinct administrative domains (e.g., NIST, Google, Cloudflare) to maximise independence. Sources from a single autonomous system MUST NOT be counted as independent. 11.2. Replay Prevention Each PoT record includes a 256-bit cryptographically random Nonce (Section 5.2). Verifiers MUST maintain a nonce cache for the duration of the tier tolerance window. Duplicate nonces MUST be rejected. The Ed25519 signature seals the nonce. Cross-session replay is additionally prevented by the TLS Exporter binding (Section 7.1). Jorgen Expires 1 January 2027 [Page 33] Internet-Draft TTTPS June 2026 11.3. Sybil Time Sources An attacker controlling multiple NTP sources may attempt a Sybil attack on the synthesis median. The median is resistant to Sybil attacks when fewer than k/2 sources are compromised, for k >= 3. Implementations using k=4 are resistant to any single-source compromise. 11.4. Side-Channel Considerations The HMAC verification (~6 microseconds) and Ed25519 verification (~100 microseconds) MUST be implemented in constant time. Variable- time implementations risk timing side-channel attacks against the HMAC key. The Nonce MUST be generated with a constant-time CSPRNG. 11.5. Byzantine Economic Attacks An attacker may attempt to manipulate ordering for economic gain (MEV). The AdaptiveSwitch V* threshold (Section 7.4) ensures that for V < V*_min = $8.67, ordering spam is eliminated in the unique Nash equilibrium. Attackers with V >= V*_max = $87.13 may find manipulation economically rational at the margin. PoT reduces expected spam for such cases by a factor of c_PoT / c_0 (Section 7.4). 11.6. Delay-Based Temporal Attacks [RFC8915] Section 8.6 identifies delay attacks as a primary threat to time synchronisation security, noting that an adversary who delays NTP packets can cause a client to accept a stale timestamp as current. TTTPS addresses this threat through two complementary gates, applied in sequence at verification time (Section 5.4): (1) HMAC context gate (Section 6.2, ~6 microseconds): A PoT generated at time T with context ctx_id cannot be presented in a different execution context ctx_id' without HMAC verification failing. Context includes an opaque application context identifier (ctx_id). An attacker cannot reuse a valid PoT from a previous context window. This is analogous to the cookie freshness mechanism of [RFC8915] Section 5.4, which binds cookies to TLS session keys that expire with the session. Jorgen Expires 1 January 2027 [Page 34] Internet-Draft TTTPS June 2026 (2) AdaptiveSwitch recency gate (Section 7.3): A PoT submitted at time S where (S - T) > tier_tolerance is treated as a conformance failure. FULL mode is triggered immediately. The submission is rejected regardless of cryptographic validity. This reflects the operational observation, consistent with [RFC8915] Section 8.6, that in correctly functioning networks legitimate submissions arrive within tier tolerance bounds. Submissions outside this window correlate with Byzantine behaviour. FILO+GRG processing discipline: Among PoT records that pass both gates, the most recently generated qualifying submission is processed first. This creates an adverse incentive structure for delay attackers: a delayed-but-valid PoT that bypasses the HMAC gate is rejected at the recency gate; a PoT that passes both gates competes at a recency disadvantage against honest peers. Together, these mechanisms render delay-based attacks economically irrational: * A delayed PoT fails the recency gate -> FULL mode * Repeated FULL mode triggers exponential backoff * Backoff cost exceeds MEV opportunity for V < V* FILO+GRG flow: Message arrives | v [GATE 1: HMAC context binding ~6us] |-- FAIL (wrong ctx or expired) --> REJECT immediately |-- PASS v [GATE 2: AdaptiveSwitch recency check] |-- FAIL (submission > tier_tolerance) --> FULL mode |-- PASS v [Enter FILO processing queue] | v Most recently generated qualifying PoT processed first 11.7. GRG Pipeline Security Byzantine context binding provides: P(detect Byzantine manipulation) >= 1 - 2^{-61} Jorgen Expires 1 January 2027 [Page 35] Internet-Draft TTTPS June 2026 This follows from: P(forge_i) = 2^{-64} per shard (PRF security of HMAC [Bellare1996]); union bound over 6 shards: P(forge all) <= 6 * 2^{-64} < 2^{-61} ~= 4.3e-19. This transforms SCCP from P(detect) < 1 (Shannon model) to P(detect) >= 1 - 2^{-61}. Implementations MUST NOT expose GRG internal state, shard values, or intermediate pipeline results through public APIs or error messages. 11.8. Path Manipulation Attack Scenarios This section specifies the TTTPS defense against path-layer attacks, including SS7 gateway compromise. 11.8.1. Scenario A: SS7 Gateway Compromise and Traffic Rerouting Attack: An adversary controlling an SS7 gateway silently reroutes traffic between two TTTPS nodes, introducing ordering delays or attempting to inject modified PoT records. Attack capability: * Reroute packets to introduce N milliseconds of additional delay (N up to hundreds of ms for intercontinental paths). * Attempt to substitute a previously captured PoT record from a different execution context. * Modify path-layer headers without TLS visibility. TTTPS defense: (1) Context binding (Section 6.2): The HMAC key is derived as k = SHA-256(ctx_id). A PoT generated in context ctx_id_A will fail HMAC verification if presented in context ctx_id_B. Path rerouting cannot change the ctx_id embedded in the PoT. (2) Recency gate (Section 7.3): A PoT submitted at time S where (S - T_generated) > tier_tolerance is rejected regardless of cryptographic validity. Path-induced delays exceeding the tier tolerance are thus self-defeating. (3) TLS binding (Section 8.1): The binding_key = TLS-Exporter (EXPORTER-tttps-pot-binding, pot_without_sig, 32) is session- specific. A PoT captured from session A cannot be replayed into session B even if the path-layer attacker can observe both sessions. Jorgen Expires 1 January 2027 [Page 36] Internet-Draft TTTPS June 2026 Security bound: An adversary controlling only network paths (not the Issuer's Ed25519 private key) cannot produce a PoT that passes all three checks. Path manipulation is necessary but not sufficient for a successful attack. 11.8.2. Scenario B: SS7 Location Tracking and Ordering Inference Attack: An adversary uses SS7 MAP UpdateLocation messages to track the geographic positions of TTTPS Issuers and verifiers, then exploits propagation delay asymmetry to gain ordering advantage. Attack capability: * Determine physical location of network nodes with ~100m accuracy using SS7 MAP queries [SS7-VULN]. * Infer network propagation delays between known nodes. * Exploit delay asymmetry to consistently submit PoT records before honest competitors. TTTPS defense: The GRG_Commitment is generated at time T_generated from multi-source Roughtime data. The submission window is [T_generated, T_generated + tier_tolerance]. An adversary who knows propagation delays can position submissions within this window, but cannot: * Extend the window (recency gate rejects late submissions). * Generate a valid PoT with an earlier timestamp without the Issuer's private key (Ed25519 EUF-CMA: P(forge) < 2^{-128}). * Reuse a previously generated PoT (nonce freshness check). Ordering inference from location tracking thus provides no actionable advantage within the TTTPS framework. 11.8.3. Scenario C: Man-in-the-Middle with Timestamp Forgery Attack: A MITM adversary intercepts a PoT in transit and attempts to modify the timestamp field before forwarding. Attack requirements for success: the adversary must produce a valid tuple (timestamp', grg_commitment', Ed25519_sig') such that: * grg_commitment' = GRG(P' || D_chain', ctx_id) [GRG preimage] Jorgen Expires 1 January 2027 [Page 37] Internet-Draft TTTPS June 2026 * Ed25519_sig' = Ed25519.Sign(sk, P' || grg_commitment') [sig] * timestamp' is accepted by the recency gate [timing] Security bounds: * P(Ed25519 forgery) < 2^{-128} (EUF-CMA, 128-bit security) * P(AEAD tag forgery) < 2^{-64} (ChaCha20-Poly1305 AEAD record-layer protection) * P(combined success) < 2^{-191} Additionally, a timestamp' < T_generated would fail the Roughtime chain verification (Theorem 0, Section 5.4): the GRG_Commitment binds the Roughtime-derived D_chain, and a forged earlier timestamp would produce a different D_chain'. 11.9. Trust Model and Key Compromise Resilience IETF security reviewers require explicit specification of the trust model: who trusts whom, and what happens when trust is violated. 11.9.1. Trust Hierarchy TTTPS defines a two-level trust hierarchy: Level 0 (L0) Certificate Authority: An L0 CA issues certificates to PoT Issuers. Verifiers trust L0 CA public keys, published in a transparency log (analogous to Certificate Transparency [RFC6962]). L0 CAs correspond to the "Financial", "Satellite", "Source", and "Network" CA roles defined in the companion deployment architecture. Level 1 (L1) PoT Issuer: An L1 Issuer holds an Ed25519 key pair certified by an L0 CA. The Issuer generates PoT records (Section 5.3) and signs them with its private key. Verifier: Any party that receives a PoT and verifies it per Section 5.5. Verifiers check: (1) L0 CA signature on Issuer certificate, (2) Ed25519 signature on PoT, (3) Roughtime chain digest, (4) recency, (5) nonce freshness. This model is analogous to TLS PKI: L0 CAs are root CAs, L1 Issuers are intermediate CAs, and verifiers are TLS clients. The Issuer-to- verifier relationship is one-to-many. Jorgen Expires 1 January 2027 [Page 38] Internet-Draft TTTPS June 2026 11.9.2. Issuer Key Compromise Response If an L1 Issuer's Ed25519 private key is compromised: (1) Key rotation: The L0 CA revokes the compromised certificate and issues a new one with a new key_id (future versions of the PoT wire format SHOULD include a key_id field for rotation support). (2) Transparency audit: All PoTs generated by the compromised key are logged in the transparency log with their Roughtime chain digests. Third parties can verify which PoTs were generated with valid Roughtime data and which were generated after the compromise window. (3) Roughtime independence: The Roughtime chain (k >= 3 independent servers, Section 5.3) provides an independent check on Issuer- reported timestamps. Even after key compromise, the attacker cannot generate PoTs with timestamps outside the current Roughtime consensus window without also compromising k/2 Roughtime servers. Issuer compromise is thus bounded: the attacker can generate PoTs with valid-looking timestamps only within the Roughtime consensus window at the time of compromise. 11.9.3. Untrusted Substrate Guarantee TTTPS provides the following formal guarantee: "For any adversary A controlling at most k/2 - 1 Roughtime servers, at most one L0 CA, and any subset of network paths (including all SS7 gateways), A cannot: (a) generate a PoT with timestamp T' != T that passes verification with probability > 2^{-61}; or (b) replay a valid PoT into a different TLS session; or (c) cause the recency gate to accept a PoT submitted outside tier_tolerance; or (d) link PoT records from different sessions to the same originator." This guarantee holds under the assumption that Ed25519 satisfies EUF- CMA with 128-bit security and HMAC-SHA256 is a PRF. Neither assumption requires trust in the underlying network layer. Jorgen Expires 1 January 2027 [Page 39] Internet-Draft TTTPS June 2026 12. Privacy Considerations 12.1. Unlinkability PoT records include a 256-bit random Nonce (Section 5.2) that MUST be freshly generated for each record. This prevents linkage of PoT records from the same issuer across sessions. The TLS Exporter binding (Section 8.1) ensures that PoT records are bound to specific TLS sessions and cannot be used to correlate activity across sessions. Issuers SHOULD NOT include in PoT records any information beyond the fields defined in Section 5.2 that could enable participant identification. 12.2. Minimal Disclosure The PoT wire format (Section 5.1) does not include: * Participant identity or address * Transaction content * Economic parameters or bid values The ctx_id is an opaque context identifier (application-assigned) and is a public, non-sensitive value. Its inclusion in the HMAC key does not introduce new disclosures. Because ctx_id is an opaque String to the protocol, its semantics can be extended by application convention without any change to the wire format (Section 5) or the GRG binding (Section 6). A SAGIN (Space- Air-Ground Integrated Network) deployment MAY adopt a "region:node" convention to bind each PoT to the segment and node that issued it. Examples: Segment | ctx_id (example) ---------------|--------------------------------- deep-space | mars-relay:DSN-Goldstone-14 LEO satellite | leo-sat:starlink-3421 HAPS / strato | haps:stratobus-07 terrestrial | terrestrial:gnb-seoul-042 The protocol treats these strings as opaque: the HMAC context gate (Section 6.2) binds a PoT to whichever ctx_id string was used at generation, so a PoT issued under "mars-relay:DSN-Goldstone-14" cannot be replayed under "leo-sat:starlink-3421" regardless of path. Jorgen Expires 1 January 2027 [Page 40] Internet-Draft TTTPS June 2026 This is a purely semantic extension of the existing opaque identifier; no new field, no wire redesign, and no change to the 4-bit Tier or the PoT record layout is required. 13. IANA Considerations 13.1. TLS Exporter Labels Registry IANA is requested to add the following entry to the "TLS Exporter Labels" registry [RFC5705]: Label: EXPORTER-tttps-pot-binding DTLS-OK: Y Recommended: Y Reference: [this document] Section 8.1 13.2. ALPN Protocol ID Registration IANA is requested to add the following entry to the "TLS Application- Layer Protocol Negotiation (ALPN) Protocol IDs" registry [RFC7301]: Protocol: TTTPS over TLS 1.3 Identification Sequence: 0x74 0x74 0x74 0x70 0x73 0x2F 0x31 ("tttps/1") Reference: [this document] Section 8.5 The "tttps/1" identifier negotiates TTTPS capability between peers (Section 8.5) and does not alter the TLS handshake. 13.3. TTTPS Tier Registry IANA is requested to create a new registry "TTTPS Tier Identifiers" with the following initial values: Value | Name | Interval | Reference ------|-------------|-----------|------------------ 0x0 | T0_epoch | 6.4 min | [this document] 0x1 | T1_block | 2 sec | [this document] 0x2 | T2_slot | 12 sec | [this document] 0x3 | T3_micro | 100 ms | [this document] 0x4 | T-s1_dspace | adaptive | [this document] 0x5-F | Reserved | -- | [this document] Registration procedure: Specification Required. Jorgen Expires 1 January 2027 [Page 41] Internet-Draft TTTPS June 2026 13.4. Time Source Type Registry IANA is requested to create a new registry "TTTPS Time Source Types" with the following initial values: Value | Name | Reference ------|-------------|------------------ 0x01 | NIST | [this document] 0x02 | Google | [this document] 0x03 | Cloudflare | [this document] 0x04 | Apple | [this document] 0x05-FE | Unassigned | Specification Required 0xFF | Private Use | [this document] 13.5. HTTP/3 and QUIC Stream Types IANA is requested to add the following entries: HTTP/3 Frame Types registry: Type: TBD (to be assigned by IANA; 0x4C4F5400 proposed) Name: TTTPS_POT_FRAME Reference: [this document] Section 8.3 Note: Implementations MUST use the IANA-assigned value. QUIC Stream Types registry: Type: TBD (to be assigned by IANA) Name: TTTPS_POT_STREAM Reference: [this document] Section 8.2 Note: Implementations MUST use the IANA-assigned value. Until assigned, use 0x74 for testing only. 13.6. URI Scheme Registration IANA has provisionally registered the URI scheme "tttps" in the "Uniform Resource Identifier (URI) Schemes" registry [RFC7595]: Scheme: tttps Status: Provisional Reference: [this document] URI: https://www.iana.org/assignments/uri-schemes/prov/tttps Per [RFC7595] Section 3.3, this provisional registration does not imply endorsement by the IETF. Permanent registration will be requested upon publication of this document as an RFC. Jorgen Expires 1 January 2027 [Page 42] Internet-Draft TTTPS June 2026 13.7. PoT Extension Type TTTPS-00 referenced TLS Extension Type 0xFF50 (Private Use range). TTTPS-01 does NOT use a TLS Extension Type. The TLS Exporter mechanism (Section 8.1) requires no codepoint. If a future version requires a TLS Extension Type, the authors will request a codepoint via Specification Required procedure per [RFC8447]. 14. Intellectual Property The GRG Integrity Pipeline is covered by pending patent applications filed by the authors. Full specification of the GRG pipeline, including stage implementations and parameter selection, will be made available upon conclusion of patent proceedings (targeted Q3 2026). In accordance with IETF policy [BCP79], the authors are prepared to license any patents essential to this specification on FRAND terms. Independent implementation is possible using: * The abstract interface in Section 6.1 * The external properties in Section 6.3 * The reference implementation [OPENTTT] This follows the precedent of [RFC8915] Section 6, which specifies cookie format as implementation-dependent. 15. Implementation Status This section records the status of known implementations of TTTPS at the time of posting, per [RFC7942]. 15.1. Reference Implementation Name: OpenTTT URL: https://github.com/Helm-Protocol/OpenTTT Level: Partial (verifier SDK, QUIC transport, Roughtime chain) Coverage: * PoT wire format (Section 5.1): implemented, 12/12 tests * GRG pipeline external interface (Section 6.1): implemented via HTTP API to private Issuer; 4/4 integration tests Jorgen Expires 1 January 2027 [Page 43] Internet-Draft TTTPS June 2026 * AdaptiveSwitch (Section 7.1): TLA+-verified, 9/9 tests * QUIC transport / TLS binding (Section 8): implemented with quinn 0.11, ALPN tttps/1, measured RTT ~494 us on loopback * Roughtime chain (Section 5.3): 8/8 tests, real UDP queries * no_std verifier (Section 6.1): IoT/ARM compatible, 10/10 Total: 99 tests passing, 0 failing (April 2026). Private Issuer implementation: Name: Helm grg-core Level: Complete (Issuer with GRG pipeline, Ed25519 signing) Tests: 72 tests passing, 0 failing Note: GRG pipeline implementation not published pending patent proceedings (Section 13). Abstract interface (Section 6.1) is sufficient for independent implementation. 15.2. Deployment Evidence A PoT Issuer compliant with draft-helmprotocol-tttps has been operated experimentally. The following data were collected: Total PoT records generated: 70,612 Collection period: October 2025 -- April 2026 AI agent-originated records: 55% (38,837 records) Human-originated records: 45% (31,775 records) Mean generation latency: 47 ms (TURBO mode) Mean generation latency: 127 ms (FULL mode) TURBO / FULL split: 62% / 38% Zero cryptographic failures in 70,612 records. The 55% AI agent fraction was unanticipated and constitutes empirical evidence that the ordering problem is already operational in agent economies, not merely theoretical. 15.3. Formal Verification Artifacts This subsection records publicly available formal-verification artifacts relevant to the TTTPS confidence and InsufficientKnowledge primitives. These artifacts are informational; they are not required for protocol conformance. Jorgen Expires 1 January 2027 [Page 44] Internet-Draft TTTPS June 2026 * kenoslean (Python Package Index, version 0.1.0): a publicly published package of machine-verified computational contracts, with the underlying properties formalised in Lean 4 / Mathlib [KENOSLEAN]. The library is sorry-free (it contains no unproven `sorry` placeholders) for the contracts it exposes. * G-Score / InsufficientKnowledge primitive: the confidence metric used to qualify temporal and knowledge attestations is formalised in Lean 4 as the normalised Shannon entropy of an attention distribution, G(p) = H(p) / log n, where H(p) = sum_i -p_i log p_i. The formalisation is sorry-free and machine- checked, and proves the boundary properties 0 <= G(p) <= 1, G(uniform) = 1 (maximal uncertainty), and G(point mass) = 0 (full certainty). This provides a verified basis for confidence-graded attestation: InsufficientKnowledge is signalled when G(p) exceeds a configured threshold. Scope note: the term "machine-verified" here means the stated Lean 4 properties are checked by the Lean kernel against the Mathlib library; it does not assert verification of the full GRG pipeline implementation, which remains unpublished (Section 13). No claim is made outside the record-integrity (Section 5) and computation- integrity (this subsection) scope. 15.4. Interested Parties This subsection records organisations that have expressed interest in the deployment scenarios described in Section 2. Inclusion here does not constitute endorsement of any specific version of this draft. At the time of this revision, no interested-party statements have been received. Organisations in early discussion include satellite network operators (Section 2.1) and financial infrastructure providers (Section 2.3); these discussions do not constitute commitments. Authors request that organisations wishing to be listed contact the authors directly. A non-binding expression of interest in the stated use cases is sufficient for inclusion. 16. References 16.1. Normative References [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate Requirement Levels", BCP 14, RFC 2119, March 1997, . Jorgen Expires 1 January 2027 [Page 45] Internet-Draft TTTPS June 2026 [RFC5705] Rescorla, E., "Keying Material Exporters for Transport Layer Security (TLS)", RFC 5705, March 2010, . [RFC7301] Friedl, S., "Transport Layer Security (TLS) Application- Layer Protocol Negotiation Extension", RFC 7301, July 2014, . [RFC7595] Thaler, D., Ed., Hansen, T., and T. Hardie, "Guidelines and Registration Procedures for URI Schemes", RFC 7595, BCP 35, June 2015, . [RFC8174] Leiba, B., "Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words", BCP 14, RFC 8174, May 2017, . [RFC8446] Rescorla, E., "The Transport Layer Security (TLS) Protocol Version 1.3", RFC 8446, August 2018, . [RFC8126] Cotton, M., "Guidelines for Writing an IANA Considerations Section in RFCs", BCP 26, RFC 8126, June 2017, . [RFC8447] Salowey, J. and S. Turner, "IANA Registry Updates for TLS and DTLS", RFC 8447, August 2018, . [RFC8915] Franke, D., "Network Time Security for the Network Time Protocol", RFC 8915, September 2020, . [RFC9000] Iyengar, J. and M. Thomson, "QUIC: A UDP-Based Multiplexed and Secure Transport", RFC 9000, May 2021, . [RFC9114] Bishop, M., "HTTP/3", RFC 9114, June 2022, . 16.2. Informative References [Bellare1996] Bellare, M., Canetti, R., and H. Krawczyk, "Keying Hash Functions for Message Authentication", CRYPTO 1996, LNCS 1109, 1996. Jorgen Expires 1 January 2027 [Page 46] Internet-Draft TTTPS June 2026 [Bernstein2012] Bernstein, D.J., "High-speed high-security signatures", J. Cryptogr. Eng. 2, 77-89, 2012. [Castro1999] Castro, M. and B. Liskov, "Practical Byzantine Fault Tolerance", OSDI, 173-186, 1999. [EIGENPHI] EigenPhi Research, "MEV sandwich attacks: annual loss estimates", 2025. [FLASHBOTS] Flashbots, "MEV explore", 2025, . [Golomb1966] Golomb, S.W., "Run-length encodings", IEEE Trans. Inf. Theory 12, 399-401, 1966. [Mazorra2026] Mazorra, B., Schlegel, C., and A. Mamageishvili, "Timing games: probabilistic backrunning and spam", arXiv:2602.22032, 2026, . [Messias2025] Messias, J. and C.F. Torres, "The express lane to spam and centralization: an empirical analysis of Arbitrum's Timeboost", arXiv:2509.22143, 2025, . [OPENTTT] Helm Protocol, "OpenTTT SDK", npm install openttt, 2026, . [POT2026] Jorgen, H., "Proof-of-Time: Byzantine-Resilient Temporal Ordering in Untrusted Networks", IETF draft-helmprotocol- tttps-00, March 2026. [Reed1960] Reed, I.S. and G. Solomon, "Polynomial codes over certain finite fields", SIAM J. Appl. Math. 8, 300-304, 1960. [Tietavainen1973] Tietavainen, A., "On the nonexistence of perfect codes over finite fields", SIAM J. Appl. Math. 24, 88-96, 1973. Jorgen Expires 1 January 2027 [Page 47] Internet-Draft TTTPS June 2026 [GLASSWING] Anthropic, "Project Glasswing: Securing Critical Software for the AI Era", April 2026, . [MAZORRA2026note] Jorgen, H., "Proof-of-Time: Completing the Timing Game", The Flashbots Collective, March 2026, . [Zhang2026] Zhang, J., "Hyperagents", arXiv:2603.19461, 2026, . [SS7-VULN] Positive Technologies, "SS7 Vulnerabilities and Attack Exposure Report", 2020, . [GSMA-SS7] GSMA, "SS7 and SIGTRAN Network Security", GSMA document FS.11, November 2015, . [GPS-SPOOF] Humphreys, T., "Statement on the Vulnerability of Civil Unmanned Aerial Vehicles and Other Systems to Civil GPS Spoofing", University of Texas Radionavigation Laboratory, 2012. [RFC6962] Laurie, B., "Certificate Transparency", RFC 6962, June 2013, . [RFC7942] Sheffer, Y. and A. Farrel, "Improving Awareness of Running Code: The Implementation Status Section", BCP 205, RFC 7942, July 2016, . [I-D.ietf-ntp-roughtime] Ladd, W. and M. Dansarie, "Roughtime", Work in Progress (draft-19). RFC Editor Queue; intended status Experimental (status verified on the IETF Datatracker, June 2026), Work in Progress, Internet-Draft, draft-ietf-ntp-roughtime-19, 2026, . [I-D.ietf-rats-msg-wrap] Birkholz, H., "RATS Conceptual Messages Wrapper (CMW)", Work in Progress. RFC Editor Queue (status verified on the Jorgen Expires 1 January 2027 [Page 48] Internet-Draft TTTPS June 2026 IETF Datatracker, June 2026), Work in Progress, Internet- Draft, draft-ietf-rats-msg-wrap-23, 2026, . [KENOSLEAN] Kenosian, "kenoslean: machine-verified computational contracts, Lean 4 / Mathlib", Python Package Index, version 0.1.0, 2026, . [CFR-21-Part-11] U.S. Food and Drug Administration, "Electronic Records; Electronic Signatures", Title 21 Code of Federal Regulations Part 11. [IEEE1588] IEEE, "IEEE Standard for a Precision Clock Synchronization Protocol for Networked Measurement and Control Systems", IEEE Std 1588-2019. Appendix A. AdaptiveSwitch TLA+ Specification The following TLA+ module formally specifies the AdaptiveSwitch state machine. The module is verified by the TLC model checker with parameters MaxNodes=3, MaxBlocks=10, TierToleranceMs=100, TurboEntry=95, TurboMaintain=85. The module specifies: * TypeInvariant: all five state variables are well-typed. * S1 (NoForcedTurbo): TURBO requires match_rate >= 85 AND fail_count = 0 -- conjunction, not disjunction. * S2 (DelayRejectionTriggersFull): submission outside tier tolerance is incompatible with TURBO. * S3 (FailureExcludesTurbo): any integrity failure forces FULL. * L1 (EventualTurbo): a node with sustained good behaviour eventually reaches TURBO (liveness under weak fairness). EnvStep models the environment updating match_rate, fail_count, and submission_delay nondeterministically, ensuring the invariants hold under all adversarial input sequences. The module structure follows the AgentLifecycle pattern of the Helm Autonomy Layer Yellow Paper v2.0. Jorgen Expires 1 January 2027 [Page 49] Internet-Draft TTTPS June 2026 ---- MODULE AdaptiveSwitch ---- EXTENDS Naturals, FiniteSets CONSTANTS MaxNodes, MaxBlocks, TurboEntry, TurboMaintain, TierToleranceMs ASSUME /\ TurboEntry = 95 \* 95% match_rate required for TURBO /\ TurboMaintain = 85 \* 85% minimum to stay in TURBO /\ TierToleranceMs > 0 \* positive tier tolerance (ms) NodeId == 1..MaxNodes \* finite set of node identifiers Modes == { "TURBO", "FULL" } VARIABLES node_mode, \* [NodeId -> Modes] per-node state match_rate, \* [NodeId -> 0..100] ordering-match percentage fail_count, \* [NodeId -> Nat] consecutive failures block_count, \* Nat current block number submission_delay \* [NodeId -> Nat] ms since last PoT gen vars == <> \* -- Helpers ------------------------------------------------------ SubmittedOutsideTolerance(n) == submission_delay[n] > TierToleranceMs \* -- Type correctness --------------------------------------------- TypeInvariant == /\ node_mode \in [NodeId -> Modes] /\ match_rate \in [NodeId -> 0..100] /\ fail_count \in [NodeId -> Nat] /\ block_count \in Nat /\ submission_delay \in [NodeId -> Nat] \* -- Initial state (all nodes start in FULL, zero counters) ------- Init == /\ node_mode = [n \in NodeId |-> "FULL"] /\ match_rate = [n \in NodeId |-> 0] /\ fail_count = [n \in NodeId |-> 0] /\ block_count = 0 /\ submission_delay = [n \in NodeId |-> 0] \* -- Actions ------------------------------------------------------ \* Promote n from FULL to TURBO when match_rate sufficient \* and no pending failures. PromoteToTurbo(n) == Jorgen Expires 1 January 2027 [Page 50] Internet-Draft TTTPS June 2026 /\ node_mode[n] = "FULL" /\ match_rate[n] >= TurboEntry /\ fail_count[n] = 0 /\ ~SubmittedOutsideTolerance(n) /\ node_mode' = [node_mode EXCEPT ![n] = "TURBO"] /\ UNCHANGED <> \* Demote n from TURBO to FULL on poor match_rate, integrity \* failure, or submission outside tier tolerance. DemoteToFull(n) == /\ node_mode[n] = "TURBO" /\ \/ match_rate[n] < TurboMaintain \/ fail_count[n] > 0 \/ SubmittedOutsideTolerance(n) /\ node_mode' = [node_mode EXCEPT ![n] = "FULL"] /\ UNCHANGED <> \* Environment step: update match_rate / fail_count / delay \* (models external inputs; unconstrained for model checking) EnvStep(n, mr, fc, sd) == /\ match_rate' = [match_rate EXCEPT ![n] = mr] /\ fail_count' = [fail_count EXCEPT ![n] = fc] /\ submission_delay' = [submission_delay EXCEPT ![n] = sd] /\ block_count' = block_count + 1 /\ UNCHANGED node_mode Next == \E n \in NodeId : \/ PromoteToTurbo(n) \/ DemoteToFull(n) \/ \E mr \in 0..100, fc \in 0..5, sd \in 0..(TierToleranceMs+50) : EnvStep(n, mr, fc, sd) Spec == Init /\ [][Next]_vars /\ WF_vars(Next) \* -- Safety invariants -------------------------------------------- \* S1: TURBO requires healthy match_rate AND no integrity failures. NoForcedTurbo == \A n \in NodeId : node_mode[n] = "TURBO" => /\ match_rate[n] >= TurboMaintain /\ fail_count[n] = 0 \* S2: Delay outside tier tolerance must not coexist with TURBO. Jorgen Expires 1 January 2027 [Page 51] Internet-Draft TTTPS June 2026 DelayRejectionTriggersFull == \A n \in NodeId : SubmittedOutsideTolerance(n) => node_mode[n] = "FULL" \* S3: fail_count > 0 must not coexist with TURBO. FailureExcludesTurbo == \A n \in NodeId : fail_count[n] > 0 => node_mode[n] = "FULL" \* -- Liveness ----------------------------------------------------- \* L1: A node with sustained good behaviour eventually reaches TURBO. EventualTurbo == \A n \in NodeId : (match_rate[n] >= TurboEntry /\ fail_count[n] = 0 /\ ~SubmittedOutsideTolerance(n)) ~> node_mode[n] = "TURBO" \* -- TLC model values (for model checking) ------------------------ \* MaxNodes = 3, MaxBlocks = 10, TierToleranceMs = 100 \* TurboEntry = 95, TurboMaintain = 85 ==== The invariant NoForcedTurbo corresponds to Safety Property S4 of Helm Yellow Paper v2.0 (AS score external immutability). Appendix B. GRG Pipeline Specification (Placeholder) The GRG Integrity Pipeline (Section 6) processes PoT payloads through four stages: Golomb-Rice (G_1), Reed-Solomon (R), Golay(23,12,7) (G_2), and HMAC-SHA256 (H). The stage ordering G_1 -> R -> G_2 -> H is mathematically necessary, as proven in [POT2026] Theorems 1-3. Full specification of internal cryptographic operations, parameter selection, and implementation details will be published upon conclusion of pending patent proceedings (targeted Q3 2026). Reference implementation: https://github.com/Helm-Protocol/OpenTTT npm: npm install openttt Independent implementations of the abstract interface (Section 6.1) and external properties (Section 6.3) are permitted under BSL-1.1 license terms. Jorgen Expires 1 January 2027 [Page 52] Internet-Draft TTTPS June 2026 Appendix C. Test Vectors Test vectors for PoT generation and verification are provided as property-based tests rather than deterministic byte vectors. This approach prevents reverse-engineering of GRG pipeline parameters from expected byte sequences. Required properties (all MUST pass): C.1 Lossless round-trip: GRG_Inverse(GRG(P, ctx)) = P for all P, ctx C.2 Nonce uniqueness: Two calls to Generate() MUST NOT produce equal Nonces. C.3 Context separation: GRG(P, ctx_A) != GRG(P, ctx_B) for ctx_A != ctx_B (negligible probability of collision: < 2^{-61}) C.4 Verification correctness: Verify(Generate(P, ctx), ctx) = TRUE C.5 Forgery resistance: Verify(tampered_record, ctx) = FALSE for any single-bit modification to P or GRG_Commitment. C.6 Delay rejection: A PoT submitted at T + tier_tolerance + 1ms MUST trigger FULL mode. C.7 HMAC gate priority: HMAC verification MUST complete before Ed25519 is attempted. Invalid HMAC MUST NOT result in Ed25519 invocation (measurable via timing). Reference test suite: 365 tests, 31 suites, 100% pass rate [OPENTTT]. The test suite uses property-based testing only (no deterministic byte vectors). Appendix D. FILO+GRG Delay Rejection Flow This appendix provides a normative ASCII diagram of the FILO+GRG delay rejection mechanism described in Section 10.6. Jorgen Expires 1 January 2027 [Page 53] Internet-Draft TTTPS June 2026 TIME AXIS: |----T------|---(T+epsilon)---|---------(T+Delta)--------> PoT gen tier tolerance delayed submission time window end zone VALID SUBMISSION WINDOW: [T, T + tier_tolerance] DELAYED ZONE: (T + tier_tolerance, infinity) GATE 1: HMAC context binding (~6 microseconds) -------------------------------------------------- Input: PoT record + submission context If HMAC(k, shard_i) does not match for any i: -> REJECT immediately -> DO NOT invoke Ed25519 Covers: wrong context, tampered payload GATE 2: AdaptiveSwitch recency check -------------------------------------------------- Input: PoT record + current submission time S If (S - PoT.Timestamp) > tier_tolerance: -> REJECT -> Trigger FULL mode -> Apply exponential backoff Covers: valid PoT submitted outside tolerance window FILO QUEUE (Gate 1 AND Gate 2 passed) -------------------------------------------------- Queue discipline: most recently generated PoT first. If multiple PoTs qualify: Select max(PoT.Timestamp) for processing. Earlier PoTs remain in queue. Effect on delay attackers: o Cannot pass Gate 2 (recency check rejects) o Even if somehow past Gate 2, lose priority to fresher PoTs o Repeated failures -> exponential backoff -> self-defeating COMPLEXITY NOTE: Gate 1 (HMAC): O(1) per record, ~6 microseconds Gate 2 (recency): O(1) per record, ~0.1 microseconds Queue ordering: O(log q) for q queued records (priority queue) Total per-record: O(1) -- independent of network size n Compare with BFT consensus protocols: PBFT/Tendermint/HotStuff: O(n^2) network-wide message Jorgen Expires 1 January 2027 [Page 54] Internet-Draft TTTPS June 2026 exchanges to reach Byzantine TOLERANCE (tolerate f < n/3 Byzantine nodes) for n total nodes. TTTPS achieves Byzantine ELIMINATION at O(1) per record. Honest user verification cost: ~106 microseconds (constant). Attacker economic cost: increases as V* threshold makes manipulation irrational (E[profit] < 0 for V < $8.67). Attacker backoff cost: O(2^f) blocks for f failures. Network scaling: 100 nodes -> 1,000,000 nodes: BFT cost grows 10^8x; TTTPS per-record cost unchanged. Appendix E. Motivating Use Case: Regulated Therapeutic Design Pipeline This appendix illustrates the pre-ingestion property of TTTPS in a regulated, high-assurance setting, and distinguishes the two integrity guarantees the protocol and its companion formal- verification artifacts (Section 14.3) provide. No specific organisation or individual is named; the scenario is presented as a representative class of deployment, and is informative rather than normative. E.1. Setting Consider a personalised therapeutic-design pipeline that emits electronic design records continuously and at high volume, operating under FDA 21 CFR Part 11 [CFR-21-Part-11] requirements for electronic records. Because each design record differs, the records must be both contemporaneous and immutable to serve as regulatory evidence (the operator-independence and contemporaneous-record concerns addressed by 21 CFR 11.10(e)). E.2. Problem A self-attestation model -- in which the design system asserts the creation time of each record -- provides no independent guarantee that a record's declared design time was not adjusted after the fact. For evidence supporting a regulatory submission, the design organisation, not only an external adversary, is within the trust boundary that the record must constrain. This is precisely the Strategic Channel Controller Problem (SCCP, Section 1.5) applied to record creation time. Jorgen Expires 1 January 2027 [Page 55] Internet-Draft TTTPS June 2026 E.3. Pillar 1 -- Record Integrity (TTTPS, 21 CFR 11.10(e)) Each design record is sealed at the moment of generation, binding a multi-source time consensus under an Issuer signature (Section 5.3), before the record enters system state (pre-ingestion enforcement, requirement R3 of Section 2.5). A record whose declared design time is inconsistent with its sealed consensus is rejected at verification (Section 5.4). Backdating is therefore excluded cryptographically rather than merely audited after the fact. E.4. Pillar 2 -- Computation Integrity (formal verification, 21 CFR 11.10(a)) Where 21 CFR 11.10(e) concerns the integrity of the *record*, 21 CFR 11.10(a) concerns operational checks on the *computation* that produced it. The machine-verified contracts referenced in Section 14.3 (kenoslean; Lean 4 / Mathlib; sorry-free) provide an independent, kernel-checked guarantee that a design computation conforms to its stated specification for the parameters supplied -- proof rather than assertion. Taken together, TTTPS seals when each record was produced (11.10(e)), and the formal contracts attest that the producing computation was applied faithfully to its specification (11.10(a)). The verification covers the record and the computation only; neither makes any claim about the underlying biology, which remains the domain of the design organisation. E.5. Summary This scenario is included to illustrate the protocol's pre-ingestion property in a regulated context and does not assert any specific deployment. Informative regulatory context includes FDA 21 CFR Part 11 [CFR-21-Part-11]; it is cited as motivating context, not as a conformance requirement. Acknowledgements The authors thank the IETF dispatch list reviewers (Worley, Jim, Tim) for feedback on draft-helmprotocol-tttps-00. The GRG pipeline selection rationale builds on deep-space engineering heritage: JPL Golomb-Rice compression, RS codes from Cassini and the Mars rovers, and Golay(23,12,7) from the Voyager Saturn transmissions (1.0e9 km, 1980). Author's Address Jorgen Expires 1 January 2027 [Page 56] Internet-Draft TTTPS June 2026 Heime Jorgen Kenosian Email: heime.jorgen@proton.me Jorgen Expires 1 January 2027 [Page 57]