P30 — AIEP — Deterministic Licence-Tier Binding Without Control
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 licensing systems for admissible determination frameworks within computing environments.
[0002] More particularly, the disclosure concerns a deterministic licence-tier binding mechanism within an Architected Instruction and Evidence Protocol (AIEP) system that constrains admissible determination outputs according to versioned licence-tier definitions without asserting dynamic execution control, modifying core protocol logic, or introducing adaptive enforcement behaviour.
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] Conventional licensing mechanisms frequently rely on dynamic enforcement logic, remote authorisation checks, mutable policy servers, runtime execution gating, and opaque entitlement evaluation. Such systems introduce non-deterministic behaviour, modify execution state dynamically, permit discretionary override, and produce non-reproducible outputs across licence tiers.
[0006] In admissibility contexts requiring audit-grade reproducibility, licence constraints must bind deterministically without asserting runtime control over execution or introducing adaptive enforcement logic that could alter the behaviour of the core admissible determination protocol.
[0007] Existing systems do not provide:
(a) deterministic resolution of licence-tier metadata against a versioned immutable registry without remote authorisation or mutable policy lookup; (b) static application of licence-tier output constraints prior to determination without interrupting execution mid-process; (c) cryptographic binding of constrained output to the licence-tier version applied; (d) fail-closed denial when licence metadata is invalid or absent; or (e) reproducible constrained outputs given identical inputs, registry versions, and licence-tier metadata.
[0009] There exists a need for a deterministic licence-tier binding mechanism that resolves licence metadata from a versioned registry, constrains admissible determination outputs statically according to immutable tier definitions, and produces reproducible outputs without dynamic enforcement or execution control.
Summary of the Disclosure
[0011] A computer-implemented deterministic licence-tier binding method is executed by one or more processors.
[0012] Upon system invocation, the applicable licence tier is resolved using explicit licence metadata, deterministic LicenceRegistry lookup, and version-bound validation rules. If licence metadata is invalid or absent, processing is denied in a fail-closed manner.
[0013] A version-bound LicenceTierDefinition is retrieved from a versioned immutable LicenceRegistry corresponding to the resolved licence tier. The LicenceTierDefinition defines permitted output scopes, accessible artefact sets, presentation scope limitations, output filtering rules, and feature activation parameters.
[0014] Licence-tier output constraints are applied statically to admissible determination outputs prior to delivery, restricting accessible artefacts, limiting presentation scope, and enforcing output filtering rules according to the LicenceTierDefinition.
[0015] A LicenceBindingHash is computed as:
LicenceBindingHash = H(ConstrainedOutputRef || LicenceTierVersionId || LicenceRegistryVersionId)
[0016] A LicenceBindingRecord is generated binding LicenceTierIdentifier, LicenceTierVersionId, LicenceRegistryVersionId, LicenceBindingHash, and a timestamp recorded as data, and appended to an immutable store.
[0017] The system does not alter core protocol logic, interrupt execution mid-process, perform runtime enforcement checks beyond deterministic resolution, or apply discretionary override logic. Licence binding is static and deterministic for a given invocation.
[0018] Given identical input artefacts, registry versions, and licence-tier metadata, the constrained output is reproducible across distributed nodes.
[0019] The technical effect is modification of computing system output scope by applying deterministic static licence-tier constraints prior to delivery without introducing dynamic enforcement or execution control mechanisms.
Brief Description of the Drawings
[0020] Figure 1 illustrates the deterministic licence resolution and output constraint pipeline from invocation through registry lookup, tier definition retrieval, static constraint application, and hash binding.
[0021] Figure 2 illustrates the no-execution-control boundary showing what the licence binding system constrains and explicitly does not alter.
[0022] Figure 3 illustrates the LicenceBindingRecord hash binding architecture showing the cryptographic relationship between constrained output reference, LicenceTierVersionId, and LicenceRegistryVersionId.
[0023] Figure 4 illustrates reproducible constrained output verification across distributed nodes operating under identical licence metadata and registry versions.
ASCII Drawings
Figure 1 — Deterministic Licence Resolution and Output Constraint Pipeline
+---------------------------+
| System Invocation |
| + Licence Metadata |
+------------+--------------+
|
v
+------------+--------------+
| LicenceRegistry Lookup |
| (Version-Bound, |
| Deterministic) |
+------------+--------------+
|
+------+------+
Valid Invalid /
Metadata Absent
| |
v v
+------------------+ +-----------+
| Retrieve | | DENY |
| LicenceTier | | Processing|
| Definition | | Fail- |
| (Version-Bound, | | Closed |
| Immutable) | +-----------+
+--------+---------+
|
v
+--------+---------+
| Static Output |
| Constraint |
| Application |
| - Artefact scope |
| - Presentation |
| limits |
| - Output filter |
| NO execution |
| control |
+--------+---------+
|
v
+--------+---------+
| LicenceBindingHash
| LicenceBinding |
| Record |
| Append to |
| Immutable Store |
+------------------+
Figure 2 — No-Execution-Control Boundary
SYSTEM CONSTRAINS: SYSTEM DOES NOT:
+------------------------------+ +------------------------------+
| Accessible artefact set | | Alter core protocol logic |
| Presentation scope | | Interrupt execution |
| Output filtering | | Perform runtime enforcement |
| Feature activation scope | | Apply discretionary override |
| Delivery content boundary | | Modify determination outcome |
+------------------------------+ | Contact remote auth server |
| Use mutable policy server |
Constraints are STATIC and +------------------------------+
DETERMINISTIC for a given
invocation. Licence binding
does not alter protocol logic.
Figure 3 — LicenceBindingRecord Hash Binding Architecture
ConstrainedOutputRef ----+
\
LicenceTierVersionId -----+--> H(ConstrainedOutputRef ||
/ LicenceTierVersionId ||
LicenceRegistryVersionId ----+ LicenceRegistryVersionId)
|
v
+------------------------------------+
| LicenceBindingRecord |
|------------------------------------|
| LicenceTierIdentifier |
| LicenceTierVersionId |
| LicenceRegistryVersionId |
| LicenceBindingHash |
| Timestamp (stored data) |
+------------------------------------+
|
v
+------------------------------------+
| Append-Only Immutable Store |
+------------------------------------+
Figure 4 — Reproducible Constrained Output Across Distributed Nodes
Node A Node B
+--------------------+ +--------------------+
| Input Artefacts | | Input Artefacts |
| (identical) | | (identical) |
+---------+----------+ +---------+----------+
| |
v v
+---------+----------+ +---------+----------+
| LicenceMetadata | | LicenceMetadata |
| (identical) | | (identical) |
+---------+----------+ +---------+----------+
| |
v v
+---------+----------+ +---------+----------+
| LicenceRegistry | | LicenceRegistry |
| (identical version)| | (identical version)|
+---------+----------+ +---------+----------+
| |
v v
+---------+----------+ +---------+----------+
| Constrained Output | | Constrained Output |
| (identical) | | (identical) |
+---------+----------+ +---------+----------+
| |
v v
+---------+----------+ +---------+----------+
| LicenceBindingHash | | LicenceBindingHash |
+---------+----------+ +---------+----------+
| |
+------------------+----------------+
|
v
+------------------------+
| Hash Equivalence |
| Verification |
| (stored timestamps |
| used — does not |
| depend on current |
| system time) |
+------------------------+
Detailed Description
1. Versioned LicenceRegistry
[0024] A LicenceRegistry defines for each licence tier:
(a) LicenceTierIdentifier; (b) permitted output scopes specifying which artefact sets are accessible under the tier; (c) access constraints governing which determination operations may be invoked; (d) output visibility limitations restricting presentation scope; and (e) feature activation parameters specifying which protocol features are enabled.
[0025] LicenceRegistry entries are versioned and immutable once published. New licence requirements are addressed by publishing new tier versions as separate entries.
2. Deterministic Licence Resolution
[0026] Upon system invocation, the applicable licence tier is resolved using explicit licence metadata, deterministic LicenceRegistry lookup, and version-bound validation rules.
[0027] If licence metadata is invalid, absent, or references an unknown tier, processing is denied in a fail-closed manner without fallback to a default tier.
[0028] A deterministic rejection record is appended identifying the invalid or absent metadata and the LicenceRegistryVersionId.
3. Static Output Constraint Application
[0029] Following successful licence resolution, the LicenceTierDefinition is applied statically to admissible determination outputs prior to delivery.
[0030] Constraint application restricts the accessible artefact set, limits presentation scope, enforces output filtering rules, and applies feature activation parameters as defined in the LicenceTierDefinition.
[0031] Constraint application follows explicit deterministic rule sets. No adaptive logic, runtime evaluation, or discretionary override is permitted.
[0032] The system does not alter core protocol logic, interrupt execution mid-process, or perform runtime enforcement checks beyond deterministic licence resolution.
4. Hash Binding and LicenceBindingRecord Generation
[0033] A LicenceBindingHash is computed as:
LicenceBindingHash = H(ConstrainedOutputRef || LicenceTierVersionId || LicenceRegistryVersionId)
[0034] A LicenceBindingRecord is generated comprising:
(a) LicenceTierIdentifier; (b) LicenceTierVersionId; (c) LicenceRegistryVersionId; (d) LicenceBindingHash; and (e) timestamp recorded as a data field.
[0035] The LicenceBindingRecord is appended to an append-only immutable store.
5. Reproducible Constrained Output
[0036] Given identical input artefacts, identical LicenceRegistryVersionId, and identical licence-tier metadata, the constrained determination output is reproducible across distributed nodes.
[0037] Reproducibility is verified by recomputing LicenceBindingHash and comparing against stored LicenceBindingRecord values.
6. Deterministic Replay
[0038] Replay recomputes LicenceBindingHash using stored ConstrainedOutputRef, LicenceTierVersionId, and LicenceRegistryVersionId.
[0039] Replay does not depend on current system time.
[0040] Distributed nodes operating with identical inputs, identical licence metadata, and identical registry versions produce identical constrained outputs and identical LicenceBindingHash values.
Claims
-
A computer-implemented method for deterministic licence-tier binding without execution control, the method comprising: (a) resolving a licence tier from explicit licence metadata using a deterministic LicenceRegistry lookup and version-bound validation rules, and denying processing in a fail-closed manner if licence metadata is invalid or absent; (b) retrieving a version-bound LicenceTierDefinition from a versioned immutable LicenceRegistry, the LicenceTierDefinition defining permitted output scopes, access constraints, output visibility limitations, and feature activation parameters; (c) applying licence-tier output constraints statically to admissible determination outputs prior to delivery by restricting accessible artefacts, limiting presentation scope, and enforcing output filtering rules according to the LicenceTierDefinition, without altering core protocol logic or asserting runtime execution control; (d) computing a LicenceBindingHash as H(ConstrainedOutputRef || LicenceTierVersionId || LicenceRegistryVersionId); (e) generating a LicenceBindingRecord binding LicenceTierIdentifier, LicenceTierVersionId, LicenceRegistryVersionId, LicenceBindingHash, and a timestamp recorded as data, and appending it to an immutable store; and (f) producing identical constrained outputs across distributed nodes given identical input artefacts, identical licence metadata, and identical LicenceRegistry versions.
-
The method of claim 1 wherein LicenceRegistry entries are versioned and immutable once published.
-
The method of claim 1 wherein a deterministic rejection record identifying invalid or absent licence metadata is appended to the immutable store upon processing denial.
-
The method of claim 1 wherein replay recomputes LicenceBindingHash using stored fields and does not depend on current system time.
-
The method of claim 1 wherein licence-tier binding does not modify core protocol logic, interrupt execution mid-process, or contact remote authorisation services.
-
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 licence-tier binding system without execution control is disclosed. Licence metadata is resolved deterministically against a versioned immutable LicenceRegistry, and processing is denied in a fail-closed manner if metadata is invalid or absent. A version-bound LicenceTierDefinition is retrieved and applied statically to constrain admissible determination outputs by restricting accessible artefacts, limiting presentation scope, and enforcing output filtering rules without altering core protocol logic or asserting runtime enforcement. A LicenceBindingHash is computed as H(ConstrainedOutputRef || LicenceTierVersionId || LicenceRegistryVersionId) and a LicenceBindingRecord is appended to an immutable store. Replay uses stored fields and does not depend on current system time. Identical inputs, licence metadata, and registry versions produce reproducible constrained outputs across distributed nodes.