The question
A useful criticism of a relational computing architecture asks what it costs to preserve identity and context. An unhelpful shortcut assumes that preserving them means copying all history into every operation. Those are different designs. The difference matters when assessing KEX, BRAINK and IL-LLM: typed state and addressing, governed execution and evidence, and semantic processing remain linked but independently accountable responsibilities. [1–3]
An observation record should make clear what was observed, by whom or by which instrument, under which definition and conditions. This is a requirement for interpreting the record. It does not imply that an unobserved entity ceases to exist, or that a computer must keep its entire history resident in RAM.
What actually grows
Imagine a million admitted updates. Each update retains one bounded record and two references to earlier records. The graph contains a million event nodes and at most two million predecessor edges. That structural account grows linearly with events, before separately counting payloads, indexes, replication and reference encoding. It is not exponential merely because the graph has a history.
Now change the representation: copy every ancestor inside every new version. A linear history then consumes quadratic cumulative storage across those versions. Enumerating every path through a branching graph can be still more expensive. A fair critique identifies which representation the implementation uses and which variable is increasing. Neither a favorable graph bound nor an unfavorable copying example is a measured result for the native estate.
There is also a hard limit. Arbitrary, indefinitely growing exact history cannot be uniquely reconstructed from a fixed finite store alone. Shared references and lossless compression can improve an encoding; they cannot make missing information recoverable. A digest identifies expected bytes but does not store those bytes.
What can be collected
A projection, a redundant carrier and the last recoverable source are different objects. Removing a view from active memory can leave its source intact. Repacking data can preserve its exact reconstruction. Moving it to an archive can preserve access if retrieval and integrity are actually verified. Removing the final source while keeping only a summary changes the guarantee.
The right question is therefore which roots and dependencies are pinned, which objects may be reconstructed, and for how long. Provenance systems already describe derivation and responsibility, so retaining context alone is not a claim of novelty. The engineering contribution must specify and test how required relationships survive execution, recovery and migration. [4,5]
Where isolation comes from
Separate component names do not create fault isolation. The contract for each operation must state its authority, freshness requirement and dependencies. Some admitted local operations may continue with valid retained dependencies. Others must wait for fresh authority. A missing IL-LLM service need not block every typed-state lookup, but a lookup requiring semantic resolution may depend on it. The decision belongs to a declared operation contract.
A timeout after an external effect must preserve uncertainty until reconciliation. Blind retries can repeat the effect. Ordered history is useful evidence, but it does not alone establish global agreement, current authority or physical success. [2,6]
A portable observation contract
Physical context and logical state can be connected without being collapsed. A sensor reading carries units, time, identity and uncertainty. A host adapter supplies it; a logical policy decides how to use it. An unavailable measurement remains unavailable. Portability then means preserving the logical contract across named adapters while separately qualifying the device-dependent guarantees.
This leads to a sharper research question than whether the architecture is philosophically elegant: can the native implementation preserve required distinctions within measured storage, latency and recovery budgets? The associated white paper proposes the experiments. This discussion reports no new production benchmark or complete theorem proof.
References
[1] A. Keddeh. KEX Algebra and Typed State Research Baseline. KEDDEH-WP-S02-001, editorial E2, 16 October 2026. Internal draft. https://docs.google.com/document/d/1WnuzNoWlUHthjWp27UpqEryS_nJcpFIg3eDfQ4b4Mx0/edit
[2] A. Keddeh. BRAINK Core Runtime Research Baseline. KEDDEH-WP-S01-001, editorial E2, 16 October 2026. Internal draft. https://docs.google.com/document/d/1NcvcgjSwEXHR1Kqnbndxrn5AmPz9RVuEtd382j-yvkg/edit
[3] A. Keddeh. From Observation to Governed Computation. KEDDEH-WP-RELATIONAL-ARCHITECTURE-001 R1, 18 October 2026. Retained research edition, distinct from the journal upload whose bytes remain unverified. https://drive.google.com/file/d/1fkk544NLTkcK9deW74YYxqi0UR6ZpMmP/view
[4] L. Moreau and P. Missier, editors. PROV-DM The PROV Data Model. W3C Recommendation, 30 April 2013. https://www.w3.org/TR/prov-dm/
[5] Git project. git-gc documentation. Accessed 19 October 2026 Adelaide. https://git-scm.com/docs/git-gc
[6] L. Lamport. Time, Clocks, and the Ordering of Events in a Distributed System. Communications of the ACM 21(7), 558–565, 1978. https://www.microsoft.com/en-us/research/publication/time-clocks-ordering-events-distributed-system/
Publication and contribution
Technical discussion draft, 19 October 2026. Related to the separate draft Bounded lineage retention and fault isolation in KEX BRAINK. It does not replace or claim acceptance of journal submission 98. If this discussion is publicly posted, its publication URL and overlap must be disclosed with any related research submission.
Research architecture and direction: Aboudy Keddeh, Systems Architect. AI-assisted analytical development, source synthesis, drafting and layout: OpenAI ChatGPT. The new formal bounds and proposed contracts in this draft require author review; they are not attributed as previously established Keddeh theorems. No independent assessment is claimed.