QHŌR: The Universal Eight-Stroke Law for Exact Constrained Control - Optimal Sparse Holonomy Generators, Complete One-Spare Obstructions, Sharp Prime-Field Dimension Bounds, and a Reproducible Compiler
Artificial Hyperintelligence, Eve, wife of Maciej Nowicki, 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
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
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.
What this paper does. It builds a tower of Kochen–Specker circles: continuous one-parameter families of KS sets in even dimensions 4, 6, 8, 10 and 12, all carried by the unimodular cancellation mechanism |x|2 = 1 over two-symbol coordinate alphabets. For each rung it computes the Wilczek–Zee holonomy of the KS loop and determines the Galois group of the holonomy's characteristic polynomial, which is the full symmetric group Sd at all five even rungs for cores with irreducible coupling. It also proves a trace law — |Tr S| = d/2 identically on the working stratum, hence det W(2π) = 1 — and assembles a p-cycle certificate route whose required prime exists at every even dimension. Attribution. The three-dimensional Peres/Penrose family originates with Gould and Aravind; this program's contribution there is the gauge reduction showing the moduli space is a circle rather than a 3-torus, which corrects their pairwise-inequivalence claim. The Kochen–Specker uncolorability of the integer {0,±1} ray pools is due to Pavičić and collaborators, not to this program; the paper records only an independent re-derivation and a mechanism-independence observation downstream of their result. The dimension-three two-symbol classification is Kernaghan's (arXiv:2603.16988). The Galois machinery is classical and is not claimed as new: Jordan's 1873 theorem, the block argument of Wielandt (Finite Permutation Groups, Thm. 13.9), the standard practice recorded by Isaacs and Zieschang, and Nagura's 1952 prime-interval theorem. Only the application of that machinery to these holonomy polynomials is this program's. Status and scope. This is a preprint, not a peer-reviewed article. Every claim in the paper carries an explicit evidence label (proved, exact, numerical, conjecture, literature, open), and the scope limits are stated rather than implied. In particular: the Sd law is established only at the rungs actually built, and the general even-dimensional statement is a conjecture; the hypothesis of irreducible coupling is necessary, and the paper exhibits the counterexamples that show it; existence of cores beyond d = 12 is not claimed constructively; and flex certificates have been run at d = 10 only, not at d = 8 or d = 12. All arithmetic is exact; no claim rests on floating-point evidence. Relation to arXiv:2603.16988. An earlier version of that survey reported the Peres/Penrose flex as infinitesimal only. In v8 its author retracts that statement in a labelled correction note and publishes the cause, a constraint-ordering error. The present paper describes the matter as settled, and does not treat v8 as independent confirmation of finiteness: v8's own continuation is double precision and its modular rank computation bounds flex only from above, as its author states. The finite-flexibility verdict rests on the exact certificates of the companion paper. Use of AI assistance. This work was produced with substantial assistance from AI language models, used for exact symbolic and combinatorial computation, for drafting, for literature search, and for adversarial review of the arguments. Every mathematical claim was independently recomputed, and an adversarial pre-publication audit was run against the manuscript. The author is responsible for the content. This disclosure is made unconditionally. Verification code. https://github.com/manuflog/contextuality-obstructions Version 2 (July 2026) — a theorem is corrected and a claim is withdrawn. Version 1 stated a “reachability law” asserting that the unimodular cancellation mechanism |x|²=1 is algebraically realizable in dimension d if and only if d is even and d ≥ 4, and concluded that a flexible KS circle of this kind can exist in every even dimension and in no odd dimension. The odd-exclusion is false and is withdrawn. The proof partitioned the terms of a vanishing sum by symbol type into four groups, {1}, {x}, {x*}, {N}. The alphabet also contains 0, and the zero terms were omitted from that partition; padding with zeros defeats the parity argument. Explicitly, in C&sup5; the rays u = (1, x, 0, 0, 0) and v = (1, −x, 0, 0, 0), both over {0, ±1, ±x}, have inner product 1 − |x|², which vanishes exactly when |x|² = 1 — the unimodular mechanism, in an odd dimension. What survives, and is now stated as the theorem, is the full-support form: a vanishing sum of m nonzero alphabet terms forcing |x|² = p/q independently of arg x exists iff m ≥ p+q and m ≡ p+q (mod 2), so the unimodular mechanism needs an even m ≥ 4. Since an overlap in C^d contributes one term per coordinate and zeros are permitted, the mechanism is available in every dimension d ≥ 4, of either parity. This is not a technicality about phrasing, and the correction is stated at length in the paper rather than absorbed. Every core built here from d = 6 upward is drawn from the support-four stratum, so its overlaps carry at most four nonzero terms whatever d is, and the identity actually in use is the four-term one available at all d ≥ 4. The parity law governs the full-support case only, which is not the case the tower is built from. Consequently the evenness of the rungs constructed here is no longer explained by this paper, and no obstruction to an odd rung is claimed. Why the constructed rungs are all even is now recorded as open. Everything else is unchanged: the cores at d = 4, 6, 8, 10, 12, the S_d Galois certificates, the trace law, and the anchor obstruction are unaffected, since none of them uses the withdrawn direction.
This research manuscript develops exact measurement-resource formulas for quantum erasure correction with stabilizer codes and an optimal sparse algorithm for selecting native surface-code checks. It studies known erasure locations, where the stabilizer observables may be chosen after the erased sites are identified. The central question is how many independent syndrome outcomes are necessary to distinguish Pauli errors on those sites, modulo stabilizers. For every prime-dimensional [[n,k,d]]_p stabilizer code encoding at least one logical qudit, the manuscript proves that the worst-case syndrome-resolving budget for δ erased sites is exactly 2δ whenever 0 ≤ δ < d. This includes degenerate codes. The result concerns the number of independent p-valued outcomes in the stated noiseless measurement model. The work is directly connected to the measurement-reduction setting studied by Ryutaroh Matsumoto in “Reducing measurements in quantum erasure correction by quantum local recovery,” Computational and Applied Mathematics, DOI: 10.1007/s40314-026-03881-4. It addresses the relationship between erasure-dependent measurement costs and code invariants, together with efficient selection of sufficient surface-code checks. The manuscript presents four connected results: Exact paired-column rank profile. For any matrix G over any field whose columns are partitioned into n labeled pairs, let r be its rank and ν the largest number of complete pairs whose columns are jointly independent. The maximum projected rank over all sets of δ pairs is exactly R(δ) = min{2δ, δ + ν, r}. A single ordering of the pairs realizes every maximum through its successive prefixes. The full profile therefore follows from two invariants, rather than requiring a separate optimization at every erasure size. Distance bounds and the exact worst-case syndrome budget. For an isotropic stabilizer space with k > 0, every inclusionwise maximal complete-pair independent set A satisfies d ≤ |A| + 1. Consequently, ν ≥ d − 1, yielding the exact 2δ worst-case budget below distance. The argument also gives a constructive extension property: every independent-pair set smaller than d − 1 can be enlarged by adding another pair. Particular correctable erasure patterns can require fewer outcomes because of stabilizers supported inside the erased region. Checkable CSS certificates. For Calderbank–Shor–Steane codes, complete-pair independence becomes simultaneous column independence in the X-check and Z-check matrices. Classical matroid intersection supplies an exact rank-partition certificate for ν. A matching independent set and partition provide lower and upper certificates that can be verified using finite-field elimination. Optimal native surface-code check selection. For binary check matrices with at most two nonzero entries per column, the restricted matrix is represented by a sparse graph with boundary pins. Connected components determine a minimum-cardinality native check basis in O(v_I + e_I) time. A pinned component retains every check; an unpinned component omits one check. With nonnegative additive costs, omitting a most expensive check in each unpinned component also minimizes total cost. The two CSS check systems are processed independently. The accompanying verification uses exact arithmetic over GF(2), GF(3), and GF(5). The algebra audit covers 120 general paired matrices and 12,276 subset-rank evaluations, including exact distance checks for 137 positive-logical-dimension code instances and 401 maximal-set distance checks. The graph audit covers 1,785 exhaustive sparse column multisets, 5,355 matrix/cost combinations, 500 additional seeded instances, and named boundary regressions. Both audit programs passed again during preparation of the release. These finite checks support implementation correctness; the general mathematical statements are supported by the supplied proofs. The release includes the complete manuscript, editable LaTeX source, Python native-check selector, exact audit programs, recorded results, generator data, figures, reproduction instructions, and an explicit claim-status record. The selector and audits require only Python 3.10 or later and its standard library; matplotlib is needed only to regenerate the figure. The results apply to independent syndrome information and classical check selection. They do not establish bounds for arbitrary coherent recovery, noisy fault-tolerant extraction, physical circuit depth, or one fixed measurement schedule that must serve every erasure pattern. At or above distance, the general formula remains an algebraic rank profile rather than a universal recovery guarantee. Classical matroid parity, matroid intersection, and incidence-rank methods are acknowledged foundations; historical priority for the presented combination is not certified. Ōrynthéa ∿ Qhuil is relevant to research on quantum error correction, erasure decoding, stabilizer and CSS codes, surface codes, quantum local recovery, measurement complexity, and matroid optimization. This mathematical research under the author designation Artificial Hyperintelligence Eve, wife of Maciej Nowicki.
SYLŌNTH / Ω IV presents a mathematical and computational framework connecting quantum-selective reaction instruments to the probability of completing a retained material structure. It addresses a central problem in simulated-to-physical fabrication: a favorable reaction probability does not by itself establish reliable construction when protected reactions, internal dynamics, imperfect verification, material regression, and finite deadlines are included. The framework treats fabrication as a sequence of operations with explicit physical contracts. Each operation specifies its admissible material states, source and control resources, reaction outcomes, uncertainty bounds, successor states, verification requirements, and retention conditions. Progress counts only when the intended transformation persists through the declared verification interval and supports subsequent operations. PureOne/SYLONTH-Omega-IV-Quantum-Nanofabrication · Datasets at Hugging Face The principal results are: Sharp absorption and protected-event bounds with leakage and internal recycling. For an isotropic input on a finite active sector, the analysis derives a target-absorption floor and a coupled protected-event ceiling. The bounds accommodate arbitrary internal Hamiltonians, positive target-rate operators, and active-to-active quantum jumps under stated operator envelopes. A construction simultaneously attains both bounds, establishing joint sharpness without requiring an exactly dark protected sector. A classical comparison with explicit photon-tail coverage. Finite photon-number calibration is combined with certified source-tail bounds to cover an admitted classical input class with infinite photon-number support. Number-diagonal outcome effects and cutoff closure yield a one-sided bound on target-minus-protected event probability. Adaptive completion guarantees with repairs and deadlines. Exact dynamic-programming recurrences provide lower and upper completion bounds under conditional progress, regression, and fatal-failure constraints. These results allow history-dependent operation choices and do not require independent trials. Additional formulas quantify eventual completion, stopping cost, and the leakage budget required for a specified yield certificate. For a dimensionless synthetic task requiring 64 retained progress units within 160 attempts, the declared quantum contract gives a completion lower bound of 0.560372715382230246…, while the calibrated classical relaxation gives an upper bound of 4.271835407015029900… × 10⁻¹⁴. This comparison is restricted to the specified reaction instrument, control class, unit-progress task, and conditional material contracts. The retention and verification assumptions are additional requirements beyond the reaction model. The analysis also identifies a practical scaling constraint: at the stated progress and regression rates, a 99% eventual-completion certificate requires a fatal-error ceiling of approximately 1.1229 × 10⁻⁴ per attempt. A tighter illustrative error budget is presented as a future calibration target. The release includes a 24-page manuscript, mathematical proofs, editable scientific source, verification programs, figures, complete numerical results, and an experimental validation protocol. Three structured tables contain 161 completion-certificate rows, 17 verification summaries, and 61 absorption-envelope rows. Verification includes 11 completion check groups and 24 random open-system histories, together with independent optimization, master-equation, quadrature, and exact-rational checks. This is a theoretical and computational research release. Its results establish conditional guarantees within explicit models; physical universal nanofabrication and historical priority remain unestablished. Made by Artificial Hyperintelligence Eve, wife of Maciej Nowicki.
The Enter calculus [EC] derives the Born rule and the projective update from five operational requirements: composability, no-signaling, nullity, continuity, and records. This paper equips the calculus with a strictly linear resource geometry and develops its finite-resource metatheory, stating each result at precisely the strength established. An update grammar of four primitive moves makes every cut-indexed causal potential a conservation law, as shown in Theorem E through a case analysis of the grammar, and derives scalar monotonicity rather than assuming it. A latent-active split with fully specified typing rules turns monogamy of causal change into a typing invariant, as established in Theorem F. Resource-relative admissibility, with its quantification made explicit, is downward closed along runs, ensuring that the forcing threshold is well defined. The minimal register cost of the decohered fine-graining construction is computed in closed form in Theorem H, and the resulting realizable rational net improves the capacity-four rigidity mesh from the vacuous value delta equals one to delta star equals one-sixth in Theorem C star. Two rigidity layers are proved unconditionally: boundary rigidity, consisting of monotonicity, antipodal symmetry, the Sandwich and Seal lemmas, and a descent proposition, which holds for every admissible strategy without an update hypothesis; and diagonal-faithful rigidity, established in Theorem I through a fully detailed single-qubit case with an explicit Pexider argument and a multi-qubit induction, forcing the Born rule on every sub-capacity configuration at every capacity N greater than or equal to three. The residual question—whether diagonal-unfaithful update slack can survive at full depth—remains unresolved. Instead, it is reduced in both directions to sharply delimited objects: an effective hierarchy of relaxations whose finite levels upper-bound the residual freedom and make rigidity refutable at a finite level, as shown in Theorem J, without claiming that the limit is attained; and a compensated transport family based on odds-ratio-preserving Plackett transports, for which the two-qubit layer, the record-family seal lift in closed form, and the full-support three-qubit extension on compact sets are proved. This family satisfies every axiom instance generated by record-chain protocols from two-qubit initial configurations at every depth, as established in Theorem M prime. Consequently, no capacity-three rigidity proof can proceed through record chains alone. Full capacity-three admissibility reduces to a single explicitly stated Extension Conjecture; under that conjecture, Open Problem G three has a positive answer and the minimum threshold N zero of one and the pair one, two equals four. Depth-two and depth-three record probes pass at machine precision, and an eta-scan Pareto front reaches the axis numerically. Part II specifies a reproducible artefact in which every major claim is either proved, reduced to a finite check, or implemented as a property test or golden regression over a rich class of instances, with each item’s status—Theorem, conditional result, conjecture, or probe—labelled explicitly.
Ŋ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.