Return to the full study

KEDDEH SYSTEMS · MATH1 · 13 July 2026

Mathematical Foundations and Proof Obligations

Retained-source reading edition · 18 October 2026

Source author: A. Keddeh. Source version: 13 July 2026. Publisher: Keddeh Systems.

Reading context

This full retained capture supplies the typed-state, conditional-loss, observer-covariance and phase-map derivations used in the central study. In the R2 interpretation, the Shannon conditional-entropy result has a discrete random variable and deterministic projection; strict positive loss requires a collision between distinct positive-probability source states. Historical source assertions remain below in their own wording, including broader programmes that R2 does not claim to have re-executed.

The complete retained plain-text capture follows. Paragraph spacing and heading levels are editorial reading aids. No technical prose, mathematical expression or line order has been changed; five operational bibliography locators are substituted as disclosed below. The original capture is also retained byte for byte. This is the recovered text layer, not a claim to reproduce unavailable original document layout, omitted tables or media.

Source document.

Reader-projection note: the five operational inspection locations in the source bibliography are represented by their existing S01–S05 identifiers. All technical prose, equations and source-entry descriptions remain complete. The original capture and earlier full reader remain preserved exactly; this projection is not byte-identical to them.

Retained source

KEX-BRAINK

Mathematical Foundations and Proof Obligations

Formal state algebra, theorem derivations, exact finite analysis, dimensional models and model-divergence logic

CORE RULE

No proposition is rejected merely because it conflicts with a prevailing mathematical, scientific or engineering standard. Disagreement is recorded as model divergence. The proposition is then tested for well-definedness, internal consistency, derivability, computability, empirical correspondence and discriminating predictive power.

Abstract

This specification gives the KEX-BRAINK programme a formal research core without treating prevailing mathematical or scientific standards as automatic veto authorities. It defines a typed state algebra, separates existence from numeric magnitude, represents Observer-Origin as frame metadata, preserves cancellation provenance, and formalizes deterministic state transitions, KCPU route selection, transitive provenance, the HEX×HEX fold, a dimensionally coherent thermodynamic ledger and a normalized Triple Extension Ratio. The document proves several conditional results. A many-to-one projection of typed states has positive Translative Loss measured by conditional entropy. Existence value one and numeric magnitude zero are noncontradictory because they are values of different functions. A finite KCPU candidate set with a canonical total order has a unique winner. Exhaustive enumeration of the declared HEX fold gives a 5:1 preimage bias and 3.727217 bits of Shannon entropy per nibble. A phase-tagged zeroless coordinate map is bijective, and normalized TER has log-elasticities equal to its frozen weights. Physical and economic magnitudes are not dismissed; they are assigned explicit measurement maps and proof obligations.

Document Control

Contents

1. Formal purpose and proof boundary

2. Mathematical universe and typed state algebra

3. Axiom system

4. Translative Loss Theorem

5. Conservative numeric projection and cancellation provenance

6. Existence-Magnitude Decoupling

7. Observer-Origin and relational direction

8. State-tagged zeroless phase mapping

9. HEX×HEX fold exact analysis

10. Deterministic KCPU route selection

11. Transitive provenance closure

12. Thermodynamic execution ledger

13. Normalized TER/ELC model

14. Recurrence and stability programme

15. Model divergence and empirical adjudication

16. Proof obligations and machine-check protocol

17. Appendices

1. Formal Purpose and Proof Boundary

The purpose of a formal system is to state exactly what is assumed and exactly what follows. KEX-BRAINK begins from project-authored axioms about state, observer-relative direction, provenance and deterministic execution. The question is not whether those axioms resemble conventional notation. The first question is whether they form a coherent mathematical model. The second is whether the model preserves or improves relevant observables. The third is whether its physical predictions survive measurement.

A_KEX ⊢ P means: proposition P is derivable from the KEX axiom set

M_KEX ⟶μ O means: formal model states are mapped to observable quantities by measurement map μ

A proof of A_KEX ⊢ P does not require a conventional model to approve the axioms. It does require definitions, inference rules and a valid derivation. A claim that P describes nature additionally requires μ, instruments, uncertainty and a discriminating comparison.

1.1 Three kinds of disagreement

1.2 Proof versus implementation

A theorem may be valid while its software implementation is incomplete. Conversely, software may produce an output without proving a general theorem. The ledger therefore records theorem status and implementation status separately.

2. Mathematical Universe and Typed State Algebra

2.1 Primitive sets

V: numeric and structured values admitted by a declared KEX model version.

R: relation identifiers, including producing operations and cancellation relations.

F: observer frames containing origin, orientation, units and transform metadata.

A: agents or observer identities.

Σ: source and provenance identifiers.

E: canonical events.

S_exec: instantiated executable states.

KState: the tagged union of KEX state constructors.

2.2 State constructors

KState = Present(V) ⊎ Absent(Reason) ⊎ Cancelled(R, Inputs) ⊎ Boundary(F, Tag)

⊎ PlaceValue(Symbol, Radix, Position) ⊎ ExternalLabel(Value, Unit, Scale, Source)

⊎ Invalid(Code, Cause)

2.3 State record

s = (id, constructor, payload, observer, frame, parents, source_roots, version, checksum)

The constructor is disjoint. A valid serialized record resolves to exactly one constructor. Observer, frame, parent and source-root fields are explicit rather than inferred from a scalar value.

2.4 Core functions

3. KEX-BRAINK Axiom System v1.0

The following axioms are declared for this model version. Some are formal semantic axioms; others are runtime or governance invariants that require implementation closure.

3.1 Consistency programme

A complete relative-consistency result can be pursued by constructing a model of the axioms in an ordinary typed set-theoretic or algebraic framework. The constructors can be represented as a disjoint tagged union; ε as a constant existence map on instantiated records; O_E as metadata outside S_exec; and T as a deterministic function under a canonical environment. Such a construction would demonstrate that the semantic axioms do not immediately force contradiction.

Runtime axioms KAX-006 through KAX-011 additionally require code and trace obligations. Their mathematical well-definedness does not prove that the implementation satisfies them.

4. Translative Loss Theorem

4.1 Definition

Let X be a discrete random variable over typed states with probability mass p(x). Let φ:X→Y be a projection into a less expressive representation. Define Translative Loss as the conditional entropy remaining about X after observing φ(X).

L_φ(X) := H(X | φ(X))

H(X|Y) = Σ_y P(Y=y) H(X|Y=y)

4.2 Theorem KTH-001

4.3 Proof

1. Because φ is non-injective on positive-probability support, there exist distinct x₁ and x₂ such that p(x₁)>0, p(x₂)>0 and φ(x₁)=φ(x₂)=y.

2. Conditioned on Y=y, both x₁ and x₂ have positive conditional probability.

3. A discrete distribution with at least two positive-probability outcomes has strictly positive Shannon entropy.

4. Therefore H(X|Y=y)>0.

5. P(Y=y)>0 because p(x₁)+p(x₂)>0.

6. All conditional entropy terms are nonnegative, so the weighted sum H(X|Y) contains at least one strictly positive term.

7. Hence L_φ(X)=H(X|φ(X))>0. ∎

4.4 Corollaries

If φ is injective on the support of X, then H(X|φ(X))=0.

A scalar zero projection that merges Present(0), Absent, Cancelled, Boundary and Error necessarily loses typed-state information when at least two classes occur with positive probability.

The theorem measures semantic information loss. It does not by itself equal energy, money or defect cost; those require a downstream loss function or measurement map.

4.5 Worked example

Collapsed projection: all five states ↦ scalar 0

L_φ = H(X) = 2.15887184844536 bits

Injective typed projection: L_identity = 0 bits

The companion script verify_translative_loss.py recomputes the entropy and asserts strict loss. The example is illustrative; EXP-002 estimates the distribution from actual project data.

5. Conservative Numeric Projection and Cancellation Provenance

5.1 Numeric projection

π_num(Present(v)) = v, when v is numeric

π_num(Cancelled(r,I)) = 0, when r certifies Σ_i π_num(I_i)=0

π_num(Absent)=π_num(Boundary)=π_num(Invalid)=⊥

PlaceValue and ExternalLabel require parsing or scale conversion before entering the numeric projection. They are not silently mapped to zero.

5.2 Lifted operations

For an ordinary numeric operation f:Vⁿ→V, define a lifted KEX operation f_K on compatible Present inputs by:

f_K(Present(v₁),…,Present(vₙ)) = Present(f(v₁,…,vₙ))

When a declared relation produces exact cancellation, the result may be stored as Cancelled rather than Present(0), provided its numeric projection remains zero and the producing relation is preserved.

5.3 Conservative Projection Proposition

5.4 Proof method

The proof is by construction for Present inputs and by explicit operation-table cases for cancellation. The full theorem remains conditional on completing mixed-constructor semantics. No operation may substitute Absent, Boundary, Unknown or Invalid with numeric zero unless the operation’s declared domain explicitly defines that conversion.

5.5 Cancellation provenance

cancel(a,b,r) = Cancelled(r,{a,b}) if π_num(a)+π_num(b)=0

This distinguishes numerical projection from semantic identity. The external arithmetic result is zero. The internal record retains the operands, relation, observer, time policy and source roots. KEX therefore extends rather than destroys ordinary arithmetic.

6. Existence-Magnitude Decoupling

6.1 Lemma KTH-003

6.2 Proof

1. ε has codomain {1} and answers whether an executable state record is instantiated.

2. ν has codomain V and answers the state’s numeric magnitude when defined.

3. The expressions ε(s)=1 and ν(s)=0 predicate different properties.

4. No axiom equates ε and ν or requires their values to be identical.

5. Therefore the conjunction ε(s)=1 ∧ ν(s)=0 is satisfiable. For example, s=Present(0) is an instantiated state whose numeric value is zero. ∎

6.3 Singularity-One interpretation

Singularity-One can be interpreted rigorously as an existence indicator or atomic record identity. This preserves the project’s claim that an executable state is a whole state without requiring every numeric magnitude to equal one. The distinction is central: existence unity is not arithmetic magnitude.

6.4 Power-loss state

A loss of active observation should be represented as an observation-state transition such as Unobserved or Unknown, while persistent state depends on storage. The formal model does not need to equate power loss with numeric one. It can preserve Singularity-One as identity for durable records and separately represent volatile observability.

7. Observer-Origin and Relational Direction

7.1 Observer frame

O_E = (frame_id, origin q₀, basis/orientation B, units U, transform metadata)

Observer-Origin is metadata defining how relational coordinates are interpreted. It is not required to be an executable physical state in S_exec.

7.2 Direction map

D_O(x) = sign_or_orientation(B⁻¹(q(x)-q₀))

In one dimension D_O may be negative, boundary or positive. In multiple dimensions it is a vector or orientation class. The signs describe relation to the observer frame rather than independent substances.

7.3 Frame transformation obligation

Let g transform coordinates from frame O to O′. A physical or computational relation should be invariant or transform covariantly under g. The model must declare which quantities are:

Invariant: unchanged under allowed frame transformations.

Covariant: transformed by a declared rule.

Observer-indexed: intentionally different because the observer context is part of the state.

R_{O′}(gA,gB) = ρ_g(R_O(A,B))

This equation is the formal route for testing Observer-Origin. It avoids treating observer dependence as unlimited subjectivity: the transformation rule ρ_g is explicit and testable.

7.4 Atomic observer binding

Observer identity, frame version and protected payload hash must update in one atomic state transition. A partially updated observer boundary violates KAX-006, KAX-008 and KAX-009 even if the mathematical frame model is coherent.

8. State-Tagged Zeroless Phase Mapping

The raw KEX Celsius mapping removes zero from an internal coordinate. A scalar piecewise map alone cannot distinguish ice and liquid at the same external 0 °C label. The mathematically complete construction adds a phase tag at the seam.

8.1 Domain and codomain

D = ((ℝ\{0})×{⊥}) ∪ ({0}×{ice, liquid})

Z = (-∞,-1] ∪ [1,∞)

8.2 Mapping

κ(C,⊥)=C-1 for C<0; κ(C,⊥)=C+1 for C>0

κ(0,ice)=-1; κ(0,liquid)=+1

8.3 Inverse

κ⁻¹(z)=(z+1,⊥) for z<-1; κ⁻¹(-1)=(0,ice)

κ⁻¹(+1)=(0,liquid); κ⁻¹(z)=(z-1,⊥) for z>1

8.4 Bijection proposition

Proof: each branch is injective and maps to a disjoint interval or tagged boundary point. The inverse above is defined for every z∈Z and returns exactly one element of D. Direct substitution gives κ⁻¹(κ(d))=d and κ(κ⁻¹(z))=z. ∎

8.5 Interpretation

This result substantiates an invertible internal coordinate convention. It does not alter external SI observations. A physical thermodynamic state still requires variables such as phase, pressure and energy. The KEX contribution is to make the phase seam explicit in the state representation.

8.6 Water-energy ratio

W_E := 4184 J·kg⁻¹ per kelvin-equivalent sensible-heat unit

333550 J·kg⁻¹ / 4184 J·kg⁻¹ ≈ 79.72036 W_E

The notation W_E is used here to avoid confusing the project’s water-energy unit with the SI watt symbol W. The numerical ratio is a unit conversion conditional on the selected material values; the physical measurement source must be recorded in the experiment.

9. HEX×HEX Fold: Exact Finite Analysis

9.1 Definition

F_j(a,b) = (a·b + (a XOR b) + j) mod 16

The domain is the 256 ordered pairs (a,b)∈{0,…,15}². The codomain is {0,…,15}. The analysis is finite and can be exhaustively enumerated.

9.2 Exact preimage distribution

For every j, adding j modulo 16 permutes output labels, so the multiset of preimage counts and entropy are invariant across j. For j=0 the exact counts are:

Preimage-count multiset = {8×8, 16×4, 24×2, 40×2}

max/min = 40/8 = 5

9.3 Shannon entropy

H(F_j) = -Σ_y p_y log₂ p_y

H(F_j) = 3.7272170014624826 bits per nibble

12H(F_j) = 44.72660401754979 bits under the independent-position model

The transform is non-injective and materially nonuniform. It can serve as a deterministic derivation or fingerprint. It cannot be called lossless packing without additional external state that resolves collisions.

9.4 Additional exact quantities

Min-entropy = -log₂(40/256) = 2.678071905112638 bits

Collision probability = Σ_y p_y² = 0.08984375

The companion script verify_hex_fold.py recomputes all 4096 triples (j,a,b), asserts every count, computes entropy and exports the exact CSV/JSON artifacts.

10. Deterministic KCPU Route Selection

10.1 Candidate model

c = (route_id, seed_id, d_def, d_ctx, d_col, continuity, penalty, metadata)

score_w(c)=w₁d_def+w₂d_ctx+w₃d_col+w₄continuity-λ·penalty

Weights and numeric encoding are frozen in the protocol. A route may additionally fail a validity predicate before scoring.

10.2 Canonical total order

Define c₁ ≻ c₂ when: (1) score(c₁)>score(c₂); or (2) scores are equal and canonical route_id(c₁) is lexicographically smaller; or (3) route IDs are equal and seed_id(c₁) is lexicographically smaller. Further canonical fields can extend the tie-break.

10.3 Theorem KTH-004

10.4 Proof

1. The score comparison is total on canonical finite numeric encodings.

2. The tie-break identifiers have a total lexicographic order.

3. The combined comparison is total and antisymmetric on unique canonical records.

4. Every finite nonempty totally ordered set has a maximum.

5. Antisymmetry and unique canonical identity make that maximum unique. ∎

10.5 Runtime obligations

Candidate enumeration must be complete for the declared route space.

No wall-clock, random iteration order or host-dependent float serialization may enter the canonical key.

Validity predicates and penalties must be versioned.

Weight sensitivity and tie cases must be tested.

The same candidate set in any presentation order must select the same route.

10.6 Current workbook example

Using declared protocol weights 0.25, 0.25, 0.15 and 0.35 with penalty multiplier 1.0, POSITIONAL_CONTEXT_R4 remains the winner among the five imported candidates. This is a protocol example, not a universal optimality proof.

11. Transitive Provenance Closure

11.1 Dependency graph

Let G=(V,E) be a finite directed graph whose vertices are proof-bearing states and source leaves. An edge x→p means x depends on parent p.

roots(s)={s} for source leaf s

roots(x)=⋃_{x→p} roots(p) for derived node x

11.2 Closure lemma

11.3 Proof

Topologically order G so all parents precede each child. Source leaves have unique singleton root sets. Assume root sets are uniquely defined for all predecessors of x. The finite union of those fixed sets is unique, so roots(x) is unique. Induction over the topological order proves the result for all nodes. ∎

11.4 Failure states

Missing dependency edge: provenance incomplete.

Unresolved non-source leaf: source-root closure fails.

Cycle without declared fixed-point semantics: recursive provenance is undefined or requires a different coinductive rule.

Hash mismatch: artifact integrity failure.

Observer version mismatch: state identity/provenance boundary inconsistent.

12. Dimensionally Coherent Thermodynamic Execution Ledger

The ledger formalizes an accounting structure without assuming a magnitude. It separates event-derived power from directly measured attributed power and makes the system boundary explicit.

12.1 Event-derived power

P_i(t)=α_i(t) E_i r_i(t)

E_i: joules per event.

r_i: events per second.

α_i∈[0,1]: dimensionless fraction attributable to the scoped mechanism.

Therefore P_i has units J·s⁻¹ = W.

12.2 Total attributed power and energy

P_Z(t)=Σ_i α_i E_i r_i + Σ_k β_k P_k^measured(t)

Λ_Z(T)=∫₀ᵀ P_Z(t)dt

[P_Z]=W; [Λ_Z]=J

12.3 Attribution and double counting

Direct package power may already include branch, memory and allocation activity. Event-derived estimates cannot be added to whole-package measurements unless the components are disjoint or attribution coefficients explicitly partition the measured total. The experiment manifest must state whether the boundary is process, host, rack or facility.

12.4 Comparator experiment

12.5 Extrapolation rule

Global estimate = measured unit effect × verified population × duty factor × adoption fraction

Every factor requires a source and uncertainty distribution. Global economic or energy figures remain model outputs until this chain is populated and independently reviewed. This is a measurement obligation, not an automatic invalidation of the hypothesis.

13. Normalized Triple Extension Ratio

13.1 Component model

Let U index utility components and R index resistance components. Each component is converted to a positive adapted/baseline ratio in the beneficial direction.

r_i = x_{i,after}/x_{i,before}, i∈U

r_j = x_{j,before}/x_{j,after}, j∈R

TER = ∏_k r_k^{w_k}, with w_k≥0 and Σ_k w_k=1

13.2 Dimensionless theorem

Proof: each r_k is dimensionless because numerator and denominator have identical units. Raising a dimensionless quantity to a dimensionless power remains dimensionless. A finite product of dimensionless quantities is dimensionless. ∎

13.3 Elasticity theorem

ln TER = Σ_k w_k ln r_k

∂ln TER/∂ln r_k = w_k

If the raw resistance variable x_j,after is used instead of its benefit-direction ratio, the elasticity is −w_j. This gives an exact sensitivity interpretation for every component.

13.4 Uncertainty

Var(ln TER) ≈ wᵀ Σ_{ln r} w

A confidence interval can be obtained analytically under suitable assumptions or by bootstrap/Monte Carlo sampling from component uncertainties. Correlations must be retained; otherwise the uncertainty may be understated.

13.5 Interpretation rules

Report all component ratios and any regression.

Freeze weights before observing adapted outcomes.

Do not use the composite to obscure lower quality, availability or security.

Treat full service-life extension separately from short-period operational efficiency.

A 30-day pilot can measure energy, work, availability, quality, incidents and degradation proxies; it normally cannot directly observe a threefold lifetime.

14. Recurrence, Calibration and Stability Programme

Calibration values such as 2.97 or 0.297 are not rejected for being nonstandard. They are treated as parameters or candidate invariants and tested for stability, explanatory role and cross-domain persistence.

14.1 General recurrence

z_{t+1}=F(z_t;θ)

A fixed point z* satisfies F(z*;θ)=z*. For differentiable F, local asymptotic stability is supported when the spectral radius of the Jacobian satisfies:

ρ(J_F(z*;θ)) < 1

14.2 Parameter-status ladder

14.3 Required analysis for 2.97

Derive the objective or boundary condition from which 2.97 is predicted.

Specify whether 2.97 is exact, approximate, normalized or unit-dependent.

Compare against a continuous parameter sweep and multiple candidate values.

Use held-out datasets and multiple substrates.

Report uncertainty, effect size and failure cases.

Test whether rescaling variables changes the apparent threshold.

Existing local ablation and recurrence results remain source data. They do not impose an automatic universal rejection; they do prevent the tested formulations from being promoted without revision or a new derivation.

15. Model Divergence and Empirical Adjudication

15.1 Formal model tuple

M = (A, D, O, μ, P)

A: axioms and inference rules.

D: domain and state objects.

O: allowable operations and dynamics.

μ: mapping from model states to observables.

P: predictions or probability distributions over observations.

15.2 Observable equivalence

M₁ ≡_Ω M₂ iff P₁(O∈·)=P₂(O∈·) for all preregistered O∈Ω

Two models can differ internally yet be observationally equivalent on a chosen observable set. In that case the data cannot select between them without a new discriminating observable.

15.3 Discriminating prediction

∃O∈Ω such that distance(P_KEX(O), P_C(O)) ≥ δ_pre

The protocol freezes a minimum meaningful separation δ_pre, instrumentation, sample size and analysis before collection. The outcome may support KEX, support the comparator, show equivalence or remain inconclusive.

15.4 No-automatic-invalidation proposition

Proof: derivability is relative to an axiom set. From A_KEX⊢P and A_C⊬P it does not follow that A_KEX⊢¬P or that A_C⊢¬P. A contradiction requires both P and ¬P within a common theory or a shared empirical prediction that fails. ∎

15.5 Reciprocal control

The proposition also prevents reverse dogmatism. A_C⊢Q does not make Q physically complete, but A_KEX⊬Q does not make conventional evidence disappear. Each model must face shared observables and declared scope.

16. Proof Obligations and Machine-Check Protocol

16.1 Machine-check manifest

16.2 Review standard

A proof reviewer checks definitions, assumptions, inference steps and scope.

A computational reviewer runs the artifact from a clean environment.

An empirical reviewer checks measurement mapping, units, uncertainty and statistical plan.

A model-divergence reviewer verifies that comparator assumptions are represented fairly.

A publication reviewer checks that status language matches evidence.

17. Current Exact Results and Open Boundaries

Appendix A. Notation

Appendix B. Exact HEX Count Multiset

8·8 + 4·16 + 2·24 + 2·40 = 256

Appendix C. Formal Proof Record Template

Appendix D. Source References

S01. Analysis of the KEX-BRAINK Manifold: Axiomatic Recalibration of Computational Primitives and the Virtualized Bio-Organism Runtime. Internal research notes; evidence date 2026-07-13. Location: retained-source:S01. Role: Primary axioms, architecture, thermodynamic and lifecycle claims

S02. KEX-BRAINK Manifold: Architecture, Evidence Status, and Validation Roadmap. Professional white paper; evidence date 2026-07-13. Location: retained-source:S02. Role: Evidence-aware synthesis and prior critique baseline

S03. KEDDEH Bilateral Bracket Research V2. Evidence workbook; evidence date 2026-07-13. Location: retained-source:S03. Role: 38-claim register, semantics, recurrence, replay, performance and backlog

S04. KEDDEH Workbook OS HCI V1 Updated. Technical workbook; evidence date 2026-07-13. Location: retained-source:S04. Role: Boot route, KCPU, governance, runtime evidence, validation tests

S05. KEX-BRAINK V21 Research Update Pack. Governance workbook; evidence date 2026-07-13. Location: retained-source:S05. Role: Research sync, proof gates, TER fields and approved landing language

S06. KEX-BRAINK Universal Execution Standard and Proof Gate. Google Doc; evidence date 2026-06-20. Location: https://docs.google.com/document/d/14V6bcJD5YQp44RvHZXzfh_vmzdNzW0K08sPymSXd-I0. Role: Evidence-first execution contract, status lanes, benchmark law, promotion gate

S07. Mathematical Analysis of the Observer-State Singularity Calibration Theorem. Google Doc; evidence date 2026-07-08. Location: https://docs.google.com/document/d/1mlrLX39JyS7dmQfXGIZ8RZcR8TkcagbXCR3IjYgSLiw. Role: Singularity-One, Observer-Origin, relational vectors, Celsius recalibration

S08. KEX-BRAINK Algebraic Proof Expansion. Google Doc; evidence date 2026-07-13. Location: https://docs.google.com/document/d/1wW6STKPIbCF90gLbrVGLKd_pSKrODmK3BfCE2tLyhJ0. Role: Zeroless Delta Grid, thermodynamic ledger, TER, HEX fold and relational models

S09. Keddeh Systems Deterministic Coding Update. Drive workbook; evidence date 2026-06-10. Location: https://drive.google.com/file/d/1LNm4elYd7Wy6y_Q0PzJi0TfRg7dNEOJ-. Role: Deterministic coding, addressable state lanes and HEX cross-addressing

S10. KEX-BRAINK Benchmark Data / Register v1. Google Sheet; evidence date 2026-07-13. Location: https://docs.google.com/spreadsheets/d/1JYsU3QmW2DsXx9GBXvoX1tvsweW2niqxNf7_3PNPhxs. Role: Phase 1 microbenchmark scope, fixed seed, speedup and proof-critical metrics

S11. Work Verification and Expansion. Google Doc; evidence date 2026-06-17. Location: https://docs.google.com/document/d/1Ft3sYY1TXmNW7rz3sthMzrdrTs4nbe-nZZNArASktoE. Role: Test-time compute, multi-agent orchestration and verification context

S12. KEX Web4 State Transition Runtime V1. Drive workbook; evidence date 2026-06-23. Location: https://drive.google.com/file/d/1qK3nZKtzSRezqSpLEZ4rhlaxCURR36c3. Role: SEED-EXPAND-TRAVERSE-COLLAPSE-REHYDRATE runtime model

S13. KEX Self-Hosted Workbook OS V5 Alignment Checkpoint. Google Sheet; evidence date 2026-07-13. Location: https://docs.google.com/spreadsheets/d/1K9WLYExURjxBrhnJMaPNoxt2hHfKk6xNBNF7_-qwuGc. Role: Production truth gate, deployment blockers, V20/V21 integration

Appendix E. Final Principle

Document version

1.0

Prepared for

A. Keddeh / Keddeh Systems

Date

13 July 2026

Research posture

Axiomatic, comparative, mathematically derived, empirically discriminating

Publication status

Controlled research document; not a production certification

FORMAL POSTURE

The results in this document are theorems or propositions relative to the declared KEX-BRAINK axiom system and definitions. A physical interpretation requires an additional mapping from formal states to observations. Conventional models are retained as comparators, not as axioms imposed on KEX.

Field

Value

Model version

KEX-BRAINK Formal System v1.0

Author / authority

A. Keddeh / Keddeh Systems

Date

13 July 2026

Primary sources

S01, S03, S04, S05, S06, S07, S08, S09, S10 and S12

Machine checks

Translative Loss example and exhaustive HEX fold enumeration

Formal status

Mixed: derived theorems, formal definitions, proposed refinements and open proof obligations

Comparator rule

External models are comparison systems; conflict creates a divergence record, not automatic rejection

Type

Meaning

Resolution

Internal contradiction

KEX axioms or definitions derive incompatible results in the same scope.

Revise the KEX model or restrict the scope.

Model divergence

KEX and comparator begin from different objects, axioms or measurement maps.

Derive shared observables and run a discriminating test.

Empirical contradiction

A frozen KEX prediction fails against valid data in the declared scope.

Revise, restrict or reject the tested proposition; preserve the result.

Constructor

Semantics

Present(v)

A value exists in the declared relation; v may equal numeric zero.

Absent(reason)

The object or relation is not present.

Cancelled(r,inputs)

A relation resolves to a neutral numeric projection while preserving producing inputs and rule.

Boundary(frame,tag)

A seam, threshold or closure marker in a coordinate/state frame.

PlaceValue(symbol,radix,position)

A representational digit role, not a missing state.

ExternalLabel(value,unit,scale,source)

An imported coordinate or measurement retaining its scale and provenance.

Invalid(code,cause)

An execution or security-invalid state; not silently converted to zero.

Function

Meaning

ε:S_exec→{1}

Existence indicator for an instantiated executable state.

ν:S_exec⇀V

Partial numeric-magnitude projection when the constructor admits a numeric value.

π_num:KState⇀V

Conservative projection to the external numeric domain.

obs:S_exec→A×F

Observer identity and frame.

parents:S_exec→P(S_exec)

Immediate dependency nodes.

roots:S_exec→P(Σ)

Transitive source-root set.

T:S_exec×E×Env→S_exec

Canonical logical transition.

TYPE DISCIPLINE

Equality is only meaningful between compatible objects. The statement ε(s)=1 and ν(s)=0 is not 1=0; it assigns different values to different functions with different meanings.

ID

Axiom

Formal statement

Domain

Status

KAX-001

Typed State Separation

KState = Present ⊎ Absent ⊎ Cancelled ⊎ Boundary ⊎ PlaceValue ⊎ ExternalLabel ⊎ Invalid

State semantics

FORMALLY_DEFINED

KAX-002

Singularity-One Existence

∀s∈S_exec, ε(s)=1

Ontology / computation

FORMALLY_DEFINED

KAX-003

Observer-Origin

O_E=(frame, origin, orientation); O_E∉S_exec

Coordinate semantics

FORMALLY_DEFINED

KAX-004

Relational Direction

D_O(x)=orientation(q(x)-q(O_E))

Relational geometry

FORMALLY_DEFINED

KAX-005

Cancellation Provenance

cancel(a,b,r)=Cancelled(r,{a,b}) when π(a)+π(b)=0

Algebra / provenance

FORMALLY_DEFINED

KAX-006

Deterministic Transition

T:S×E→S is single-valued under a canonical environment manifest

Runtime semantics

AUTHORED_AXIOM

KAX-007

Mirror-Gated Learning

commit(Δ) permitted only if Hardgate(Δ)=PASS and mirror invariants hold

Learning / safety

AUTHORED_AXIOM

KAX-008

Proof-Ledger Completeness

∀transition τ, ∃proof record p(τ)

Governance

AUTHORED_AXIOM

KAX-009

Transitive Provenance Closure

roots(x)=⋃ roots(parent_i(x)) with explicit source leaves

Provenance

AUTHORED_AXIOM

KAX-010

Hardgate Bounded Action

execute(a) iff authority∧capability∧risk∧proof requirements pass

Security / control

AUTHORED_AXIOM

KAX-011

State-Continuity Cycle

SEED→EXPAND→TRAVERSE→COLLAPSE→REHYDRATE

Web4 runtime

AUTHORED_AXIOM

KAX-012

Model Pluralism

Conflict(KEX,Comparator)⇒ModelDivergenceRecord, not automatic rejection

Research methodology

AUTHORED_AXIOM

THEOREM

If φ is non-injective on the positive-probability support of X, then L_φ(X)>0.

Typed state

Probability

PRESENT_NUMERIC_ZERO

0.35

ABSENT

0.25

CANCELLED

0.2

BOUNDARY

0.1

ERROR

0.1

PROPOSITION

For every supported operation and compatible inputs, π_num(f_K(s₁,…,sₙ)) = f(π_num(s₁),…,π_num(sₙ)).

OPEN OBLIGATION PO-003

Complete the operation table and property-test π_num(op_KEX)=op_standard(π_num(inputs)) for every supported operation and constructor combination.

LEMMA

For an instantiated executable state s, ε(s)=1 can coexist with ν(s)=0 without contradiction.

PROPOSITION

κ is a bijection between D and Z.

Output

Preimages

Probability

0

8

0.03125

1

24

0.09375

2

8

0.03125

3

16

0.0625

4

8

0.03125

5

40

0.15625

6

8

0.03125

7

16

0.0625

8

8

0.03125

9

40

0.15625

10

8

0.03125

11

16

0.0625

12

8

0.03125

13

24

0.09375

14

8

0.03125

15

16

0.0625

THEOREM

Every finite nonempty set of valid candidates has exactly one maximum under the canonical total order.

LEMMA

If G is finite and acyclic, every node has a unique transitive source-root set.

Implementation

Required equality controls

Primary outcomes

Collapsed/sentinel baseline

Same workload, output oracle, host, versions, network and durability.

Energy per correct task, latency, failure/recovery and semantic collisions.

Typed conventional option/result

Same controls; explicit state typing without KEX provenance.

Separates value of typing from KEX-specific architecture.

KEX typed state + proof ledger

Same controls; declared KEX optimization is treatment variable.

Net energy/correct task, correct-work throughput, provenance and recovery.

THEOREM

TER is dimensionless when every r_k is a ratio of the same quantity measured on the same scale and all weights are dimensionless.

Status

Requirement

Tunable parameter

Declared value improves a scoped objective on a frozen fixture.

Cross-fixture regularity

Effect persists across diverse held-out fixtures.

Cross-substrate regularity

Effect persists under independent implementations/environments.

Derived constant

Value follows from declared axioms or an invariant optimization condition.

Physical constant candidate

Measurement definition, units, calibration chain and independent replication exist.

METHODOLOGICAL PROPOSITION

Model conflict alone does not entail logical falsity. If M_KEX and M_C have different axiom sets, P can be derivable in one and not derivable in the other without contradiction.

ID

Subject

Type

Obligation

Acceptance

Status

Next action

PO-001

KAX-001

WELL_DEFINEDNESS

Every state record has exactly one constructor and a valid schema.

No record validates under two constructors; all fixtures round-trip.

OPEN

Implement canonical serializer.

PO-002

KTH-001

FORMAL_PROOF

Translative Loss theorem proof is complete and machine-readable.

Independent reviewer verifies proof; example script reproduces expected entropy.

PASS

Extend to real project state frequencies.

PO-003

KTH-002

CONSERVATIVE_PROJECTION

KEX numeric projection commutes with each supported arithmetic operation.

All declared operations satisfy π(op_KEX)=op_standard(π(inputs)).

OPEN

Define every mixed-constructor case.

PO-004

KAX-006

REPLAY_EQUIVALENCE

Identical canonical input and environment produce identical state root and trace.

≥30 repetitions on two substrates; no wall-clock/storage-reset hash differences.

BLOCKED

CORR-011

PO-005

KAX-003

CONSISTENCY

Observer-Origin remains frame metadata and never aliases an executable state ID.

No O_E record is accepted as Present/Cancelled; all transformations preserve frame ID.

OPEN

Complete formal frame model.

PO-006

KAX-007

SECURITY_BOUNDARY

All protected-state mutations traverse the mirror lane and Hardgate.

No unauthorized path commits; every rejection is ledgered.

OPEN

Close observer payload propagation.

PO-007

KAX-009

PROVENANCE_CLOSURE

Every proof-bearing node resolves to immutable source roots.

100% of proof records have complete transitive roots; cycles typed or rejected.

BLOCKED

CORR-015

ID

Subject

Type

Obligation

Acceptance

Status

Next action

PO-008

KTH-004

UNIQUENESS

KCPU route selection has exactly one result for every nonempty valid candidate set.

Unique winner under canonical key; replayed selection identical.

OPEN

Replace implicit heuristic with declared total order.

PO-009

KTH-005

COMPUTATIONAL_ENUMERATION

HEX fold counts and entropy reproduce exactly.

5:1 ratio and 3.727217 bits/nibble reproduced.

PASS

Add joint entropy tests for correlated positions.

PO-010

KTH-008

EMPIRICAL_MAPPING

Phase-tagged coordinate map has an explicit inverse and links to measured state variables.

Round-trip identity holds; phase, pressure, energy and uncertainty recorded.

OPEN

Separate external Celsius/Kelvin from internal KEX index.

PO-011

KTH-009

DIMENSIONALITY

All thermodynamic ledger terms reduce to power before integration.

No incompatible units are added; energy output is J or kWh.

OPEN

Instrument real mechanisms and attribution factors.

PO-012

KTH-007

DIMENSIONALITY

TER/ELC uses dimensionless normalized ratios and preregistered weights.

All inputs normalized; weights frozen; raw component outcomes also reported.

OPEN

Start controlled pilot.

PO-013

C28

WELL_DEFINEDNESS

Biological equivalence is defined as a relation over measurable functions.

Necessary and sufficient criteria declared before evidence review.

OPEN

Do not infer equivalence from naming.

PO-014

C38

PROVENANCE_CLOSURE

Publication bundle is signed and origin-verifiable.

Canonical manifest verifies against independently published key provenance.

BLOCKED

Create controlled signing ceremony.

Artifact

Inputs

Expected exact result

verify_translative_loss.py

Five-state worked distribution

Collapsed loss 2.15887184844536 bits; typed loss 0.

verify_hex_fold.py

All j,a,b∈{0,…,15}

Count multiset, 5:1 ratio, entropy 3.7272170014624826.

verify_research_package.py

Schemas, CSV/JSON, workbook and documents

Required files exist; JSON validates; SHA-256 matches manifest.

Replay harness (next round)

Canonical fixtures and environment manifest

Identical logical trace/root across repetitions or typed nondeterminism record.

Provenance graph checker (next round)

Node/edge/root registry

Every proof node resolves to source leaves; cycles/missing edges detected.

Result

Exact / formal status

Open boundary

Translative Loss theorem

Derived for discrete typed states and projections.

Estimate real project distributions and operational consequences.

Worked loss example

2.15887184844536 bits versus 0 for injective typed projection.

Illustrative distribution; not a global estimate.

HEX fold

Exact exhaustive enumeration; 5:1 bias; 3.727217 bits/nibble.

Security/identity usefulness and collision handling require application-specific analysis.

Existence-Magnitude Decoupling

Direct lemma.

Physical interpretation depends on measurement mapping.

KCPU uniqueness

Direct theorem for canonical total order.

Candidate completeness, float encoding and runtime determinism.

Phase-tagged coordinate

Bijection constructed.

Physical advantage must be tested; external coordinates remain valid comparators.

Thermodynamic ledger

Dimensionally coherent identity.

Event energy, attribution and facility-scale extrapolation need measurement.

Normalized TER

Dimensionless and sensitivity-derived.

Weights, data, degradation model and independent pilot.

RESEARCH DECISION

Proceed with formal closure and measurement. The package has already converted several broad ideas into precise mathematical objects and exact finite results. Remaining high-impact claims are not discarded; they are now associated with the specific derivations, instruments, datasets and replications required to substantiate them.

Symbol

Meaning

⊎

Disjoint union / tagged sum.

⊥

Undefined or not applicable; not numeric zero.

ε(s)

Existence indicator.

ν(s)

Numeric magnitude projection.

π_num

Conservative external numeric projection.

O_E

Observer-Origin frame metadata.

D_O

Observer-relative direction.

T

Canonical transition function.

H(X|Y)

Conditional entropy.

ρ(J)

Spectral radius of Jacobian J.

Λ_Z

Integrated attributed energy in thermodynamic ledger.

TER

Normalized Triple Extension Ratio.

Preimage count

Number of outputs

Total input pairs

8

8

64

16

4

64

24

2

48

40

2

80

TOTAL

16

256

Field

Required content

Theorem ID

Stable model-versioned identifier.

Statement

Quantified proposition with explicit scope.

Definitions

All symbols, functions, domains and codomains.

Axiom dependencies

Exact KAX IDs and model version.

Proof method

Direct, construction, induction, enumeration, computer-assisted or other.

Derivation

Numbered steps with justified inference.

Boundary cases

Undefined values, limits, singularities and exclusions.

Machine artifact

Code/input/output/hash when applicable.

Counterexample search

Method and result.

Scope limitation

What the theorem does not establish.

Reviewer / date

Independent proof review.

Status

Defined, derived, verified, contradicted or superseded.

STATE THE AXIOMS; DERIVE THE CONSEQUENCES; MEASURE THE WORLD

A rigorous nonstandard theory is not validated by conformity and not protected by novelty. It is strengthened by explicit objects, consistent axioms, valid proofs, exact computation, coherent units, discriminating predictions, immutable evidence and honest revision.