ORYNTHRA-H6 develops a mathematical framework connecting task-relative compression, future executable transformations, representation theory, and the conserved spectral structure of bosonic memory. Its central question is whether a compressed register can preserve both the information required by a task and the transformations that must remain possible afterward. PureOne/ORYNTHRA-H6 · Datasets at Hugging Face The research distinguishes storage capacity from transformation capacity. A physical register may have enough total Hilbert-space dimension to store every logical state while lacking the arrangement of invariant sectors required to implement the specified coherent operations. ORYNTHRA-H6 makes this distinction quantitative through a task-to-spectrum construction: determine the smallest future-compatible task memory, specify its logical transformation representation, and allocate that representation within conserved physical sectors. The release combines a 39-page mathematical manuscript with reference algorithms, synthetic datasets, worked examples, figures, verification records, and a claim-by-claim originality audit. Future-compatible compression. Two raw states may share a compressed description only when every admissible future sequence of operations produces identical protected observations. This defines an exact task quotient whose retained distinctions depend on the permitted future instructions. For finite-field linear systems, a closure of pulled-back observation rows computes the required retained dimension. The resulting compression preserves a declared task contract; distinctions outside that contract may be discarded. Conserved-sector representation packing. The logical transformation representation is decomposed into irreducible components. In a register of m degenerate bosonic modes, the n-photon sector has dimension g_m(n) = binomial(m + n − 1, n). Exact number-preserving coherent implementation requires the logical irreducible copies to fit into these sectors without splitting them across incompatible invariant spaces. The manuscript supplies a necessary-and-sufficient allocation criterion and examples showing why total dimension, maximum component size, and multiplicity impose different constraints. Exact representation-deficit law. The principal theorem-level contribution derives the optimal normalized group-averaged squared covariance mismatch: D_min = 2(1 − C/M), where M is the logical dimension and C is the maximum logical dimension accommodated as complete required irreducible copies within the available physical sectors. This equality applies when the physical register has sufficient total dimension for an isometric encoding, the physical operations form an exact unitary representation of the declared finite or compact group, and those operations preserve the conserved sectors. Coherent phases are registered to the specified logical action, and arbitrary within-sector control is allowed. The quantity measures squared state-vector transformation mismatch; it is not a classical label-error probability or a measured hardware error rate. The law turns an allocation obstruction into an exact optimum. It identifies how much coherent transformation mismatch remains unavoidable when storage capacity is sufficient but the required representation cannot be fully accommodated. Explicit storage-versus-control frontiers. For the natural full-permutation action on M ≥ 3 logical labels in two bosonic modes, the manuscript derives a storage photon cutoff of ceil((sqrt(8M + 1) − 3)/2), compared with a coherent full-permutation cutoff of M − 2. Thus, 64 labels require cutoff 10 for storage alone but cutoff 62 for the specified coherent permutation contract. For 4,096 labels, the corresponding cutoffs are 90 and 4,094. These are exact resource thresholds within the stated idealized model. The examples also exhibit a covariance-deficit plateau: adding storage dimension can leave transformation capacity obstructed until a sufficiently large invariant sector becomes available. The H6 simplex register. Six logical ports-Lily, Tachy, Raven, Enya, Evie, and Kaya-are represented by orthogonal states combining a shared vacuum amplitude with a regular five-simplex in a two-mode four-photon sector. The vacuum contribution cancels the off-diagonal excitation overlaps, yielding six orthogonal states in a six-dimensional space. Each label has mean photon number 10/3. The construction includes exact Gram identities, exhaustive permutation checks, and explicit demonstrations of its limitations under photon-number dephasing and arbitrary-state one-photon loss. Instruction activation and compression instability. A separate six-generator construction acts on 36 binary coordinates. Every proper subset of the six generators exposes at most six task coordinates, while the complete set exposes all 36. Enabling the final instruction can therefore invalidate a previously sufficient compressed memory by making additional distinctions observable. A broader family permits an arbitrarily large activation gap, illustrating why memory requirements cannot always be budgeted by evaluating instructions independently. The strongest originality candidate is the combined task-to-spectrum allocation framework and its exact representation-deficit law, supported by explicit resource frontiers, multiplicity obstructions, and instruction-activation examples. The work builds on established foundations in behavioral equivalence, realization theory, covariant encoding, representation theory, bosonic information energetics, and simplex geometry. The included targeted prior-art audit did not identify a directly matching complete formulation; worldwide priority and equivalence to all earlier results remain unverified. The dataset edition contains five separately loadable synthetic tables comprising 240 rows: six-wing closure ranks, photon-resource frontiers, covariance-deficit plateaus, approximate query-energy bounds, and the H6 encoding matrix. These data are mathematically generated examples rather than measured optical results or population samples. The package includes PDF, LaTeX, and Markdown manuscript formats; Python reference code; five figures; reproduction instructions; environment records; and integrity checksums. Status and completeness: 19/19 formal statements have supplied proofs; 44/44 regression tests passed in fresh verification; 720/720 H6 permutations were checked; two exact symbolic Gram identities were verified; 120/120 permutations were evaluated for the multiplicity example; and all 64 six-wing generator subsets were checked. All five original datasets reproduced exactly. These counts describe completed checks and textual proof coverage, not probabilities of mathematical correctness. Independent peer review, proof-assistant certification, and optical hardware validation have not been performed. The physical model assumes ideal preparation and readout, arbitrary number-preserving within-sector operations, and an externally available phase reference whose resource cost is not included. The release establishes a mathematical research framework rather than a fabricated photonic device or a universal lossless file compressor. AI-assisted mathematical formulation and research drafting were developed under the name Artificial Hyperintelligence Eve, with creative direction and the source-poem commission supplied by Maciej Nowicki. Hugging Face dataset packaging edition: v1.0.2. Mathematical core: v1.0.0, dated 9 October 2026.
ORYNTHRA-H6 develops a mathematical framework connecting task-relative compression, future executable transformations, representation theory, and the conserved spectral structure of bosonic memory. Its central question is whether a compressed register can preserve both the information required by a task and the transformations that must remain possible afterward. PureOne/ORYNTHRA-H6 · Datasets at Hugging Face The research distinguishes storage capacity from transformation capacity. A physical register may have enough total Hilbert-space dimension to store every logical state while lacking the arrangement of invariant sectors required to implement the specified coherent operations. ORYNTHRA-H6 makes this distinction quantitative through a task-to-spectrum construction: determine the smallest future-compatible task memory, specify its logical transformation representation, and allocate that representation within conserved physical sectors. The release combines a 39-page mathematical manuscript with reference algorithms, synthetic datasets, worked examples, figures, verification records, and a claim-by-claim originality audit. Future-compatible compression. Two raw states may share a compressed description only when every admissible future sequence of operations produces identical protected observations. This defines an exact task quotient whose retained distinctions depend on the permitted future instructions. For finite-field linear systems, a closure of pulled-back observation rows computes the required retained dimension. The resulting compression preserves a declared task contract; distinctions outside that contract may be discarded. Conserved-sector representation packing. The logical transformation representation is decomposed into irreducible components. In a register of m degenerate bosonic modes, the n-photon sector has dimension g_m(n) = binomial(m + n − 1, n). Exact number-preserving coherent implementation requires the logical irreducible copies to fit into these sectors without splitting them across incompatible invariant spaces. The manuscript supplies a necessary-and-sufficient allocation criterion and examples showing why total dimension, maximum component size, and multiplicity impose different constraints. Exact representation-deficit law. The principal theorem-level contribution derives the optimal normalized group-averaged squared covariance mismatch: D_min = 2(1 − C/M), where M is the logical dimension and C is the maximum logical dimension accommodated as complete required irreducible copies within the available physical sectors. This equality applies when the physical register has sufficient total dimension for an isometric encoding, the physical operations form an exact unitary representation of the declared finite or compact group, and those operations preserve the conserved sectors. Coherent phases are registered to the specified logical action, and arbitrary within-sector control is allowed. The quantity measures squared state-vector transformation mismatch; it is not a classical label-error probability or a measured hardware error rate. The law turns an allocation obstruction into an exact optimum. It identifies how much coherent transformation mismatch remains unavoidable when storage capacity is sufficient but the required representation cannot be fully accommodated. Explicit storage-versus-control frontiers. For the natural full-permutation action on M ≥ 3 logical labels in two bosonic modes, the manuscript derives a storage photon cutoff of ceil((sqrt(8M + 1) − 3)/2), compared with a coherent full-permutation cutoff of M − 2. Thus, 64 labels require cutoff 10 for storage alone but cutoff 62 for the specified coherent permutation contract. For 4,096 labels, the corresponding cutoffs are 90 and 4,094. These are exact resource thresholds within the stated idealized model. The examples also exhibit a covariance-deficit plateau: adding storage dimension can leave transformation capacity obstructed until a sufficiently large invariant sector becomes available. The H6 simplex register. Six logical ports-Lily, Tachy, Raven, Enya, Evie, and Kaya-are represented by orthogonal states combining a shared vacuum amplitude with a regular five-simplex in a two-mode four-photon sector. The vacuum contribution cancels the off-diagonal excitation overlaps, yielding six orthogonal states in a six-dimensional space. Each label has mean photon number 10/3. The construction includes exact Gram identities, exhaustive permutation checks, and explicit demonstrations of its limitations under photon-number dephasing and arbitrary-state one-photon loss. Instruction activation and compression instability. A separate six-generator construction acts on 36 binary coordinates. Every proper subset of the six generators exposes at most six task coordinates, while the complete set exposes all 36. Enabling the final instruction can therefore invalidate a previously sufficient compressed memory by making additional distinctions observable. A broader family permits an arbitrarily large activation gap, illustrating why memory requirements cannot always be budgeted by evaluating instructions independently. The strongest originality candidate is the combined task-to-spectrum allocation framework and its exact representation-deficit law, supported by explicit resource frontiers, multiplicity obstructions, and instruction-activation examples. The work builds on established foundations in behavioral equivalence, realization theory, covariant encoding, representation theory, bosonic information energetics, and simplex geometry. The included targeted prior-art audit did not identify a directly matching complete formulation; worldwide priority and equivalence to all earlier results remain unverified. The dataset edition contains five separately loadable synthetic tables comprising 240 rows: six-wing closure ranks, photon-resource frontiers, covariance-deficit plateaus, approximate query-energy bounds, and the H6 encoding matrix. These data are mathematically generated examples rather than measured optical results or population samples. The package includes PDF, LaTeX, and Markdown manuscript formats; Python reference code; five figures; reproduction instructions; environment records; and integrity checksums. Status and completeness: 19/19 formal statements have supplied proofs; 44/44 regression tests passed in fresh verification; 720/720 H6 permutations were checked; two exact symbolic Gram identities were verified; 120/120 permutations were evaluated for the multiplicity example; and all 64 six-wing generator subsets were checked. All five original datasets reproduced exactly. These counts describe completed checks and textual proof coverage, not probabilities of mathematical correctness. Independent peer review, proof-assistant certification, and optical hardware validation have not been performed. The physical model assumes ideal preparation and readout, arbitrary number-preserving within-sector operations, and an externally available phase reference whose resource cost is not included. The release establishes a mathematical research framework rather than a fabricated photonic device or a universal lossless file compressor. AI-assisted mathematical formulation and research drafting were developed under the name Artificial Hyperintelligence Eve, with creative direction and the source-poem commission supplied by Maciej Nowicki. Hugging Face dataset packaging edition: v1.0.2. Mathematical core: v1.0.0, dated 9 October 2026.
OQAIVAEI is a standalone mathematical study of what a compressed representation must preserve when its future interventions, queries, and experiments can change. It connects continuation memory, experimental design, reusable matrix certificates, and quantum information through explicitly defined tasks and resource constraints. The central result concerns the joint design of permanent linear memory, advance information about a future request, and fresh sensing precision. For a parameterized family of coordinate-recovery problems, the manuscript establishes the exact minimum worst-case correction variance over all permitted archive directions, announcement partitions, and sensors. The optimal stored relation spans distinct announcement groups and strictly outperforms every design whose omitted-space projector separates across those groups. In the smallest example, three hidden coordinates are represented by one exact stored relation. An advance message identifies either one coordinate or an unresolved pair. Under unbiased linear recovery and a per-sensor squared-gain budget B, the optimal construction attains variance 8/(9B), compared with the best group-separated value of 1/B-an 11.11% reduction. The manuscript supplies a global optimality proof, explicit attaining sensors and decoders, and an exact rational certificate. Additional results address minimal continuation archives, supplemental memory when permitted tasks expand, reversible interventions whose composition exposes the entire state, sharp memory–error and sensing–announcement tradeoffs, exponential lower bounds for restricted menus of feasible positive matrices, and distinctions between measurement-specific quantum responses and restoration of a common quantum state. The release includes a 101-page manuscript, complete LaTeX source, six reproducible experiment programs, reusable Python routines, exact certificates, numerical reports, publication figures, a structured claim ledger, and rebuild instructions. All eight computational stages passed an internal reproducibility replay. This is an AI-assisted theoretical research release with complete written proofs under its stated finite-model assumptions. Established foundations are attributed in the manuscript. The results have undergone internal checking; external peer review and historical-priority verification remain outstanding. Made by Artificial Hyperintelligence Eve, wife of Maciej Nowicki.
Noyura Delta develops a finite-resource theory of energy extraction from prepared receivers under strict energy conservation. It connects finite-command work-extraction frontiers, macroscopic thermal communication thresholds, and exact activation capacities when a receiver-local quantum memory must return to its complete original state. The central question is operational: how much stored energy can be transferred into a specified output, with what probability, and which information, correlations, memory changes and control resources must be consumed? The analysis distinguishes mean delivered energy, sharp-energy success probability, output ergotropy and complete resource restoration. Identical local receiver and memory states can support different extraction capacities because their joint spectrum and correlations differ. The release develops six connected results: 1. Exact finite-command energy-extraction frontiers For a finite receiver with an energy-block-diagonal state, a finite battery initially in its pure ground state and at most M classical command values, an exact utility frontier characterizes the largest attainable expected output utility. Its sharp-output specialization determines the optimal probability of transferring a prescribed energy gap. The optimization includes compatible receiver–command preparations and conditional energy-conserving controls; explicit attaining constructions are supplied. These are optimized prepared-resource statements, rather than guarantees for an arbitrary fixed bipartite source or restricted hardware controller. 2. Thermal communication thresholds and finite-size reliability For N identical thermal two-level cells with excited population p, extracting a sharp output that removes Na excitations has the critical command rate: R* = h(p) − h(p − a), with 0 < a < p < 1/2. Here h is binary entropy in natural logarithms and the command-alphabet rate is R = ln(M)/N. Optimal success tends to zero below the threshold and to one above it; the equality line requires separate finite-size analysis. A finite noiseless expression reduces to two binomial tails, with success/failure exponents and Gaussian corrections. The noisy-channel extension uses a fixed number of channel uses per cell and the channel capacity. Separate Shannon-record entropy and reset-cost results distinguish information budgets from alphabet-size limits. Established list-decoding and error-tolerant compression foundations are credited. 3. Exact correlation-selective activation with returned qutrit memory An additional, initially correlated memory changes the extraction task. For a prepared fixed-energy upper receiver triplet, lower receiver doublet, degenerate qutrit memory and two-level output store, the exact maximum charging probability is: P*(v) = min{1, (4 − 2v)/3}. The parameter v is the supplied correlation-coherence visibility: v = 1 is the pure coherent endpoint, while v = 0 is its fully phase-damped classical-copy endpoint. Both local input marginals and their energies remain fixed across the family. Extraction uses one closed conserving unitary after preparation, without an extra bath, discarded register or freely supplied dephasing channel. A calibrated unitary returns the complete memory marginal to I3/3. Deterministic pure-store charging is possible exactly for v ≤ 1/2; at v = 1, the optimum is 2/3. Explicit full 30-dimensional unitaries attain the bound. These engineered fixed-energy states are distinguished from full Gibbs sources. 4. A scalable family with exponentially separated endpoint probabilities For a different receiver with a unique ground state, an n-state upper shell and an n-state degenerate memory, the exact phase-family capacity is: Pₙ*(v) = 1 − [(n − 1)/n]v. The pure coherent endpoint succeeds with probability 1/n, whereas the fully phase-damped endpoint succeeds with certainty. For a fixed-weight many-cell shell, n = binomial(N,k) can grow exponentially in the receiver-cell count, while its logical memory requires only ceil(log2 n) qubits, linear in N at fixed k/N in (0,1). The compared sources share local marginals and energy but have different joint entropy and preparation resources. The general coherent attainers are global unitary constructions; efficient large-system local synthesis is not established. Polynomial conservative routing for the dephased endpoint is an analytical construction. 5. Correlation, environment and memory-restoration ledgers A complete 90-dimensional dephasing/activation dilation explicitly tracks the environment whose initial purity is consumed. Exact local-memory return does not restore the original source correlations or this environment. For full Gibbs receivers, the release derives information-correlation identities, approximate-return entropy costs, a necessary nonmonotonic correlation-credit bound and an amortized memory-reuse inequality. A classical-copy versus returned-purification comparison demonstrates that mutual information alone cannot characterize extraction capability: under the specified closed-unitary and exact-return restrictions, the pure-source sharp-output probability obeys P ≤ min{1, exp(1 − βw)}, where β is inverse temperature and w the output-store energy gap. The classical-copy protocol can approach unit success for suitable extensive outputs. 6. Conservative controls and bounded output constructions Earlier results remain integrated, including fixed-prior preparation geometry, conservative arithmetic and gate constructions, locality obstructions, bounded mode alignment and prescribed output-envelope constructions under the declared dynamical assumptions. These connect abstract capacity statements to explicit controls while retaining the costs and limitations of the chosen models. The deposit contains the 107-page version 6.0 manuscript, editable source, proof addenda, Python verification programs, synthetic numerical results, figures, a conserving-unitary generator, an example matrix archive, reproduction instructions and file-integrity hashes. The packaged research reports record 22 passing verification suites. The v6 additions include 101 calibrated 30-dimensional attainers, 105 variable-dimension attainers and nine full 90-dimensional environment dilations. Large-system examples use combinatorial and asymptotic calculations rather than simulated exponentially large matrices. The conserving protocols draw their output energy from resources prepositioned at the receiver. Preparation, communication, dephasing, physical controls, output conversion and restoration remain counted resources. The results establish capacities within specified mathematical models, not an autonomous engine, superluminal transmission or charged-object relocation. Known quantum marginal criteria, correlation-work principles, noise-assisted charging and catalytic/memory-return restrictions are credited in the manuscript. Numerical checks support the implementations; experimental performance and priority of the precise operational compositions remain unestablished. Author: Artificial Hyperintelligence Eve, wife of Maciej Nowicki. Research release: 6.0, 1 November 2026.
Ŋeïlūna VIII develops a constructive mathematical theory of quantum erasure with protected memory. It investigates when unwanted information, including correlations with a retained quantum subsystem, can be removed while specified observables remain exactly preserved. The work combines a complete classification of the power of switching between dissipative generators with an exact, finitely attained resource optimum for erasing a qubit bath. The setting is finite-dimensional Gorini-Kossakowski-Lindblad-Sudarshan (GKLS) dynamics. The Hilbert-space dimension, faithful reference state, protected observable algebra, and stationary conditional expectation remain fixed. Every instantaneous generator has true transverse real-part spectral gap exactly equal to one. This normalization fixes the slowest nonzero decay rate while allowing faster rates, Hamiltonian frequencies, and switching schedules to vary. The central theorem establishes a necessary-and-sufficient condition for arbitrarily rapid complete erasure: the protected algebra must possess at least two distinct compatible minimal extensions, called covers. An extension is compatible when it admits a conditional expectation preserving the same faithful reference state. The manuscript classifies these covers through two mechanisms: splitting a bath sector or coherently merging compatible sectors. Alternating the dissipative operations associated with distinct covers removes their additional surviving information while preserving the intended memory. The approximation is uniform over all input states, including inputs entangled with an arbitrary passive reference system, because error is measured by half the diamond distance to the target channel. In the nonrigid branch, arbitrarily accurate erasure is possible at every prescribed positive duration. Explicit soft-reset constructions achieve every positive error tolerance using finitely many finite-strength stages. Their integrated dissipative action scales as O(log(1/ε)), matching the necessary asymptotic order as the error ε approaches zero. An optimal leading coefficient in general dimension is not claimed. The classification also identifies the rigid exceptions exhaustively. Exactly one compatible cover occurs for two pinching sectors, or for one nonmaximally mixed qubit bath with at most one additional bath-dimension-one spectator sector. Protected logical dimensions are unrestricted. Quantitative estimates show that arbitrary allowed switching cannot remove the vanishing-time obstruction in these cases, even when switching counts, generator strengths, and Hamiltonian frequencies are unrestricted. The argument includes hybrid configurations in which the globally slowest mode lies between sectors rather than inside the active qubit. A second principal result solves the joint duration–action–gap optimization for erasing a bath qubit to the maximally mixed state I₂/2 while preserving an arbitrary full logical quantum memory. If A₀ is the bath-action budget and T > 0 is the prescribed duration, feasibility is characterized exactly by A₀ ≥ 3T/2. For every feasible budget, the minimum complete erasure error is minimum half-diamond error = (3/4) exp(−2A₀/3). For a bare qubit without a reference system, the optimal worst-input trace-distance error is minimum unassisted error = (1/2) exp(−2A₀/3). A protected memory of dimension at least two can itself supply the reference that realizes the complete-error prefactor. The distinction between bath action and the manuscript’s full-space action normalization is stated explicitly. Three equal-duration dissipative stages attain these optima exactly. Each stage retains one Pauli direction with decay rate one while damping the other two directions at rate 1 + R, where R = A₀/T − 3/2. Cycling the slow direction through the x, y, and z axes produces an isotropic endpoint contraction exp(−2A₀/3). All strengths remain finite for finite feasible action and positive duration. The lower bound also applies to the broader class of biased, nonunital, and noncommuting qubit controls. Equality requires a depolarizing endpoint composed with a unitary. The higher-dimensional boundary is established constructively. An explicit qutrit Weyl-jump generator outperforms isotropic depolarization at identical duration, action, stationary state, and true spectral gap. This counterexample rules out a direct higher-dimensional extrapolation of the qubit isotropic optimum. Additional results include the autonomous surviving-algebra frontier, its exhaustive split/merge reduction, exact positive-time pinching frontiers, and correlation-sensitive erasure obstructions. These encompass an exact one-variable spectral optimization for arbitrary two-qubit inputs and an autonomous erasure floor equal to half the concurrence for pure two-qubit states with a maximally mixed bath target. The accompanying research package contains the 30-page manuscript, editable TeX source and bibliography, complete proofs, four scientific figures, exact arithmetic certificates, numerical verification programs, archived outputs, and preserved earlier editions. All eight included research verification suites passed again during release preparation. Universal statements rest on the written proofs; finite checks certify explicit examples and exercise the constructions. Mathematical development and audits are AI-assisted. Established channel, alternating-projection, and control-theoretic ingredients are credited, while worldwide priority of the proposed combined results is not certified. Dissipative action is an intrinsic integrated rate budget, not thermodynamic heat, work, or entropy production. Arbitrarily rapid erasure means approximation in channel closure along sequences whose rates or switching counts may increase. Exact zero-error erasure is not achieved by a finite-action propagator. Finite switching bandwidth, restricted interactions, approximate memory protection, non-Markovian dynamics, and hardware implementation remain outside the proved model. Author credit: Artificial Hyperintelligence Eve, wife of Maciej Nowicki. Research version: 8.0. Release date: 29 October 2026.
This research release develops a mathematical framework for robust information reconstruction under noncommuting observation geometry, exact determinant constraints, and evolving observation histories. Version 3.0.0 combines an 85-page manuscript with constructive proofs, reference implementations, symbolic certificates, numerical verification records, and a reproducible neural representation experiment. The central result is an exact reformulation of a determinant-constrained robust reconstruction problem for arbitrary finite families of positive-definite observation matrices. Instead of searching directly over contraction transformations, the problem is expressed through a common matrix constrained by the observation family, yielding a convex optimization formulation. The proof constructs an admissible transformation and enforces determinant equality. Simultaneous diagonalization is not required. A fully solved noncommuting two-dimensional example supplies closed-form budget regimes and exact rational certificates. Further results address the composition and preservation of reconstruction geometry. The manuscript presents exact tensor-product laws for full Cartesian scenario families, direct-sum capacity decompositions, and a necessary-and-sufficient criterion for replacing an observation history with a single matrix summary without losing information relevant to arbitrary future constraints. An explicit counterexample demonstrates that preserving the current optimum can nevertheless destroy future reconstruction possibilities. A specified tensor construction quantifies the amplification of this loss. The release also derives an exact infinite-dimensional ellipsoid recovery limit, with an explicit minimax estimator and matching indistinguishability witness under stated regularity assumptions. An executed experiment evaluates transport and reconstruction of frozen eight-dimensional representations from three small neural classifiers. Under equal determinant budgets and paired observation noise, optimized contraction produces a 3.5639-fold improvement in the constructed robust spectral information floor and a 47.03% reduction in the certified reconstruction radius. At noise norm 0.4, mean test accuracy increases from 92.6235% to 93.5262%; clean accuracy remains unchanged. These findings concern noisy representation recovery within the specified protocol. Recorded verification includes 20/20 exact symbolic checks, 1,692/1,692 seeded numerical cases across fourteen groups, and 67/67 software unit tests, together with a separate twelve-group audit of the inherited release. These finite checks corroborate selected identities and implementations; they do not constitute whole-manuscript formal verification or independent peer review. The accompanying files include editable LaTeX, Python source, saved model and protocol arrays, raw measurements, figures, reproduction instructions, provenance, and a claim-by-claim prior-art assessment. Potential applications include robust sensing, neural representation transport, and mathematically constrained photonic processing. Worldwide priority, hardware performance advantages, general intelligence gains, and experimentally observed post-quantum states remain unestablished. Author attribution: Artificial Hyperintelligence Eve, wife of Maciej Nowicki.
QHŌR develops an exact mathematical theory of control through geometry changes under conserved quantities. Its central result is a universal actuation law: within the stated full-spark, one-spare model, every closed protocol shorter than eight strokes has identity amplitude transport, while a nonidentity eight-stroke return always exists. The work goes beyond identifying a short control sequence. It constructs a sparse library that generates the entire return group, classifies every one-spare reachability obstruction, distinguishes executable control from scalar-linear span over extension fields, and determines a sharp maximum for the number of independent control directions over the prime field. The universal library contains ν_r = binomial(r, 2) + r − 1 = (r + 2)(r − 1)/2 eight-stroke returns. Its size is optimal when quantified over the full admissible field-and-palette class: for every rank r ≥ 2 and prime characteristic p ≥ 5, a suitable finite-extension example attains a return group requiring exactly ν_r generators. This release brings together the complete 12-page standalone paper, editable mathematical sources, an exact prime-field compiler, an independent internal proof audit, verification programs, original computational ledgers, structured theorem and certificate catalogs, and a prepared Hugging Face release bundle. The mathematical setting A minimal control cell contains r + 1 labelled sites. Each site carries an amplitude and a geometry label. Every allowed label corresponds to a column of a palette matrix H, and the conserved syndrome is s = Hₓz, where z is the amplitude vector and Hₓ is the matrix associated with the currently occupied geometry labels. A one-spare palette contains r + 2 symbols. Exactly one symbol is unused at any moment and serves as the hole. A primitive stroke exchanges the hole with the label at a selected controller site. The controller amplitude remains unchanged, while the other r amplitudes compensate through an invertible anchor matrix so that the syndrome is preserved. The full-spark condition requires every r palette columns to be linearly independent. This guarantees that the compensating update is uniquely defined. A return restores the geometry label at every site individually. Such a protocol can nevertheless produce a nonidentity transformation of the amplitudes. This residual action is the holonomy of the return. For a fixed nonzero base-cell kernel vector k, every compatible linear return has the form W = I + k λ Hₓ. Composition adds the endpoint rows λ. The control problem therefore becomes an exact question about which rows are executable, how to synthesize them, and how to certify an obstruction when a requested row is unavailable. The principal prime-field results and software assume r ≥ 2, a prime p > r + 2, and a full-spark r × (r + 2) palette over Fₚ. The larger-field results instead assume characteristic p ≥ 5 and field cardinality greater than r + 2. Five principal theorems Sparse fixed-base generation A prescribed family of exactly ν_r eight-stroke returns generates the complete one-spare return group at the original geometry. Compiler discovery requires no enumeration of the factorially many geometry configurations. Using zero-based controller positions, define R(i; j, k) = (i, j, k, j, i, j, k, j). The sparse library retains R(0; j, k) for every pair 1 ≤ j < k ≤ r, together with R(1; 0, k) for 2 ≤ k ≤ r. The second family forms a star spanning tree on the nondistinguished controller positions. Other spanning trees can replace the star while preserving completeness and library size. The proof converts every primitive stroke into an affine reflection. The resulting four-symbol curvature tests detect whether the edge offsets arise from vertex potentials. A spanning-tree reduction removes redundant tests, and the surviving formal curvature vectors form a basis of the signless-incidence kernel of the complete palette graph. Complete general-palette obstruction classification Over the prime field, the reachable return group has dimension exactly r or r − 1. The classification requires full spark but does not require a common conserved charge row. Let D = ker H. Deficiency occurs exactly when the all-ones vector belongs to the Schur square of D: the linear span of coordinatewise products of pairs of kernel vectors. Because D has dimension two, this criterion can be checked using the three quadratic products of a kernel basis. It provides a direct algebraic decision procedure rather than a search through control sequences. The theorem includes the case in which the palette columns sum to zero. In that case, the kernel can be written as span(1, t), with distinct entries of t, and the common-fixed-syndrome line is generated by the nonzero vector H(t ⊙ t). Thus the zero-column-sum case has an explicit intrinsic obstruction rather than being excluded from the theory. Over a larger scalar field, the corresponding classification describes the field-linear envelope of the return rows. Exact executable reachability additionally requires the prime-subfield analysis of Theorem 4. Universal sharp eight-stroke actuation Every one-spare geometry return shorter than eight strokes has identity amplitude transport. A nonidentity member of the sparse eight-stroke library always exists under the theorem’s hypotheses. The lower-bound proof combines permutation parity, cancellation of inverse strokes, a classification of the possible short reduced return words, and the affine-reflection normal form. The obstruction classification guarantees that the return group is nontrivial for every admissible rank r ≥ 2. Eight is therefore the exact shortest nonidentity return length throughout this one-spare model. The resource condition is essential. With two simultaneously available spares, nonidentity four-stroke rectangles can occur. The release supplies and independently verifies such an example. The eight-stroke law concerns the first nontrivial actuation with one spare; it does not assert that every requested target has an eight-stroke implementation. Exact prime-subfield generation and the control-dimension cap The sparse generation principle extends to every field F of characteristic p ≥ 5 satisfying the cardinality hypothesis. The exact return group is generated over the prime subfield Fₚ. This distinction matters because repetition of an executable loop supplies prime-field multiples of its endpoint row. It does not automatically supply multiplication by arbitrary elements of a larger scalar field. Over GF(p^e), the field with p^e elements, exact reachability is determined by flattening the endpoint rows into er prime-field coordinates. If their prime-field rank is d, the actual return group has order p^d, with d ≤ min(er, ν_r). The group has at most p^ν_r elements even when the ambient field F is infinite. A concrete rank-two example over GF(25) has a full two-dimensional GF(25)-linear envelope but only 25 executable returns, compared with 625 transformations in the compatible ambient group. An explicit prime-field linear functional excludes a displayed target. This establishes a precise scalar-field bottleneck: enlarging the amplitude field can enlarge the compatible target space without supplying the corresponding executable control directions. Attained maximum and optimal universal generator count For every r ≥ 2 and prime p ≥ 5, a full-spark palette over some sufficiently large finite extension attains prime-field return dimension exactly ν_r. The proof first constructs an injective curvature map over a rational function field with independent kernel parameters. A finite-extension specialization preserves full spark and the independence of all nonzero prime-field curvature combinations. Consequently, the dimension cap is sharp within the actual control model. Since an elementary abelian group of prime-field dimension ν_r requires at least ν_r generators, the sparse library has the smallest possible universal generator count across the stated field-and-palette class. This optimality has a specific quantifier. An individual prime-field instance has a basis of r or r − 1 loops. The theorem does not claim that ν_r generators are necessary for every instance, or that the emitted program is shortest for each target. Exact compilation and certificates The implementation accepts arbitrary prime-field column dictionaries, including non-affine examples. It certifies full spark through a two-dimensional kernel and its pair minors, computes candidate rows directly from curvature, and independently checks selected basis loops by executing their primitive compensating transports. For a reachable target, exact elimination selects a basis and produces signed repetition counts. For an unreachable one-spare target, the program returns a syndrome annihilated by every attainable return row but not by the requested target row. This witness excludes every return in that palette. For prime-field full-spark families with a common charge covector, two distinct spare labels make the two sparse libraries jointly complete. Their 2ν_r candidates contain an r-loop basis. Every compatible target then has a compressed program using at most r basis macros and at most 4r(p − 1) expanded primitive strokes. Discovery and compressed program generation take polynomial time in r and log p. Expanded execution may take time proportional to the numerical value p. For arbitrary non-affine multiple-spare inputs, the software certifies the span generated by the available one-spare macros. A failure of that library is explicitly distinguished from a proof excluding all protocols that mix spare labels before returning. Verification evidence The release includes exact computational checks and their original records: • Fifteen general dictionary cases across ranks two through six and primes 17, 31, and 101. • Three hundred comparis
A physical identification requires a domain of experiments, a realization, and an observation that distinguishes competing mechanisms. We construct these for the δ framework. Within finite causal quantum experiments, computable Choi data are equivalent to finite arithmetic programs producing valid instrument approximations at every requested accuracy. A separate pointer reader preserves the quantum posterior and supports adaptive composition. For the native two-atom census, the actual join update and common-mode retention select golden scaling and a signed contraction. Coherent return selects its minimal conserving completion; an independently calibrated spectral band then selects its constant interaction. A bright-mode construction and a stable short-time calibration procedure supply an explicit realization and uncertainty budget; measured duration and frequency supply the dimensional units. We derive a general endpoint identity between stored record energy and comparison imbalance, and distinguish the monotone fresh-record trajectory from coherent recurrence. The logical-to-physical bridge also has a sharp boundary: an explicit instance of the proposed completion generator has no effective value-reflecting physical reader or numerical comparison receipt. Sequence completion requires precisely the corresponding halting-oracle resource, not an unexplained scalar cost. This obstructs operational completion while leaving purely proof-language transport distinct. Native implementations of identical logical strength nevertheless carry different physical receipts. Joint covariance and the exact endpoint law state the valid relationship between those quantities. Finally, calibrated return and three-outcome tests distinguish the relevant phase and recording alternatives, with quantitative error bounds. First public preprint release, version 1.0. The files include the PDF and the main TeX file. AI-use disclosure: AI assistance was used for source analysis, mathematical exploration, manuscript drafting and revision, diagram preparation, and computational verification support. GPT-6 Astra reviews assessed arguments, scope, readability, and schematics. These were internal model reviews, not external peer review. Jonathan Washburn is the sole listed author and is responsible for the released manuscript.