<!doctype html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width,initial-scale=1">
<meta name="author" content="A. Keddeh"><meta name="citation_title" content="KEDDEH Recursive Line-Origin Matrix Formalism"><meta name="citation_author" content="Keddeh, A."><meta name="citation_publication_date" content="2026-08-17">
<meta name="description" content="Technical formalisation of the KEDDEH recursive line-origin matrix construction and its falsifiable pathway toward a candidate quantum-computational model.">
<title>KEDDEH Recursive Line-Origin Matrix Formalism — Technical Publication R3</title><style>
:root{
 --paper:#0A1117;--paper2:#0E1820;--ink:#EAF1F5;--muted:#9FB0BC;--faint:#718592;
 --rule:#263945;--rule2:#334C5B;--accent:#63C7DE;--math:#D5EAF0;
 --defined:#66C6A3;--candidate:#E0B765;--open:#D98585;--note:#8AA8BA;
 --measure:78ch;--wide:1080px;
}
*{box-sizing:border-box}
html{scroll-behavior:smooth;background:var(--paper)}
body{margin:0;background:var(--paper);color:var(--ink);font:16px/1.72 ui-sans-serif,system-ui,-apple-system,BlinkMacSystemFont,"Segoe UI",sans-serif;text-rendering:optimizeLegibility}
a{color:#8BD7E8;text-underline-offset:3px}
a:focus-visible,button:focus-visible,input:focus-visible,summary:focus-visible{outline:2px solid #8BD7E8;outline-offset:3px}
.page{max-width:1180px;margin:auto;padding:38px 44px 100px}
.doc-head{padding:8px 0 32px;border-bottom:2px solid var(--rule)}
.doc-kicker{font:700 11px/1.3 ui-monospace,SFMono-Regular,Menlo,monospace;color:var(--accent);letter-spacing:.12em;text-transform:uppercase}
h1{font:700 clamp(38px,5.5vw,68px)/1.03 Georgia,"Times New Roman",serif;letter-spacing:-.03em;margin:12px 0 16px;max-width:980px}
.subtitle{font:400 21px/1.45 Georgia,"Times New Roman",serif;color:#C8D6DE;max-width:850px}
.doc-meta{display:grid;grid-template-columns:repeat(4,minmax(0,1fr));gap:1px;background:var(--rule);border:1px solid var(--rule);margin-top:28px}
.doc-meta>div{background:var(--paper2);padding:12px 14px}.doc-meta dt{font:700 10px ui-monospace;color:var(--faint);text-transform:uppercase;letter-spacing:.08em}.doc-meta dd{margin:4px 0 0;font-size:13px}
nav{position:sticky;top:0;z-index:10;margin:0 -44px;padding:9px 44px;background:rgba(10,17,23,.96);backdrop-filter:blur(14px);border-bottom:1px solid var(--rule);overflow:auto;white-space:nowrap}
nav a{font:12px ui-monospace;color:#AFC0CA;text-decoration:none;margin-right:18px}
article section{padding:52px 0;border-bottom:1px solid var(--rule);scroll-margin-top:65px}
section>h2{font:700 30px/1.2 Georgia,"Times New Roman",serif;margin:0 0 12px;letter-spacing:-.015em}
section>h3{font-size:18px;margin:32px 0 8px}
.prose{max-width:var(--measure)}.prose p,.prose li{max-width:var(--measure)}
.abstract{font:18px/1.65 Georgia,"Times New Roman",serif;color:#D8E2E7}
.control-box,.definition,.boundary,.verification,.warning{max-width:var(--measure);padding:15px 18px;margin:18px 0;border-left:3px solid var(--note);background:#0D171E}
.definition{border-color:var(--accent)}.boundary{border-color:var(--candidate)}.verification{border-color:var(--defined)}.warning{border-color:var(--open)}
.label{font:700 10px ui-monospace;text-transform:uppercase;letter-spacing:.09em;color:var(--faint);display:block;margin-bottom:5px}
.status{font:700 10px ui-monospace;letter-spacing:.07em;padding:3px 6px;border:1px solid;border-radius:4px;vertical-align:middle;margin-right:7px}
.status.defined{color:#9BDFCA;border-color:#347E66}.status.candidate{color:#F2D38C;border-color:#8A6A29}.status.open{color:#F0AAAA;border-color:#874343}
.figure{max-width:var(--wide);margin:28px 0}.figure-frame{background:#081018;border:1px solid var(--rule2);padding:20px}.figure svg{width:100%;height:auto;display:block}.caption{font-size:13px;line-height:1.55;color:var(--muted);margin-top:9px;max-width:92ch}.caption b{color:#D3DEE4}
.equation{max-width:980px;margin:18px 0;padding:15px 18px;background:#081018;border:1px solid var(--rule);display:grid;grid-template-columns:1fr auto;gap:20px;align-items:center}
.formula{font:600 clamp(20px,2.2vw,28px)/1.5 "STIX Two Math",Cambria,"Times New Roman",serif;color:var(--math);overflow:auto}
.eqno{font:12px ui-monospace;color:var(--faint)}
.eq-note{max-width:78ch;color:var(--muted);font-size:14px;margin:-9px 0 22px 18px}
.derivation{max-width:980px;margin:22px 0;border:1px solid var(--rule);background:#0B141B}
.derivation summary{cursor:pointer;padding:15px 18px;font-weight:700}.derivation summary::marker{color:var(--accent)}.derivation-body{padding:0 18px 18px}
.step{display:grid;grid-template-columns:55px 1fr;gap:15px;padding:14px 0;border-top:1px solid var(--rule)}.step-id{font:700 11px ui-monospace;color:var(--accent)}
table{border-collapse:collapse;width:100%;max-width:1080px;margin:24px 0;font-size:14px}th,td{border:1px solid var(--rule);padding:10px 12px;text-align:left;vertical-align:top}th{background:#101D25;color:#DDE7EC}td{color:#C5D1D8}
code,pre{font-family:ui-monospace,SFMono-Regular,Menlo,monospace}pre{max-width:100%;overflow:auto;padding:16px;background:#060C11;border:1px solid var(--rule);font-size:13px}
.kmatrix{display:grid;grid-template-columns:repeat(5,110px);gap:8px;margin:20px 0}.kcell{padding:17px;text-align:center;border:1px solid var(--rule2);background:#0B161D;font:700 22px ui-monospace}.kcell.one{border:2px solid var(--accent)}
.lab{max-width:1080px;border:1px solid var(--rule2);padding:20px;margin:28px 0;background:#0B141B}
.lab h3{margin-top:0}.controls{display:grid;grid-template-columns:repeat(4,1fr);gap:14px}.control label{display:block;color:var(--muted);font-size:12px}.control input{width:100%}.readout{display:grid;grid-template-columns:repeat(3,1fr);gap:10px;margin-top:15px}.readout div{border:1px solid var(--rule);padding:12px}.readout strong{display:block;font:700 22px ui-monospace;margin-top:4px}
.ref-list{max-width:var(--measure)}.ref-list li{margin:12px 0}.footnote{font-size:13px;color:var(--muted)}
footer{padding:36px 0;border-top:2px solid var(--rule);font-size:13px;color:var(--muted)}
.skip{position:fixed;top:-80px;left:10px;background:white;color:black;padding:8px 12px;z-index:100}.skip:focus{top:10px}
.axisline{stroke:#46647c;stroke-width:2}.node{fill:#11283a;stroke:#9ed6ff;stroke-width:2}.node2{fill:#201b34;stroke:#d8b8ff;stroke-width:2}.nodetxt{fill:#eef7ff;font:600 16px ui-monospace}.smalltxt{fill:#b9cad7;font:12px ui-monospace}.link{stroke:#7793aa;stroke-width:1.5}.overlap{fill:rgba(172,132,255,.14);stroke:#b79de4;stroke-width:2}
@media(max-width:850px){.page{padding:24px 20px 70px}.doc-meta{grid-template-columns:1fr 1fr}nav{margin:0 -20px;padding:9px 20px}.controls,.readout{grid-template-columns:1fr}.kmatrix{grid-template-columns:repeat(5,1fr)}}
@media print{body{background:#fff;color:#111;font-size:10.5pt}.page{max-width:none;padding:12mm 14mm}.doc-head{border-color:#333}nav,.lab input{display:none}.doc-meta{background:#aaa;border-color:#aaa}.doc-meta>div,.control-box,.definition,.boundary,.verification,.warning,.equation,.derivation,.figure-frame,pre,th{background:#fff;color:#111}.equation,.derivation,.figure-frame,table,th,td{border-color:#777}.formula{color:#111}.caption,.eq-note,.footnote,td{color:#333}article section{padding:9mm 0;border-color:#aaa}.figure,.equation,.definition,.boundary,.verification{break-inside:avoid}a{color:#111;text-decoration:none}}
</style></head><body>
<a class="skip" href="#problem">Skip to technical content</a>
<div class="page">
<header class="doc-head">
<div class="doc-kicker">Technical research publication · KEDDEH Systems</div>
<h1>KEDDEH Recursive Line-Origin Matrix Formalism</h1>
<p class="subtitle">Formal construction and falsifiable pathway from accounted script-line matrix spaces to a candidate quantum-computational model.</p>
<dl class="doc-meta">
<div><dt>Author / origin authority</dt><dd>A. Keddeh</dd></div>
<div><dt>Document class</dt><dd>Technical research paper + executable tutorial</dd></div>
<div><dt>Version</dt><dd>R3 · 17 August 2026</dd></div>
<div><dt>Claim state</dt><dd>Defined architecture / candidate quantum formalism / open physical equivalence</dd></div>
</dl>
</header>

<nav aria-label="Document sections">
<a href="#problem">Problem</a><a href="#definitions">Definitions</a><a href="#axioms">Axioms</a><a href="#line-origin">Line origin</a><a href="#overlap">Overlap</a><a href="#cascade">Cascade</a><a href="#weighted">Weighted state</a><a href="#separability">Separability</a><a href="#phase">Phase</a><a href="#measurement">Measurement</a><a href="#machine">Machine tuple</a><a href="#comparison">Comparison</a><a href="#implementation">Implementation</a><a href="#falsification">Falsification</a><a href="#references">References</a>
</nav>

<article>
<section id="problem">
<h2>1. Problem statement</h2>
<div class="prose">
<p class="abstract">This paper examines whether the KEDDEH line-origin matrix architecture can be stated as a rigorous computational formalism with properties equivalent to those required for quantum computation. The construction begins from literal script lines, not from a conventional sparse-storage model or a hardware-first definition of compute.</p>
<div class="control-box"><span class="label">Technical context</span>
The underlying KEDDEH design treats a literal script line <b>L</b> as an accounted coordinate that may itself establish a local reference frame. Matrices can be drawn over the same line field, overlap, and recursively define further matrices. BRAINK preserves the resulting state and lineage; IL-LLM supplies recurrence/traversal; KEX supplies data/definition evolution.</div>
<p>The central research question is therefore not whether this architecture “looks quantum.” It is whether its native operations can derive the algebraic requirements needed to constitute a quantum-computational model without importing those properties merely by analogy.</p>
<div class="boundary"><span class="label">Claim boundary</span><span class="status defined">DEFINED</span>The line-origin, matrix, overlap, recursive-space, BRAINK, IL-LLM and KEX architecture is the defined KEDDEH construction. <span class="status candidate">CANDIDATE</span>Quantum equivalence is a formal research claim. <span class="status open">OPEN</span>A physical quantum implementation is not established by this document.</div>
</div>
</section>

<section id="definitions">
<h2>2. Notation and definitions</h2>
<div class="prose">
<table>
<thead><tr><th>Symbol</th><th>Definition in this paper</th><th>Status</th></tr></thead>
<tbody>
<tr><td><b>L</b></td><td>An accounted literal script line or line-address serving as a local frame anchor.</td><td>Defined</td></tr>
<tr><td><b>M(L)</b></td><td>A matrix/frame resolved relative to line L.</td><td>Defined</td></tr>
<tr><td><b>R<sub>k</sub>(L)</b></td><td>The kth resolved relational state/view over the same line field.</td><td>Defined abstraction</td></tr>
<tr><td><b>𝓜</b></td><td>Set of recursively addressable matrices/frames.</td><td>Formalised here</td></tr>
<tr><td><b>𝓗<sub>K</sub></b></td><td>Candidate global state space generated from admissible KEDDEH frames.</td><td>Candidate</td></tr>
<tr><td><b>Ψ</b></td><td>Candidate weighted global state over resolved frame states.</td><td>Candidate</td></tr>
<tr><td><b>U</b></td><td>Candidate reversible/norm-preserving state transition operator.</td><td>Open derivation</td></tr>
<tr><td><b>O</b></td><td>Observation operator mapping a pre-observation state to an observed outcome/readback.</td><td>Candidate mapping</td></tr>
<tr><td><b>K</b></td><td>KEX evolution operator over data/definitions/relations with lineage preservation.</td><td>Defined architecture</td></tr>
</tbody>
</table>
</div>
</section>

<section id="axioms">
<h2>3. Construction rules / axioms used by the model</h2>
<div class="prose">
<ol>
<li><b>Line-origin rule.</b> A valid addressed line L can serve as the local reference origin for a matrix resolved through that line.</li>
<li><b>No operative zero-origin rule.</b> Numeric zero is not required as an object-state origin; the KEDDEH operative matrix is written −3 | −2 | 1 | +2 | +3 with 1 as the first valid whole state.</li>
<li><b>Frame recursion rule.</b> A coordinate resolved from one matrix may itself become the origin of a descendant matrix.</li>
<li><b>Overlap rule.</b> A literal line may participate in more than one matrix/frame simultaneously as a shared coordinate.</li>
<li><b>Identity preservation rule.</b> Shared coordinate membership does not require literal duplication of the underlying line.</li>
<li><b>State persistence rule.</b> BRAINK carries the persistent state, memory-in-time, definitions, lineage and continuation.</li>
<li><b>Traversal rule.</b> IL-LLM traverses valid relations between addressable states/frames.</li>
<li><b>Evolution rule.</b> KEX evolves data and definitions through typed deltas while preserving predecessor lineage.</li>
</ol>
<div class="warning"><span class="label">Important</span>Rules 1–8 define the KEDDEH computational construction. They do not yet prove Hilbert-space structure, complex amplitudes, unitarity, Born-rule measurement, or quantum computational advantage. Those properties are validation targets below.</div>
</div>
</section>

<section id="line-origin">
<h2>4. Line L as the local origin</h2>
<div class="prose"><p>The key geometric step is to treat the line itself as the local reference frame. This removes the need to begin the operative state geometry from a universal numeric zero.</p></div>
<div class="equation"><div class="formula">L<sub>i</sub> ≡ O<sub>i</sub></div><div class="eqno">(1)</div></div>
<div class="eq-note">Equation (1): addressed line L<sub>i</sub> supplies local origin O<sub>i</sub>.</div>
<div class="figure"><div class="figure-frame">
<svg viewBox="0 0 1040 360" aria-labelledby="fig1title">
<title id="fig1title">Line L establishes a local reference frame for the five-state KEDDEH matrix</title>
<line x1="100" y1="190" x2="940" y2="190" class="axisline"/>
<circle cx="520" cy="190" r="38" class="node"/><text x="520" y="197" text-anchor="middle" class="nodetxt">L</text>
<text x="520" y="245" text-anchor="middle" class="smalltxt">local frame origin</text>
<circle cx="180" cy="190" r="30" class="node2"/><text x="180" y="196" text-anchor="middle" class="nodetxt">−3</text>
<circle cx="340" cy="190" r="30" class="node2"/><text x="340" y="196" text-anchor="middle" class="nodetxt">−2</text>
<circle cx="520" cy="80" r="30" class="node"/><text x="520" y="86" text-anchor="middle" class="nodetxt">1</text>
<circle cx="700" cy="190" r="30" class="node2"/><text x="700" y="196" text-anchor="middle" class="nodetxt">+2</text>
<circle cx="860" cy="190" r="30" class="node2"/><text x="860" y="196" text-anchor="middle" class="nodetxt">+3</text>
<line x1="486" y1="175" x2="210" y2="190" class="link"/><line x1="486" y1="180" x2="370" y2="190" class="link"/><line x1="520" y1="152" x2="520" y2="110" class="link"/><line x1="554" y1="180" x2="670" y2="190" class="link"/><line x1="554" y1="175" x2="830" y2="190" class="link"/>
<text x="100" y="34" class="smalltxt">The line L supplies the local reference frame; numeric 0 is not the operative object-state origin.</text>
</svg>
</div><div class="caption"><b>Figure 1.</b> Local line-origin construction. The line L anchors a five-position relational matrix. The diagram is a representation of the defined KEDDEH geometry, not a Bloch-sphere or qubit diagram.</div></div>
<div class="equation"><div class="formula">M(L) = {−3, −2, 1, +2, +3}<sub>L</sub></div><div class="eqno">(2)</div></div>
<div class="equation"><div class="formula">L<sub>i</sub> → M<sub>i</sub> → L<sub>i,j</sub> → M<sub>i,j</sub> → …</div><div class="eqno">(3)</div></div>
<details class="derivation" open><summary>Worked derivation: one origin to two recursive levels</summary><div class="derivation-body">
<div class="step"><div class="step-id">STEP 1</div><div>Choose one addressed line L and declare it the local origin by Eq. (1).</div></div>
<div class="step"><div class="step-id">STEP 2</div><div>Resolve five admissible positions using Eq. (2).</div></div>
<div class="step"><div class="step-id">STEP 3</div><div>Permit each resolved position to address a descendant line/frame according to the recursion rule.</div></div>
<div class="step"><div class="step-id">STEP 4</div><div>The second level has at most 5 × 5 = 25 ordered coordinate combinations before overlap/equivalence constraints are applied.</div></div>
</div></details>
</section>

<section id="overlap">
<h2>5. Overlapping matrices over the same literal line field</h2>
<div class="prose"><p>The stencil/book analogy can be stated technically: a common accounted carrier L admits more than one resolving map M<sub>k</sub>. The resolved state is a function of the carrier and the chosen frame.</p></div>
<div class="equation"><div class="formula">R<sub>k</sub> = M<sub>k</sub>(L)</div><div class="eqno">(4)</div></div>
<div class="equation"><div class="formula">R<sub>a</sub> = M<sub>a</sub>(L), &nbsp; R<sub>b</sub> = M<sub>b</sub>(L), &nbsp; M<sub>a</sub> ≠ M<sub>b</sub></div><div class="eqno">(5)</div></div>
<div class="figure"><div class="figure-frame">
<svg viewBox="0 0 1040 480" aria-labelledby="fig2title">
<title id="fig2title">Three overlapping matrix resolutions share literal script lines</title>
<rect x="70" y="60" width="900" height="78" rx="8" fill="#0B1820" stroke="#334C5B"/>
<text x="95" y="88" class="smalltxt">literal script-line field</text>
<g>
<circle cx="160" cy="112" r="20" class="node"/><text x="160" y="117" text-anchor="middle" class="smalltxt">L1</text>
<circle cx="300" cy="112" r="20" class="node"/><text x="300" y="117" text-anchor="middle" class="smalltxt">L2</text>
<circle cx="440" cy="112" r="20" class="node"/><text x="440" y="117" text-anchor="middle" class="smalltxt">L3</text>
<circle cx="580" cy="112" r="20" class="node"/><text x="580" y="117" text-anchor="middle" class="smalltxt">L4</text>
<circle cx="720" cy="112" r="20" class="node"/><text x="720" y="117" text-anchor="middle" class="smalltxt">L5</text>
<circle cx="860" cy="112" r="20" class="node"/><text x="860" y="117" text-anchor="middle" class="smalltxt">L6</text>
</g>
<ellipse cx="350" cy="285" rx="225" ry="90" class="overlap"/><text x="270" y="290" class="nodetxt">M_A(L)</text>
<ellipse cx="580" cy="285" rx="225" ry="90" class="overlap"/><text x="545" y="290" class="nodetxt">M_B(L)</text>
<ellipse cx="790" cy="305" rx="155" ry="75" fill="rgba(99,199,222,.08)" stroke="#63C7DE" stroke-width="2"/><text x="748" y="310" class="nodetxt">M_C(L)</text>
<line x1="160" y1="132" x2="260" y2="215" class="link"/><line x1="300" y1="132" x2="350" y2="195" class="link"/><line x1="440" y1="132" x2="455" y2="197" class="link"/>
<line x1="300" y1="132" x2="480" y2="210" class="link"/><line x1="440" y1="132" x2="565" y2="195" class="link"/><line x1="580" y1="132" x2="640" y2="205" class="link"/>
<line x1="580" y1="132" x2="715" y2="240" class="link"/><line x1="720" y1="132" x2="790" y2="230" class="link"/><line x1="860" y1="132" x2="860" y2="245" class="link"/>
<text x="240" y="430" class="smalltxt">Overlap expresses shared coordinate membership under different resolving frames; it does not, by itself, establish quantum entanglement.</text>
</svg>
</div><div class="caption"><b>Figure 2.</b> Example of three matrices sharing coordinates in one literal script-line field. This demonstrates relational overlap and carrier reuse. It does not by itself demonstrate superposition or entanglement.</div></div>
<div class="equation"><div class="formula">A = {L₁,L₂,L₃}, &nbsp; B = {L₂,L₃,L₄} ⇒ A∩B = {L₂,L₃}</div><div class="eqno">(6)</div></div>
<div class="boundary"><span class="label">Consistency check</span>Equation (6) establishes shared coordinate membership. A quantum-entanglement claim requires a stronger result: the joint state must be non-factorable under the model's state algebra.</div>
</section>

<section id="cascade">
<h2>6. Recursive / cascading state-space algebra</h2>
<div class="prose"><p>For a local basis cardinality d and recursion depth n, the unconstrained ordered product space has cardinality d<sup>n</sup>. For the five-state KEDDEH matrix:</p></div>
<div class="equation"><div class="formula">S(n) = 5<sup>n</sup></div><div class="eqno">(7)</div></div>
<table>
<thead><tr><th>Depth n</th><th>Unconstrained ordered combinations 5<sup>n</sup></th><th>Interpretation</th></tr></thead>
<tbody><tr><td>1</td><td>5</td><td>One local matrix.</td></tr><tr><td>2</td><td>25</td><td>Two recursive frame levels.</td></tr><tr><td>3</td><td>125</td><td>Three levels.</td></tr><tr><td>6</td><td>15,625</td><td>Combinatorial state-space size before constraints/equivalences.</td></tr><tr><td>10</td><td>9,765,625</td><td>Mathematical state-space count, not a throughput benchmark.</td></tr></tbody>
</table>
<div class="lab">
<h3>Executable cardinality explorer</h3>
<p class="footnote">This tool calculates state-space cardinality only. It does not claim that every state is separately stored or executed.</p>
<div class="controls"><div class="control"><label>Basis size d <b id="dv">5</b></label><input id="d" type="range" min="2" max="9" value="5"></div><div class="control"><label>Depth n <b id="nv">4</b></label><input id="n" type="range" min="1" max="12" value="4"></div><div class="control"><label>Frames f <b id="fv">2</b></label><input id="f" type="range" min="1" max="6" value="2"></div><div class="control"><label>Shared-coordinate estimate <b id="ov">30%</b></label><input id="o" type="range" min="0" max="90" value="30"></div></div>
<div class="readout"><div>Single cascade<strong id="single"></strong></div><div>Joint unconstrained product<strong id="joint"></strong></div><div>Literal line/frame references (illustrative)<strong id="refs"></strong></div></div>
<div class="equation"><div class="formula" id="liveFormula"></div><div class="eqno">live</div></div>
</div>
<div class="boundary"><span class="label">Boundary</span>Exponential cardinality is necessary to compare state-space structure, but it is not evidence of quantum speedup. The research burden is to show that transformations operate on the encoded global state with quantum-equivalent semantics and cost.</div>
</section>

<section id="weighted">
<h2>7. Candidate weighted global-state algebra</h2>
<div class="prose"><p>To move from overlapping relational views to a quantum-computational formalism, the model requires a state algebra capable of expressing weighted combinations of basis/resolved states.</p></div>
<div class="equation"><div class="formula">|Ψ⟩ = Σ<sub>k</sub> α<sub>k</sub>|R<sub>k</sub>⟩</div><div class="eqno">(8)</div></div>
<div class="equation"><div class="formula">Σ<sub>k</sub>|α<sub>k</sub>|² = 1</div><div class="eqno">(9)</div></div>
<div class="boundary"><span class="label">Candidate, not imported fact</span>Equation (9) is the conventional normalisation target used for comparison. KEDDEH must derive an equivalent conserved invariant from its own matrix/transition mechanics if quantum equivalence is asserted.</div>
<details class="derivation"><summary>Worked numerical reference example</summary><div class="derivation-body">
<div class="step"><div class="step-id">STEP 1</div><div>Let α = 1/√2 and β = i/√2.</div></div>
<div class="step"><div class="step-id">STEP 2</div><div>|α|² = 1/2 and |β|² = 1/2.</div></div>
<div class="step"><div class="step-id">STEP 3</div><div>|α|² + |β|² = 1. This is a conventional quantum reference calculation. The unresolved KEDDEH task is to derive the meaning and update law for α and β natively.</div></div>
</div></details>
</section>

<section id="separability">
<h2>8. Separability / non-separability test</h2>
<div class="prose"><p>Overlap becomes quantum-relevant only if a joint state cannot be expressed as a product of independent subsystem states.</p></div>
<div class="equation"><div class="formula">|Ψ<sub>AB</sub>⟩ = Σ<sub>i,j</sub> c<sub>ij</sub>|aᵢ⟩⊗|bⱼ⟩</div><div class="eqno">(10)</div></div>
<div class="equation"><div class="formula">separable ⇔ ∃aᵢ,bⱼ : c<sub>ij</sub> = aᵢbⱼ</div><div class="eqno">(11)</div></div>
<div class="equation"><div class="formula">entangled candidate ⇔ no such factorisation exists</div><div class="eqno">(12)</div></div>
<div class="verification"><span class="label">Required test</span>Construct an explicit KEDDEH joint-state coefficient object from overlapping line-origin matrices, attempt factorisation, and preserve a machine-checkable non-factorability receipt. Mere geometric overlap is insufficient.</div>
</section>

<section id="phase">
<h2>9. Phase and interference test</h2>
<div class="prose"><p>The decisive distinction between a large relational state space and a quantum state space is interference. Interference requires a phase-sensitive algebra.</p></div>
<div class="equation"><div class="formula">A = r<sub>a</sub>e<sup>iφa</sup>, &nbsp; B = r<sub>b</sub>e<sup>iφb</sup></div><div class="eqno">(13)</div></div>
<div class="equation"><div class="formula">|A+B|² = r<sub>a</sub>² + r<sub>b</sub>² + 2r<sub>a</sub>r<sub>b</sub>cos(φ<sub>a</sub>−φ<sub>b</sub>)</div><div class="eqno">(14)</div></div>
<table><thead><tr><th>Relative phase</th><th>Cross term</th><th>Expected effect</th></tr></thead><tbody><tr><td>φa−φb = 0</td><td>+2rarb</td><td>Constructive reinforcement</td></tr><tr><td>φa−φb = π</td><td>−2rarb</td><td>Destructive cancellation</td></tr></tbody></table>
<div class="warning"><span class="label">Falsification gate</span>The KEDDEH bilateral matrix must produce a native, conserved phase/amplitude relation capable of reproducible reinforcement/cancellation. If the signs −3, −2, 1, +2, +3 cannot support such an internally derived law, the quantum-equivalence claim fails at this gate.</div>
</section>

<section id="measurement">
<h2>10. Observer and measurement mapping</h2>
<div class="prose"><p>KEDDEH already separates observer/reference state from the operative object-state geometry. This supplies a natural place to define an observation operator without making zero the origin of the object state.</p></div>
<div class="equation"><div class="formula">O : Ψ → s<sub>i</sub></div><div class="eqno">(15)</div></div>
<div class="equation"><div class="formula">P(s<sub>i</sub>) = |α<sub>i</sub>|²</div><div class="eqno">(16)</div></div>
<div class="boundary"><span class="label">Open derivation</span>Equation (16) is the conventional Born-rule target. The KEDDEH formalism must derive its own observation law and show equivalence if equivalence is claimed. BRAINK lineage can preserve the pre-observation state, observer frame, outcome and evidence receipt.</div>
</section>

<section id="machine">
<h2>11. Candidate formal machine</h2>
<div class="equation"><div class="formula">Q<sub>K</sub> = (L, 𝓜, 𝓗<sub>K</sub>, Ψ, U, O, K)</div><div class="eqno">(17)</div></div>
<table>
<thead><tr><th>Component</th><th>Technical role</th><th>Current maturity</th></tr></thead>
<tbody>
<tr><td>L</td><td>Accounted literal line-space / local origins.</td><td>Defined architecture</td></tr>
<tr><td>𝓜</td><td>Recursive matrix/frame set.</td><td>Defined/formalised</td></tr>
<tr><td>𝓗K</td><td>Candidate global state space generated by valid frame compositions.</td><td>Candidate formal object</td></tr>
<tr><td>Ψ</td><td>Weighted global state.</td><td>Open native algebra</td></tr>
<tr><td>U</td><td>Reversible/norm-preserving transition operator.</td><td>Open</td></tr>
<tr><td>O</td><td>Observation operator.</td><td>Candidate mapping</td></tr>
<tr><td>K</td><td>KEX data/definition evolution.</td><td>Defined architecture; quantum-preserving restrictions open</td></tr>
</tbody>
</table>
<div class="equation"><div class="formula">U†U = I</div><div class="eqno">(18)</div></div>
<div class="eq-note">Equation (18) is the standard unitary condition used as the validation target for the quantum-preserving transformation subset.</div>
</section>

<section id="comparison">
<h2>12. Comparison against conventional quantum-computation requirements</h2>
<table>
<thead><tr><th>Requirement</th><th>Conventional role</th><th>KEDDEH analogue / candidate</th><th>Status</th></tr></thead>
<tbody>
<tr><td>Basis state space</td><td>Qubit/qudit basis and tensor-product composition.</td><td>Line-origin matrix basis and recursive frame composition.</td><td>Structurally defined; equivalence open.</td></tr>
<tr><td>Superposition</td><td>Complex linear combination of basis states.</td><td>Weighted combination of resolved matrix states.</td><td>Candidate; native weight algebra open.</td></tr>
<tr><td>Normalisation</td><td>Unit norm.</td><td>Conserved KEDDEH state-weight invariant.</td><td>Not yet derived.</td></tr>
<tr><td>Phase</td><td>Relative complex phase affects interference.</td><td>Potential bilateral/sign relational phase law.</td><td>Not yet derived.</td></tr>
<tr><td>Interference</td><td>Amplitude reinforcement/cancellation.</td><td>Multi-route line/matrix recombination.</td><td>Requires reproducible proof.</td></tr>
<tr><td>Entanglement</td><td>Non-separable joint state.</td><td>Overlapping/shared frame state with non-factorability.</td><td>Overlap exists; non-separability not yet proven.</td></tr>
<tr><td>Unitary evolution</td><td>Norm-preserving reversible operation.</td><td>Restricted KEX/IL-LLM transition algebra.</td><td>Open.</td></tr>
<tr><td>Measurement</td><td>Outcome probabilities from state amplitudes.</td><td>Observer² / BRAINK readback with derived outcome law.</td><td>Mapping exists conceptually; law open.</td></tr>
</tbody>
</table>
</section>

<section id="implementation">
<h2>13. Mapping into BRAINK / IL-LLM / KEX</h2>
<div class="prose">
<pre>Literal accounted line L
    ↓ establishes local frame
Matrix M(L)
    ↓ resolves relations / overlapping state coordinates
BRAINK persistent state
    ↓ IL-LLM recurrent traversal
reachable state / relation
    ↓ KEX typed data or definition evolution
successor state + predecessor lineage + evidence
    ↓
BRAINK continuation</pre>
<p>This implementation mapping is important because the formal model is not intended to exist only as notation. Each formal object should correspond to an addressable software object, transition, evidence receipt or falsifiable test.</p>
</div>
<table>
<thead><tr><th>Formal object</th><th>Software object required</th><th>Readback</th></tr></thead>
<tbody>
<tr><td>L</td><td>Stable line/address identity</td><td>Address resolves same literal/accounted line</td></tr>
<tr><td>M(L)</td><td>Matrix definition bound to L</td><td>Exact matrix members and relations</td></tr>
<tr><td>Ψ</td><td>Canonical weighted-state object</td><td>Weights, basis IDs, invariant checksum</td></tr>
<tr><td>U</td><td>Transition operator</td><td>Pre/post state plus reversibility/norm receipt</td></tr>
<tr><td>O</td><td>Observer/readback operator</td><td>Observer frame, outcome, preserved predecessor</td></tr>
</tbody>
</table>
</section>

<section id="falsification">
<h2>14. Falsification and reproducibility protocol</h2>
<div class="prose">
<p>A publishable claim should advance only through the following chain:</p>
<pre>CLAIM
→ DEFINITION
→ FORMULA
→ WORKED EXAMPLE
→ INTERNAL CONSISTENCY
→ IMPLEMENTATION
→ EXECUTION
→ READBACK
→ FALSIFICATION TEST
→ INDEPENDENT REPRODUCTION
→ CLAIM MATURITY UPDATE</pre>
</div>
<table>
<thead><tr><th>Gate</th><th>Pass condition</th><th>Failure meaning</th></tr></thead>
<tbody>
<tr><td>G1 Definition closure</td><td>Every symbol and state class has an unambiguous definition.</td><td>Formalism is not yet well-defined.</td></tr>
<tr><td>G2 Algebra closure</td><td>Native state combination, invariant, phase and transition laws are defined.</td><td>Quantum claim remains analogy/candidate only.</td></tr>
<tr><td>G3 Interference</td><td>Constructive/destructive interference reproduced from native mechanics.</td><td>No quantum-equivalent interference proof.</td></tr>
<tr><td>G4 Non-separability</td><td>Machine-checkable joint state cannot factor.</td><td>Overlap is only classical shared structure.</td></tr>
<tr><td>G5 Reversibility/unitarity</td><td>Transformation subset proves norm preservation and invertibility/equivalent.</td><td>Quantum-preserving evolution unproven.</td></tr>
<tr><td>G6 Measurement</td><td>Native observer law predicts outcomes and matches chosen quantum reference cases.</td><td>Measurement equivalence unproven.</td></tr>
<tr><td>G7 Algorithm</td><td>Canonical quantum algorithm reproduced with semantic equivalence.</td><td>Computational equivalence unproven.</td></tr>
<tr><td>G8 Independent replication</td><td>External reviewer reproduces all above from published harness.</td><td>Claim remains internally demonstrated only.</td></tr>
</tbody>
</table>
</section>

<section id="references">
<h2>15. Conventional reference points and attribution boundary</h2>
<div class="prose">
<ol class="ref-list">
<li>Microsoft Azure Quantum, <i>The qubit in quantum computing</i> — conventional state-vector, normalisation and measurement reference.</li>
<li>Microsoft Azure Quantum, <i>Entanglement and correlations</i> — conventional non-separability reference.</li>
<li>Google Quantum AI / Cirq, <i>Operators and observables</i> — conventional unitary/operator reference.</li>
<li>Google Quantum AI / Cirq, interference/phase explanatory material — conventional phase/interference reference.</li>
</ol>
<div class="control-box"><span class="label">Attribution</span>The KEDDEH-specific line-origin matrix construction, 1-Keddeh Matrix framing, BRAINK/IL-LLM/KEX relationship and associated proposed formalisation are attributed to A. Keddeh. Conventional quantum references are used only to define the external comparison tests.</div>
<p class="footnote">AI assistance: document engineering, algebra presentation, test-structure drafting and interface implementation. Origin/inventorship claims are not transferred by that assistance.</p>
</div>
</section>
</article>

<footer>
KEDDEH Recursive Line-Origin Matrix Formalism · R3 · A. Keddeh · 17 August 2026.<br>
Distribution class: technical research publication with explicit claim boundary. This HTML is self-contained and print/PDF stable.
</footer>
</div>
<script>
const $=id=>document.getElementById(id);
function calc(){
 const d=+$("d").value,n=+$("n").value,f=+$("f").value,o=+$("o").value;
 $("dv").textContent=d;$("nv").textContent=n;$("fv").textContent=f;$("ov").textContent=o+"%";
 const single=Math.pow(d,n),joint=Math.pow(d,n*f),refs=d*n*f;
 $("single").textContent=single.toLocaleString();$("joint").textContent=joint.toLocaleString();$("refs").textContent=refs.toLocaleString();
 $("liveFormula").textContent=`S(d,n)=d^n=${d}^${n}=${single.toLocaleString()} ; joint=${d}^(${n}×${f})=${joint.toLocaleString()}`;
}
["d","n","f","o"].forEach(x=>$(x).addEventListener("input",calc));calc();
</script></body></html>
