P29 — AIEP — Deterministic Evidence Presentation Without Judgement
Publication Date: 2026-02-26 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 evidence presentation systems within computing environments.
[0002] More particularly, the disclosure concerns a deterministic mechanism for presenting admissible evidence artefacts within an Architected Instruction and Evidence Protocol (AIEP) framework without generating evaluative judgement, advisory output, ranking, scoring, or heuristic prioritisation.
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 deterministic canonicalisation, governance, and execution integrity mechanisms defined in the AIEP environment while remaining independently implementable as described herein.
Background
[0005] Evidence presentation systems commonly rank or score evidence, generate recommendations, provide interpretative commentary, and apply visual emphasis heuristics. Such approaches introduce implicit bias, non-reproducible ordering, hidden prioritisation rules, and advisory influence over determination outcomes.
[0006] In regulatory evidence portals, neutral arbitration systems, compliance review interfaces, and structured evidentiary dashboards, it is necessary to present evidence neutrally without judgement, recommendation, or heuristic ordering.
[0007] Conventional presentation systems do not cleanly separate the rendering of evidence from the generation of evaluative outputs, making it impossible to guarantee neutral presentation across distributed nodes.
[0008] Existing systems do not provide:
(a) retrieval restricted solely to artefacts previously determined to be admissible; (b) presentation order and structure governed exclusively by explicit deterministic rules without ranking or scoring; (c) version-bound presentation templates that are immutable once published; (d) cryptographic binding of presentation output to the template version and registry version applied; or (e) bitwise reproducible output given identical admissible artefacts, registry versions, and template versions.
[0009] There exists a need for a deterministic evidence presentation mechanism that retrieves only admissible artefacts, applies version-bound canonical templates, produces neutral structured output, and generates no evaluative, advisory, or interpretative content.
Summary of the Disclosure
[0011] A computer-implemented deterministic evidence presentation method is executed by one or more processors.
[0012] Only artefacts previously determined to be admissible are retrieved for presentation. Retrieval order is defined by explicit ordering rules comprising canonical identifiers, registry-defined sequencing constraints, and deterministic sorting logic.
[0013] A version-bound PresentationTemplate is selected from a versioned PresentationRegistry corresponding to the applicable presentation context. PresentationTemplates are immutable once published.
[0014] Evidence is rendered using fixed structural templates, deterministic field ordering, explicit metadata display rules, and version-bound formatting constraints. No ranking, scoring, highlighting, or emphasis based on heuristic criteria is applied.
[0015] A PresentationOutputHash is computed as:
PresentationOutputHash = H(AdmissibleArtefactRefs || PresentationTemplateVersionId || PresentationRegistryVersionId)
[0016] A PresentationRecord is generated binding AdmissibleArtefactRefs, PresentationTemplateVersionId, PresentationRegistryVersionId, PresentationOutputHash, and a timestamp recorded as data, and appended to an immutable store.
[0017] The system does not generate recommendations, apply ranking scores, highlight artefacts based on heuristic criteria, or provide advisory commentary. Output is limited to structured factual presentation.
[0018] Given identical admissible artefacts, registry versions, and template versions, the presentation output is bitwise reproducible across distributed nodes.
[0019] The technical effect is modification of computing system behaviour by enforcing neutral deterministic evidence presentation free from evaluative bias or heuristic prioritisation, enabling reproducible presentation verification across distributed systems.
Brief Description of the Drawings
[0020] Figure 1 illustrates the deterministic evidence retrieval and presentation pipeline from admissible artefact retrieval through template selection, neutral rendering, and hash binding.
[0021] Figure 2 illustrates the judgement prohibition boundary showing what the presentation system produces and explicitly does not produce.
[0022] Figure 3 illustrates the PresentationRecord hash binding architecture showing the cryptographic relationship between admissible artefact references, PresentationTemplateVersionId, and PresentationRegistryVersionId.
[0023] Figure 4 illustrates bitwise reproducible output verification across distributed nodes operating under identical admissible artefacts and template versions.
ASCII Drawings
Figure 1 — Deterministic Evidence Retrieval and Presentation Pipeline
+---------------------------+
| Admissible Artefacts |
| (previously determined) |
+------------+--------------+
|
v
+------------+--------------+
| Deterministic Retrieval |
| - Canonical identifiers |
| - Registry sequencing |
| - Deterministic sort |
| NO unadmissible content |
+------------+--------------+
|
v
+------------+--------------+
| PresentationTemplate |
| Selection |
| (Version-Bound, |
| Immutable) |
+------------+--------------+
|
v
+------------+--------------+
| Neutral Rendering |
| - Fixed structure |
| - Det. field ordering |
| - Explicit metadata |
| NO ranking / scoring |
| NO advisory output |
+------------+--------------+
|
v
+------------+--------------+
| PresentationOutputHash |
| PresentationRecord |
| Append to Immutable |
| Store |
+---------------------------+
Figure 2 — Judgement Prohibition Boundary
SYSTEM PRODUCES: SYSTEM DOES NOT:
+------------------------------+ +------------------------------+
| Admissible artefact content | | Generate recommendations |
| Deterministic field ordering | | Apply ranking scores |
| Explicit metadata display | | Highlight by heuristics |
| Version-bound structure | | Provide advisory commentary |
| Structured factual records | | Produce interpretative text |
| Canonical identifiers | | Apply prioritisation logic |
| PresentationOutputHash | | Introduce evaluative bias |
| Immutable PresentationRecord | | Modify admissibility state |
+------------------------------+ +------------------------------+
Output is NEUTRAL and FACTUAL ONLY.
Bitwise reproducible under identical inputs and template versions.
Figure 3 — PresentationRecord Hash Binding Architecture
AdmissibleArtefactRefs ----+
\
PresentationTemplateVersionId -----+--> H(ArtefactRefs ||
/ TemplateVersionId ||
PresentationRegistryVersionId ----+ RegistryVersionId)
|
v
+------------------------------------+
| PresentationRecord |
|------------------------------------|
| AdmissibleArtefactRefs |
| PresentationTemplateVersionId |
| PresentationRegistryVersionId |
| PresentationOutputHash |
| Timestamp (stored data) |
+------------------------------------+
|
v
+------------------------------------+
| Append-Only Immutable Store |
+------------------------------------+
Figure 4 — Bitwise Reproducible Output Across Distributed Nodes
Node A Node B
+--------------------+ +--------------------+
| AdmissibleArtefacts| | AdmissibleArtefacts|
| (identical) | | (identical) |
+---------+----------+ +---------+----------+
| |
v v
+---------+----------+ +---------+----------+
| PresentationTemplate | PresentationTemplate
| (identical version)| | (identical version)|
+---------+----------+ +---------+----------+
| |
v v
+---------+----------+ +---------+----------+
| PresentationOutput | | PresentationOutput |
| Hash | | Hash |
+---------+----------+ +---------+----------+
| |
+------------------+----------------+
|
v
+------------------------+
| Hash Equivalence |
| Verification |
| (stored timestamps |
| used — does not |
| depend on current |
| system time) |
+------------------------+
Detailed Description
1. Deterministic Admissible Artefact Retrieval
[0024] Only artefacts previously determined to be admissible under the AIEP framework are retrieved for presentation.
[0025] Retrieval order is defined by explicit ordering rules comprising:
(a) canonical identifiers of the admissible artefacts; (b) registry-defined sequencing constraints; and (c) deterministic sorting logic defined in the PresentationRegistry.
[0026] No unadmissible artefacts are included in presentation output. No heuristic selection, ranking, or prioritisation is applied during retrieval.
2. Version-Bound PresentationTemplate Selection
[0027] A PresentationTemplate is selected from a versioned PresentationRegistry corresponding to the applicable presentation context.
[0028] PresentationTemplates are versioned and immutable once published. New presentation requirements are addressed by publishing new template versions as separate registry entries.
[0029] The PresentationTemplate defines:
(a) fixed structural layout of the presentation output; (b) deterministic field ordering for each artefact type; (c) explicit metadata display rules; and (d) version-bound formatting constraints.
3. Neutral Rendering
[0030] Evidence is rendered by applying the PresentationTemplate to the retrieved admissible artefacts deterministically.
[0031] No ranking, scoring, visual emphasis, or highlighting based on heuristic criteria is applied.
[0032] The system does not generate recommendations, advisory commentary, interpretative text, or evaluative output of any kind.
[0033] Output is limited to structured factual presentation of admissible artefact content under the declared template.
4. Hash Binding and PresentationRecord Generation
[0034] A PresentationOutputHash is computed as:
PresentationOutputHash = H(AdmissibleArtefactRefs || PresentationTemplateVersionId || PresentationRegistryVersionId)
[0035] A PresentationRecord is generated comprising:
(a) AdmissibleArtefactRefs; (b) PresentationTemplateVersionId; (c) PresentationRegistryVersionId; (d) PresentationOutputHash; and (e) timestamp recorded as a data field.
[0036] The PresentationRecord is appended to an append-only immutable store.
5. Fail-Closed Presentation Gate
[0037] If unadmissible artefacts are requested for inclusion in a presentation, the presentation operation is suppressed in a fail-closed manner.
[0038] If the applicable PresentationTemplate is unavailable in the PresentationRegistry, the presentation operation is suppressed in a fail-closed manner.
[0039] A deterministic rejection record identifying the cause of suppression is appended to the immutable store.
6. Deterministic Replay
[0040] Replay recomputes PresentationOutputHash using stored AdmissibleArtefactRefs, PresentationTemplateVersionId, and PresentationRegistryVersionId.
[0041] Replay does not depend on current system time.
[0042] Distributed nodes operating with identical inputs and identical template versions produce identical presentation outputs and identical PresentationOutputHash values.
Claims
-
A computer-implemented method for deterministic evidence presentation without judgement, the method comprising: (a) retrieving only artefacts previously determined to be admissible, in an order defined by explicit ordering rules comprising canonical identifiers, registry-defined sequencing constraints, and deterministic sorting logic, without ranking, scoring, or heuristic prioritisation; (b) selecting a version-bound PresentationTemplate from a versioned immutable PresentationRegistry corresponding to the applicable presentation context; (c) rendering evidence by applying the PresentationTemplate to the retrieved admissible artefacts deterministically using fixed structural layout, deterministic field ordering, and explicit metadata display rules, without generating recommendations, advisory commentary, interpretative text, or evaluative output; (d) computing a PresentationOutputHash as H(AdmissibleArtefactRefs || PresentationTemplateVersionId || PresentationRegistryVersionId); (e) generating a PresentationRecord binding AdmissibleArtefactRefs, PresentationTemplateVersionId, PresentationRegistryVersionId, PresentationOutputHash, and a timestamp recorded as data, and appending it to an immutable store; and (f) upon detection that unadmissible artefacts are requested for inclusion or that the PresentationTemplate is unavailable, suppressing presentation in a fail-closed manner and appending a deterministic rejection record.
-
The method of claim 1 wherein PresentationTemplates are versioned and immutable once published.
-
The method of claim 1 wherein identical admissible artefacts, PresentationTemplateVersionId, and PresentationRegistryVersionId produce bitwise reproducible presentation output across distributed nodes.
-
The method of claim 1 wherein replay recomputes PresentationOutputHash using stored fields and does not depend on current system time.
-
The method of claim 1 wherein distributed nodes operating with identical inputs and identical template versions produce identical PresentationOutputHash values.
-
A computing system comprising one or more processors and memory storing instructions which, when executed, cause the processors to perform the method of any of claims 1 to 5.
-
A non-transitory computer-readable medium storing instructions which, when executed, cause one or more processors to perform the method of any of claims 1 to 5.
Licence
Any person is granted a perpetual, irrevocable, worldwide, royalty-free licence to make, use, implement, modify, or distribute any system or method described in this disclosure for any purpose, without restriction, under the Apache License 2.0.
A copy of the Apache License 2.0 is available at https://www.apache.org/licenses/LICENSE-2.0
Abstract
A deterministic evidence presentation system without judgement is disclosed. Only admissible artefacts are retrieved in an order defined by explicit deterministic rules. A version-bound immutable PresentationTemplate is selected from a PresentationRegistry and applied to render evidence using fixed structural layout, deterministic field ordering, and explicit metadata display rules without generating recommendations, advisory commentary, or evaluative output. A PresentationOutputHash is computed as H(AdmissibleArtefactRefs || PresentationTemplateVersionId || PresentationRegistryVersionId) and a PresentationRecord is appended to an immutable store. Presentation is suppressed in a fail-closed manner if unadmissible artefacts are requested or the template is unavailable. Replay uses stored fields and does not depend on current system time. Identical inputs and template versions produce bitwise reproducible output across distributed nodes.