Return to the full study

KEDDEH SYSTEMS · K-LINE · Library R1

KEDDEH SYSTEMS | RESEARCH AND FORMAL PUBLISHING | ENGINEER · AUTOMATE · SCALE

KEDDEH Recursive Line-Origin Matrix Formalism

Addressed lines, overlapping frames and the quantum research programme

1. Abstract and research purpose

The line-origin construction treats an accounted script line as an addressable anchor for a relational frame. Several matrices can resolve relations over a shared line field, overlap without duplicating the underlying line identities and recursively expose further frames. BRAINK retains state and lineage, IL-LLM supplies traversal, and KEX supplies typed data/definition evolution. The immediate purpose is to make the route from an addressed line to a successor state reconstructible. [LINE §§1–6, 13]

The August R3 paper asks whether that construction can support a computational formalism with the properties required for quantum computation. It develops the question as a dependency chain: define line/frame structure; specify weighted state; establish composition, phase, interference and non-separability; constrain transitions; define observation; then compare an implemented algorithm. Geometric resemblance and exponential counting do not replace those steps. [LINE §§7–14]

This edition presents two time-specific views. R3 supplies the authored construction and candidate comparison equations. Later R14 evidence supplies S29 line/frame operations and separate P15 state-vector processing, with isolated test receipts dated 18 October 2026. Those results advance implementation knowledge without silently turning an August candidate native mapping into a proven one. The paper is part of a linked series: imported definitions apply under their own conditions, and software findings remain distinct from mathematical definitions.

2. Definitions, construction rules and interpretation

2.1 Notation register

The powers d^n and the powers in the conventional complex-state comparison are ordinary powers within those specified models. They are different from the attached relational (+1) groups of Observer Relational Mathematics, whose own parsing rules prohibit an automatic exponentiation interpretation. [LINE §§2, 6–11; ORM §2]

2.2 Eight construction rules

R3 specifies that an addressed line can anchor a local frame; its historical operative matrix is −3 | −2 | 1 | +2 | +3 without requiring numerical zero as the object-state origin; a resolved coordinate can anchor a descendant frame; and one literal line can belong to several frames. Shared membership preserves one underlying line identity. BRAINK carries persistent state, memory-in-time, definitions, lineage and continuation. IL-LLM traverses valid relations. KEX evolves data and definitions through typed deltas retaining predecessor lineage. These are the eight construction rules in source §3.

These rules define the construction. Hilbert-space structure, complex weights, unitarity, a Born-rule observation law and computational advantage have additional definition and evidence obligations in the source.

2.3 Current origin clarification, dated 18 October 2026

The August paper calls L_i a local origin and uses historical 1-based state-role notation. Its formulas remain unchanged below. Current author directions designate the single shared referent with the exact nonnumeric text .1, distinct from numeric 0.1, integer 1, a graph translation or a separate origin on every axis. [CURRENT; STUDY §2.2]

Local frame anchors and that shared referent perform different roles. L1–L12 and descendants such as L1.1 retain their software identities; none is rewritten as .1. Equation (2) remains the historical R3 representation, rather than a current native address codec. This edition does not invent a conversion from those historical labels to .1. The author's definitions and later clarifications take precedence over generic AI reconstruction.

3. Ordered construction: line, frame, overlap and cascade

3.1 One addressed line establishes a frame

$$L_i\equiv O_i$$.
(1) R3's addressed line L_i supplies its local frame origin O_i.

The geometric step anchors resolution to the addressed line rather than beginning the operative object-state geometry at a universal numerical zero. The historical local matrix and recursive chain are:

$$M(L)=\{-3,-2,1,+2,+3{\}}_L$$.
(2)

$$L_i\to M_i\to L_{i,j}\to M_{i,j}\to \dots$$
(3)

Equation (2) retains the August state-role representation under the dated clarification in §2.3. Equation (3) makes the dependency explicit: a resolved line within a matrix can anchor a further frame. The parent is retained; recursive frames are not silently substituted for the shared referent.

Figure 1. R3 places L at the centre and links it to −3 and −2 on the left, 1 above, and +2 and +3 on the right. L is labelled “local frame origin.” The figure's five-position matrix is a representation of the source construction, not a Bloch sphere or qubit diagram. All six labels and their anchor/member roles are retained. The extracted vector has a standalone style/background wrapper; its original geometry and labels are unchanged. The historical 1 is not silently replaced by .1.

The source's worked derivation proceeds in four steps. Choose an addressed line L and declare it the local origin by Equation (1). Resolve five admissible positions under Equation (2). Permit each resolved position to address a descendant line/frame. Two levels then admit at most 5 × 5 = 25 ordered coordinate combinations, before overlap/equivalence constraints. The result is conditional on five choices at each level and the unconstrained ordered-product model. [LINE §4]

3.2 Several resolving frames share one carrier

The stencil/book analogy becomes a statement about one accounted carrier and several resolving maps:

$$R_k=M_k(L)$$.
(4)

$$R_a=M_a(L),R_b=M_b(L),M_a\ne M_b$$.
(5)

A resolved view depends on both the carrier and the selected frame. Different views can share line identities without duplicating them.

Figure 2. R3 shows one field L1–L6 with three overlapping resolving frames. Its connectors give M_A the members L1, L2, L3; M_B the members L2, L3, L4; and M_C the members L4, L5, L6. The diagram illustrates carrier reuse and shared membership. It does not itself represent complex amplitudes, superposition or entanglement.

R3 gives the exact set example:

$$A=\{L\mathrm{₁},L\mathrm{₂},L\mathrm{₃}\},B=\{L\mathrm{₂},L\mathrm{₃},L\mathrm{₄}\}\Rightarrow A\cap B=\{L\mathrm{₂},L\mathrm{₃}\}$$.
(6)

This establishes which line identities participate in both sets. A quantum non-separability claim needs a joint-state algebra and factorization test beyond the intersection. [LINE §5]

3.3 Recursive cardinality and the explorer

For local choice count d and depth n, the unconstrained ordered product has d^n combinations. R3 writes:

$$S(n)=5^n$$.
(7)

The HTML explorer exposes d from 2–9, n from 1–12, f from 1–6 and a shared-coordinate estimate from 0–90%. Its code computes single = d^n, joint = d^(n·f) and illustrative references = d·n·f. At its defaults d=5, n=4 and f=2, those expressions give 625, 390,625 and 40. These default values are editorial arithmetic from the source formulas, not a new browser run.

The shared-coordinate slider updates its displayed percentage, but that value is not used by the calculations. It therefore supplies no overlap-adjusted count. The reference count is illustrative, not measured storage. Exponential cardinality does not establish that every state is stored or executed or that transformations have quantum-equivalent semantics or cost. [LINE §6 and calc()]

4. Candidate state algebra and reference derivations

The equations below preserve R3's quantum-mapping research targets. Conventional calculations provide comparison conditions. Applicability to the line/frame construction requires a declared state and operation mapping, with the conditions under which imported results hold.

4.1 Weighted state and normalization

$$|\Psi ⟩={\Sigma }_k{\alpha }_k|R_k⟩$$.
(8)

$${\Sigma }_k|{\alpha }_k|\mathrm{²}=1$$.
(9)

Equation (8) proposes a weighted combination of resolved states. Equation (9) gives the conventional normalization target. For this reference comparison, the basis states must be orthonormal: each has unit norm and distinct states have zero inner product. This applicability condition follows from expanding the conventional inner-product norm in that basis; shared frame membership alone does not establish it. The reference conventions are described in Azure Quantum's qubit representation and vector/scalar-product definitions. R3 requires an equivalent conserved invariant derived from native matrix/transition mechanics if quantum equivalence is claimed. [LINE §7]

The source's worked reference sets α = 1/√2 and β = i/√2. Their squared magnitudes are 1/2 and 1/2, hence |α|² + |β|² = 1. This is a conventional source-supplied comparison. It is not an editorial native derivation; it demonstrates the condition to meet once the weights and their update laws are specified.

4.2 Joint state and non-separability

$$|{\Psi }_{AB}⟩={\Sigma }_{i,j}{c}_{ij}|aᵢ⟩\otimes |bⱼ⟩$$.
(10)

$$separable\iff \exists aᵢ,bⱼ:c_{ij}=aᵢbⱼ$$.
(11)

$$\text{entangled candidate ⇔ no such factorisation exists}$$.
(12)

Equations (10)–(12) express the conventional pure-state comparison in a specified tensor-product basis of the two subsystems. The coefficient factorization is the product-state criterion for that pure state; it is not the general criterion for mixed-state separability, which uses convex combinations of product density operators. See Azure Quantum's pure-state and mixed-state separability definitions. The ket labels in Equation (10) identify the subsystem basis states. In Equation (11), aᵢ and bⱼ are scalar factor coefficients. R3 reuses letter forms; their roles must remain distinguishable. Its required native experiment is to construct the joint coefficient object from overlapping matrices, attempt factorization and retain a machine-checkable non-factorability receipt. Equation (6)'s shared membership does not accomplish that calculation. [LINE §8]

4.3 Phase and interference

$$A=r_a{e}^{i\phi a},B=r_b{e}^{i\phi b}$$.
(13)

$$|A+B|\mathrm{²}=r_a\mathrm{²}+r_b\mathrm{²}+2r_a{r}_{b}cos({\phi }_a-{\phi }_b)$$.
(14)

For relative phase 0, the cross term is +2r_a r_b and the amplitudes reinforce. For relative phase π, it is −2r_a r_b and interference is destructive. These are R3's conventional reference cases. [LINE §9]

The source's falsification condition is a native conserved phase/amplitude relation reproducing reinforcement and cancellation. The historical bilateral state signs do not establish that law by themselves. This comparison condition does not authorize deleting native relational constituents when a conventional projected amplitude cancels.

4.4 Observation and the formal machine

$$O:\Psi \to s_i$$.
(15)

$$P(s_i)=|{\alpha }_i|\mathrm{²}$$.
(16)

Equation (16) is the conventional Born-rule target. R3 asks for a native observation law and an equivalence argument. BRAINK would retain the pre-observation state, observer frame, outcome and receipt. An unavailable observation remains distinct from a claim that the underlying relation does not exist. [LINE §10; ORM §4]

$$Q_K=(L,𝓜,{𝓗}_K,\Psi ,U,O,K)$$.
(17)

L and 𝓜 carry line/frame structure; 𝓗_K and Ψ supply the candidate weighted state space; U specifies the relevant transition subset; O specifies observation; K supplies typed KEX evolution under the mapping's restrictions. The conventional condition for a unitary transition is:

$$U†U=I$$.
(18)

This condition is not established for arbitrary KEX or IL-LLM operations merely by putting U in the machine tuple. [LINE §11]

5. Linked architecture and implementation contracts

5.1 From addressed line to successor

R3 maps its formal objects through a concrete sequence: L establishes a local frame; M(L) resolves relations and overlap; BRAINK retains state; IL-LLM traverses a reachable relation; KEX performs typed data or definition evolution; successor, predecessor lineage and evidence become BRAINK continuation. [LINE §13]

This formulation uses the KEX S02 distinction between stable subject, typed value, definition revision and storage address. It applies to line/frame objects and transitions. It does not make storage placement a native coordinate or derive complex coefficients. [KEX, Architecture]

The July Mathematical Foundations paper gives an earlier formal frame specification O_E = (frame_id, origin q₀, basis/orientation B, units U, transform metadata) and requires a relation to be invariant, covariant under a declared rule, or explicitly observer-indexed (§7.3). That is a useful linked contract for recording a frame transform. Its July q₀ and historical origin interpretation remain edition-specific; they do not define current .1 or prove the quantum mapping. [MATH1 §§7.1–7.4]

5.2 S29 line/frame implementation, later evidence

The 18 October review identifies LineOriginRuntime in R14_CONVERGED's s29q-runtime. Twelve stable line objects L1–L12 carry origin, children and memberships. M_A contains L1–L5; M_B contains L3–L8; M_C contains L5, L7, L9, L11 and L12. One L5 object belongs to all three. [MECHANISM §2; E-LINE]

inspectLine returns identity, origin, memberships, shared status and children. inspectFrame returns a frame and its members. descend(id,count) creates child references such as L1.1 while preserving the parent and avoiding duplicates. cardinality(d,n,f) returns d^n and d^(n·f). These later sets differ from the small illustrative sets in Equation (6), and retain their own identity.

Four isolated class checks passed: line identity, shared overlap, descent identity and cardinality. The receipt records d=5, n=3, f=2 yielding 125 and 15,625. Broader UI, Web Crypto hashing, embedded R4 iframe, resident invocation and complete host self-test paths were inspected but not invoked by that isolated run. This is evidence for the stated line/frame operations, not quantum throughput.

5.3 P15 state-vector implementation and admission

The R14 carrier separately exposes KEXQuantumResearch in p15-a15-runtime. It represents complex amplitudes, maps K_NEG/K_POS to external basis labels 0/1, normalizes states, forms tensor products, applies matrices and returns measurement outcomes with normalized successors. Its gates are I, X, Z, H, S and CNOT. The constructor rejects empty states and norms below 1e−10. unitary() uses tolerance 1e−9. separable2() tests the squared magnitude of the two-qubit coefficient determinant against 1e−16. [MECHANISM §1; E-QUANTUM]

Individual zero coefficients and an external |0⟩ basis label are valid in this state-vector model; an all-zero vector is rejected. Those are local model rules, not a redefinition of .1. The 2 October Relational State Continuity & Distributed Execution paper already describes this state-vector direction and its phase, tensor, unitary, measurement and non-separability operations as formal simulation. That dated linked formulation prevents the August paper's open native statuses from becoming a blanket assertion that no quantum-state implementation exists. [CONTINUITY §11]

The API separates checking from application. apply() checks dimensions and normalizes its result but does not invoke unitary(). A retained probe applies diag(2,1) to the Hadamard state and obtains probabilities approximately 0.8 and 0.2 while unitary() returns false. A unitary-gate contract must therefore admit finite, well-formed inputs and validate the transition separately. [E-QUANTUM]

A separate software review repeated 9/9 nominal tests and found three adversarial admission failures. A NaN-containing matrix passed the present unitary predicate and produced non-finite norm. measure(-0.1) on K_POS and measure(1) on K_NEG returned zero-probability outcomes instead of rejecting invalid samples. These are implementation boundary findings; they do not invalidate the valid finite-input Bell path or constitute a mathematical refutation. [E-QUANTUM-REVIEW]

5.4 KRS remains a distinct finite control

The inspected KRS branch filters a finite preparation set by observed value and optional frame, lineage, time and synthetic address. It returns DEDUCED_UNIQUE, AMBIGUOUS or NO_ADMISSIBLE_PREPARATION, emitting a counterpart only when all remaining preparations agree. Ten deterministic tests passed, including insertion of a conflict that changes a unique answer to ambiguous. [MECHANISM §4]

This is a finite counterpart-identifiability control, not the P15 state-vector engine, native ZCG codec or demonstrated KRS-to-P15 adapter. Its historical whole_identity=1 fixture is not current .1. Separating these mechanisms makes a future bridge test meaningful instead of presuming integration from shared terminology.

6. Worked evidence, comparison and reproducibility

6.1 Retained Bell calculation

Start with P15's K_NEG. Apply H, tensor with a second K_NEG and apply CNOT. The basis order is 00, 01, 10, 11. The retained probabilities are [0.4999999999999999, 0, 0, 0.4999999999999999] and separable2 returns false. Measurement samples 0.25 and 0.75 select 00 and 11 with normalized one-hot successors. [E-QUANTUM]

The isolated rerun used Node v24.19.0 without document or I/O globals. Its nine checks cover basis normalization, Hadamard probabilities, selected reference-gate unitarity, tensor product, Bell/non-separability, normalized measurement successor, all-zero-vector rejection, non-unitary falsifier and external zero-label retention. The extracted module byte-matches the corresponding original Drive module; the complete carriers differ. This is a small software state-vector result, not a full-browser, physical-processor, air-gap or speedup test.

This later result provides a concrete reference branch. A native line/frame-to-weighted-state assertion additionally needs the transformation linking those objects, its applicability conditions and preserved information. The P15 receipt is not, by itself, that derivation.

6.2 Eight comparison requirements

R3 compares basis/state space and composition, complex superposition, normalization, phase, interference, non-separable joint state, reversible/norm-preserving evolution and an observation probability law. Its corresponding proposals are recursive line/frame composition, weighted resolved states, a conserved state-weight invariant, bilateral/sign phase law, multi-route recombination, non-factorable overlapping-frame state, restricted KEX/IL-LLM transitions and observer/BRAINK readback. [LINE §12]

In August, structure is defined while the native weights, invariant, phase, interference, non-separability, transition restrictions and observation equivalence remain candidate or open. Later continuity, S29 and P15 evidence is reported above under its own scope. No whole-corpus absence follows from an older edition's status.

6.3 Source falsification gates

R3's sequence is claim → definition → formula → worked example → internal consistency → implementation → execution → readback → falsification → independent reproduction → claim-maturity update. [LINE §14] Each stage must cite a linked definition where applicable. A mathematical theorem and a deployed implementation require distinct evidence, and an input-validation failure is not a proof that the underlying mathematics is undefined.

7. Discussion and linked research route

The construction explains carrier reuse, recursive resolution and governed state evolution in a continuous path. Overlap lets several views share one line field. Recursion permits a resolved coordinate to anchor another frame. Lineage makes traversal reconstructible. These architectural properties can be studied independently of quantum equivalence.

Quantum mapping asks a further question about state algebra and the semantics and cost of operations. Equations (8)–(18) articulate its reference requirements, while P15 demonstrates bounded conventional state-vector processing. A bridge result must identify how a native line/frame object supplies the weighted object and how allowed transition and observation preserve that mapping. A linked paper may provide part of that definition; the integration claim must state where it is defined and under which conditions it applies.

Local symbol dictionaries remain essential. ORM's attached relational powers are different from d^n counting and complex-amplitude powers. July frame metadata is different from the current literal .1 designation. Physical solid/liquid phase tags in the foundations series are not interchangeable with complex quantum phase. The series is linked through explicit relations, not through unqualified reuse of a word.

No two-/three-body quadratic procedure is invented here. The later mechanism inspection reports only that it did not recover a complete authored procedure within its inspected set. That bounded retrieval finding cannot establish absence from the full corpus or justify replacing the requested native topic with a generic quadratic formula. [MECHANISM §6]

8. Conclusion, attribution and revision control

R3 defines a recursive line/frame construction and a falsifiable route toward a quantum-computational mapping. Library R1 preserves all eighteen equations, both source diagrams and their explanatory descriptions, the examples and all eight gates, then adds dated implementation evidence and cross-paper applicability notes. The historical source's claim state and later advances remain independently identifiable.

Keddeh-specific line-origin construction, historical 1-Keddeh Matrix framing and BRAINK/IL-LLM/KEX relationships are attributed to Aboudy Keddeh. Conventional quantum references define comparison tests. No new native derivation, inventorship transfer, external approval, physical result or software mutation is asserted.

References and source standing

• [LINE] Aboudy Keddeh. KEDDEH Recursive Line-Origin Matrix Formalism, R3, 17 August 2026, §§1–15. Source. Retained original: 35,041 bytes; SHA-256 f30f67a7dd87b018fe9e14665329bb05bf14695318ea102f11dddf328fbcb57b.
• [CURRENT] Aboudy Keddeh. Current interpretation directions, retained in Observation and Identity Review R3; current at 18 October 2026. Owner-supplied record.
• [ORM] Observer Relational Mathematics, Publication Extension R1, 10 October 2026, §§2, 4–5. Source.
• [KEX] KEX Algebra and Typed State Research Baseline, S02 editorial E2, 16 October 2026, Architecture and mechanism. Source.
• [MATH1] Mathematical Foundations and Proof Obligations, v1.0, 13 July 2026, §§7.1–7.4. Source.
• [CONTINUITY] Relational State Continuity & Distributed Execution, 2 October 2026, §11. Source. Dated source-reported state-vector architecture, distinct from the fresh P15 receipt.
• [MECHANISM] Relational and quantum software: inspected mechanisms and evidence, 18 October 2026, §§1–6. Retained inspection report.
• [E-LINE] Native Host Adapter R14_CONVERGED, S29 LineOriginRuntime; 7 October source and 18 October four-check isolated receipt. Carrier.
• [E-QUANTUM] The same R14 carrier, P15/A15 runtime; isolated nine-check receipt dated 18 October 2026. Module SHA-256 7c00d68f35135504e8a0348611c877ff47208e6d579e0d02160e5cfaf8a2eeca.
• [E-QUANTUM-REVIEW] Separate P15 replay and admission probes, 18 October 2026. Receipt SHA-256 1040a6417f945c4d6f4ca162aaa1dc0973c79574d2ad41c14644d378d5cec575. Nine nominal checks passed; three adversarial admission cases failed.
• [KRS] Keddeh1. KRS finite counterpart reference and Source-Fidelity Audit R4. Branch. Ten-test fixture rerun dated 18 October 2026.
• [STUDY] From Observation to Governed Computation, R1, 18 October 2026; retained study and source register.
• [R3-REFERENCES] Original conventional references: Microsoft Azure Quantum, “The qubit in quantum computing” and “Entanglement and correlations”; Google Quantum AI/Cirq, “Operators and observables” and phase/interference explanatory material. R3 supplies these names without exact URLs or editions. This edition separately verifies the Azure Quantum comparison sources below; the Cirq entries retain their original incomplete metadata.
• [AZURE-QUBIT] Microsoft Learn / Azure Quantum. The qubit in quantum computing, Representing a qubit; updated 21 February 2025, accessed 18 October 2026. Conventional computational-basis/unit-norm reference.
• [AZURE-VECTOR] Microsoft Learn / Azure Quantum. Vectors and matrices in quantum computing, Vectors and Scalar product; updated 16 January 2025, accessed 18 October 2026. Inner-product basis for the explicit orthonormality applicability clarification.
• [AZURE-SEPARABILITY] Microsoft Learn / Azure Quantum. Entanglement and correlations, Separability and quantum entanglement; updated 16 September 2024, accessed 18 October 2026. Distinguishes pure product states from mixed-state convex combinations.
• [PUBLISHING] Keddeh Research and Formal Publishing Standard, KEDDEH-STD-PUBLISHING-001, v1.0.

© 2026 Aboudy Keddeh | Keddeh Systems | All rights reserved
KEDDEH-TECH-LINE-ORIGIN-MATRIX-001 | Library R1 | Internal research · Owner review | Draft
KEDDEH-RESERVED-1.0. No licence is granted. Separate written permission governs reuse, redistribution and implementation, subject to applicable law. Third-party material retains its rights. No copyright assignment, patent or trademark licence, or independent approval is asserted.