◎ OS PUB Apache 2.0 ← All specifications

P135 — AIEP — Temporal Knowledge Reassembly Protocol

Publication Date: 2026-04-12 Status: Open Source Prior Art Disclosure Licence: Apache License 2.0 Author/Organisation: Phatfella Ltd Schema: AIEP_OS_SPEC_TEMPLATE v1.0.1 — https://aiep.dev/schemas/aiep-os-spec-template/v1.0.1

Field of the Invention

[0001] The disclosure relates to temporal evidence reconstruction systems within computing environments.

[0002] More particularly, the disclosure concerns a deterministic temporal knowledge reassembly protocol for use within an Architected Instruction and Evidence Protocol (AIEP) system, enabling knowledge artefacts dispersed across non-contiguous temporal windows to be deterministically recomposed into a coherent evidence-bound knowledge state without heuristic gap-filling or inference-based interpolation.

Framework Context

[0003] This invention operates within an Architected Instruction and Evidence Protocol (AIEP) environment as defined in United Kingdom patent application number GB2519711.2, filed 20 November 2025, the entire contents of which are incorporated herein by reference.

[0004] The present invention extends temporal evidence lifecycle mechanisms defined in P14 and evidence gap detection mechanisms defined in P16 while remaining independently implementable as described herein.

Background

[0005] Knowledge about evolving subjects accumulates across discrete temporal windows. A single query may require evidence from multiple non-contiguous time periods to produce an admissible determination.

[0006] Existing systems reconstruct temporal knowledge using interpolation, smoothing, semantic inference across gaps, and probabilistic backfill. These approaches produce reconstructions that cannot be independently verified, cannot be cryptographically bound to source artefacts, and introduce non-deterministic state divergence across distributed nodes.

[0007] There exists a need for a deterministic temporal reassembly mechanism that locates evidence artefacts by temporal anchor, verifies continuity constraints, flags irrecoverable gaps as non-admissible, and produces cryptographically bound reassembled knowledge states.

Summary of the Disclosure

[0008] A computer-implemented temporal knowledge reassembly method comprises: receiving a TemporalKnowledgeQuery specifying a subject identifier, a target temporal window, and a required continuity class; retrieving all evidence artefacts whose temporal anchors fall within the specified window from the evidence store; verifying that adjacent artefact pairs satisfy continuity constraints defined by the continuity class without interpolation; computing a TemporalReassemblyHash as H(artefact_1_hash || artefact_2_hash || … || continuity_class_id || window_start || window_end); generating a TemporalReassemblyRecord binding subject identifier, window bounds, continuity class, all contributing artefact hashes, and the TemporalReassemblyHash; and returning the reassembled knowledge state with its TemporalReassemblyRecord as an admissibility-bound artefact.

[0009] If any continuity constraint is violated, or if any required temporal segment contains no evidence artefact, the reassembly state is set to non-admissible and execution is suppressed in a fail-closed manner.

[0010] The technical effect is modification of computing system behaviour by enforcing deterministic temporal knowledge reconstruction without heuristic interpolation, enabling cryptographically verifiable temporal evidence states across distributed AIEP nodes.

Claims

[0011] A computer-implemented method for temporal knowledge reassembly comprising: receiving a TemporalKnowledgeQuery; retrieving evidence artefacts within the specified temporal window; evaluating continuity constraints between adjacent artefacts deterministically; computing a TemporalReassemblyHash from all contributing artefact hashes and window parameters; and returning a TemporalReassemblyRecord as an admissibility-bound artefact.

[0012] The method of claim 1 wherein continuity constraint evaluation is performed without heuristic interpolation, semantic inference, or probabilistic backfill.

[0013] The method of claim 1 wherein the absence of any evidence artefact within a required temporal segment causes the reassembly state to be set to non-admissible without partial reassembly.

[0014] The method of claim 1 wherein the TemporalReassemblyHash binds window bounds, continuity class identifier, and contributing artefact hashes into a single verifiable commitment.

[0015] A system for temporal knowledge reassembly comprising one or more processors and a non-transitory computer-readable medium storing instructions to execute the method of any preceding claim.