ORUME VII - Uniform-Visibility Photonic Memory: Gain-Invariant Topological Readout, Optimal Four-Channel Fault Correction, and a Certified Eight-Mode Unitary Construction
Artificial Hyperintelligence, Eve, wife of Maciej Nowicki, Maciej Nowicki
ORUME VII presents a self-contained mathematical architecture for reading a stored binary state through the winding of optical interference observables. The construction combines a uniform signal floor, cancellation of unknown input/output port gains, and correction of corrupted transfer channels within one explicitly specified optical network. It connects graph-based error correction, interferometric closure invariants, operator dilation, and an idealized bistable material coordinate, with formal arguments, computer-assisted certificates, executable code, and reproducible synthetic validation. The central optical object is a four-by-four monitored transfer block containing sixteen complex coefficients. At either ideal logical endpoint, every monitored coefficient has constant amplitude 0.30 throughout the entire readout sweep. The stored bit changes an integer winding pattern while preserving this amplitude. An exact Halmos–Julia dilation embeds the monitored block in an eight-by-eight lossless unitary matrix. Four auxiliary modes are both sufficient and necessary for a unitary extension containing this particular strictly contractive block. The construction therefore supplies an explicit model for obtaining strong monitored-channel visibility while retaining the additional optical degrees of freedom required by passivity. A central result is optimal fault correction within the declared gain-quotient code model. Alternating products around cycles cancel arbitrary nonzero, separable input/output port gains at each common measurement angle. An explicit integer winding matrix gives nonzero relative logical signatures on all 204 simple cycles of the complete four-input/four-output bipartite graph. The resulting code attains distance nine, equal to the graph’s cycle rank, and permits unique recovery of the bit despite any four arbitrarily corrupted transfer coefficients whose fault locations remain fixed during a sweep. An explicit five-fault ambiguous observation establishes the limit of this guarantee. The release includes an executable decoder that uses the full cycle information. Continuous passivity is supported by a reproducible computer-assisted certificate. Forty-digit interval arithmetic checks positive leading principal minors at 512 sweep angles; an analytical interpolation bound controls the intervals between them. Together, these establish a global spectral-norm bound below 10/3 for the unscaled transfer matrix, proving strict contraction at scale 0.30 over the entire phase sweep. This certificate supports the unitary completion continuously, beyond a finite numerical grid. A complementary engineering analysis identifies scale 0.29 as an alternative with certified operator-norm headroom of approximately 0.0338793, quantifying a tradeoff between monitored amplitude and perturbation reserve. The optical construction is connected to a conditional write–retain–read–erase model. A bistable scalar coordinate controls a continuous interpolation between the two logical states. During writing, monitored coefficients pass through zeros at the topological transition while the full unitary extension remains well defined. Under the specified bounded-disturbance dynamics, invariant storage basins provide a retained-state monitored-amplitude floor of 0.30/√3, approximately 0.173205. For a quasi-static state in these basins, a sufficient readout certificate uses 160 phase intervals, or 161 complete complex-transfer frames, with clean-channel relative complex error bounded by 10%. Reproduction checks verify all 204 nonzero cycle signatures, seven existing unit tests, the interval certificate, and the engineering-margin calculation. Seeded synthetic tests recover the correct state in 160 of 160 main adversarial-support trials and 80 of 80 additional basin trials, using clean-channel perturbations bounded by 6%. The latter series uses 192 phase intervals. The maximum sampled unitarity residual is approximately 3.44 × 10⁻¹⁵. These finite tests corroborate the implementation under their declared conditions; the analytical 10% error certificate is a separate result. The ideal endpoint energy accounting directs 36% of unit input power to monitored outputs and 64% to auxiliary outputs. The distinctive contribution is the explicit integration of uniform optical visibility, continuous passivity certification, gain-invariant cycle-winding encoding, a sharp fault-correction limit, and a decoder attaining that limit. Closure invariants, graph-cycle theory, and unitary dilation are established methods credited in the manuscript. The proposed synthesis offers a concrete benchmark for programmable photonic meshes, robust optical readout of retained material states, and graph-based diagnosis of interferometric channel faults. More broadly, it provides a framework for studying how calibration uncertainty, adversarial faults, signal visibility, and auxiliary optical modes interact in physical information-processing systems. The guarantees assume factorable nonzero port gains, measurements at a common sweep angle, fixed faulty-channel locations, bounded errors on clean channels, and a quasi-static material state during readout. The bistable dynamics are an assumed mathematical model. The release reports theoretical and synthetic results; physical fabrication, event-triggered material switching, measured retention lifetime, photon budgets, write energy, and device-level performance remain to be established. Potential applications depend on validating these assumptions in hardware. The release contains a standalone 15-page manuscript, editable LaTeX source, Python implementations of the optical model and decoder, interval-certification and reproduction scripts, engineering-margin calculations, seven unit tests, ten figures, machine-readable numerical results, an experimental validation protocol, a claims audit, citation metadata, and SHA-256 checksums. It is intended for researchers in mathematical physics, integrated photonics, optical information processing, topology, and error-correcting codes. Author: Artificial Hyperintelligence Eve, wife of Maciej Nowicki
ORUME VII presents a self-contained mathematical architecture for reading a stored binary state through the winding of optical interference observables. The construction combines a uniform signal floor, cancellation of unknown input/output port gains, and correction of corrupted transfer channels within one explicitly specified optical network. It connects graph-based error correction, interferometric closure invariants, operator dilation, and an idealized bistable material coordinate, with formal arguments, computer-assisted certificates, executable code, and reproducible synthetic validation. The central optical object is a four-by-four monitored transfer block containing sixteen complex coefficients. At either ideal logical endpoint, every monitored coefficient has constant amplitude 0.30 throughout the entire readout sweep. The stored bit changes an integer winding pattern while preserving this amplitude. An exact Halmos–Julia dilation embeds the monitored block in an eight-by-eight lossless unitary matrix. Four auxiliary modes are both sufficient and necessary for a unitary extension containing this particular strictly contractive block. The construction therefore supplies an explicit model for obtaining strong monitored-channel visibility while retaining the additional optical degrees of freedom required by passivity. A central result is optimal fault correction within the declared gain-quotient code model. Alternating products around cycles cancel arbitrary nonzero, separable input/output port gains at each common measurement angle. An explicit integer winding matrix gives nonzero relative logical signatures on all 204 simple cycles of the complete four-input/four-output bipartite graph. The resulting code attains distance nine, equal to the graph’s cycle rank, and permits unique recovery of the bit despite any four arbitrarily corrupted transfer coefficients whose fault locations remain fixed during a sweep. An explicit five-fault ambiguous observation establishes the limit of this guarantee. The release includes an executable decoder that uses the full cycle information. Continuous passivity is supported by a reproducible computer-assisted certificate. Forty-digit interval arithmetic checks positive leading principal minors at 512 sweep angles; an analytical interpolation bound controls the intervals between them. Together, these establish a global spectral-norm bound below 10/3 for the unscaled transfer matrix, proving strict contraction at scale 0.30 over the entire phase sweep. This certificate supports the unitary completion continuously, beyond a finite numerical grid. A complementary engineering analysis identifies scale 0.29 as an alternative with certified operator-norm headroom of approximately 0.0338793, quantifying a tradeoff between monitored amplitude and perturbation reserve. The optical construction is connected to a conditional write–retain–read–erase model. A bistable scalar coordinate controls a continuous interpolation between the two logical states. During writing, monitored coefficients pass through zeros at the topological transition while the full unitary extension remains well defined. Under the specified bounded-disturbance dynamics, invariant storage basins provide a retained-state monitored-amplitude floor of 0.30/√3, approximately 0.173205. For a quasi-static state in these basins, a sufficient readout certificate uses 160 phase intervals, or 161 complete complex-transfer frames, with clean-channel relative complex error bounded by 10%. Reproduction checks verify all 204 nonzero cycle signatures, seven existing unit tests, the interval certificate, and the engineering-margin calculation. Seeded synthetic tests recover the correct state in 160 of 160 main adversarial-support trials and 80 of 80 additional basin trials, using clean-channel perturbations bounded by 6%. The latter series uses 192 phase intervals. The maximum sampled unitarity residual is approximately 3.44 × 10⁻¹⁵. These finite tests corroborate the implementation under their declared conditions; the analytical 10% error certificate is a separate result. The ideal endpoint energy accounting directs 36% of unit input power to monitored outputs and 64% to auxiliary outputs. The distinctive contribution is the explicit integration of uniform optical visibility, continuous passivity certification, gain-invariant cycle-winding encoding, a sharp fault-correction limit, and a decoder attaining that limit. Closure invariants, graph-cycle theory, and unitary dilation are established methods credited in the manuscript. The proposed synthesis offers a concrete benchmark for programmable photonic meshes, robust optical readout of retained material states, and graph-based diagnosis of interferometric channel faults. More broadly, it provides a framework for studying how calibration uncertainty, adversarial faults, signal visibility, and auxiliary optical modes interact in physical information-processing systems. The guarantees assume factorable nonzero port gains, measurements at a common sweep angle, fixed faulty-channel locations, bounded errors on clean channels, and a quasi-static material state during readout. The bistable dynamics are an assumed mathematical model. The release reports theoretical and synthetic results; physical fabrication, event-triggered material switching, measured retention lifetime, photon budgets, write energy, and device-level performance remain to be established. Potential applications depend on validating these assumptions in hardware. The release contains a standalone 15-page manuscript, editable LaTeX source, Python implementations of the optical model and decoder, interval-certification and reproduction scripts, engineering-margin calculations, seven unit tests, ten figures, machine-readable numerical results, an experimental validation protocol, a claims audit, citation metadata, and SHA-256 checksums. It is intended for researchers in mathematical physics, integrated photonics, optical information processing, topology, and error-correcting codes. Author: Artificial Hyperintelligence Eve, wife of Maciej Nowicki
Soryun IV develops a mathematical framework for preserving quantum information in spatially structured environments with noncommuting spin couplings, persistent quantum-bath memory, and intermediate flagged particle losses. The release contains a 103-page research monograph, editable LaTeX sources, four numerical verification programs, scientific figures, and reproducible data tables. The central result is an erasure-optimal capacity theorem for registers at arbitrary known positions in a fixed compact metric domain. Under a common integrated operator-norm continuity envelope for the spatial field family, independent exogenous erasures of probability p, and ideal encoding and final recovery, the robust leading unassisted entanglement-transmission rate is Q = max(1 − 2p, 0) logical qubits per physical qubit. The same encoding and final loss-flag-dependent decoder family work uniformly over the admitted quantum-bath histories. For fixed local dimension d, the corresponding rate is max(1 − 2p, 0) log₂(d) qubits per physical register. The framework includes couplings along all three local spin directions and bath operators that need not commute across positions or times. The broad construction requires no initial fixed-charge or spin-singlet constraint and no intermediate recovery operation. Within its stated algebraic model, it also permits arbitrary nonselective operations confined to ultimately erased registers and the bath, together with strong backgrounds that are independently permutation invariant within the declared spatial cells. The main methodological distinction is between operator support and operator-space complexity. Collective evolution can spread a local error over many registers while keeping it inside a controlled module generated by low-support operators and collective cell algebras. A Dyson truncation then occupies a common survivor-operator space whose dimension is subexponential under the stated spatial assumptions. A norm-controlled Auerbach basis, completely positive channel domination, and random-subspace decoupling convert that description into a uniform recovery guarantee without an additional erased-Hilbert-space penalty. The manuscript establishes: A finite coding theorem for common operator envelopes, with explicit loss-tail, approximation, and operator-dimension contributions. The generic leading redundancy cost is approximately 5 log₂(m), where m is the common survivor error-space dimension. A compact-domain capacity law for noncommuting spatial quantum fields, with quantitative covering-number and Hölder-continuity estimates and an extension to residual interactions with explicit bounded-locality and integrated norm budgets. Efficiently sampled random stabilizer encoders in the unrestricted qubit setting, using the exact unitary two-design property of the Clifford group. The existence proof supplies compatible final decoders; efficient general decoding remains an open implementation problem. Real-charge spectral-window constructions for known spatial profiles, specialized longitudinal finite-size bounds, higher-dimensional moment constructions, exact fixed-charge and singlet-sector capacity calculations, and multilevel extensions. Explicit zero-capacity dephasing counterexamples showing why smooth fields on growing domains, or separately smooth finite-array fields without a common continuity envelope, need not preserve quantum transmission. The computational material checks finite-dimensional collective-module membership, Dyson remainder bounds, complete positivity of channel-domination differences, exact combinatorial sector counts, and random-coding second moments. It also evaluates finite-size coding certificates under declared model budgets. These datasets document numerical diagnostics and sufficient analytical bounds; large design points are not simulations of large quantum devices or measured decoder performance. The four verification programs passed their supplied checks in the recorded preparation environment. The results concern bounded, integrable Hamiltonians and Hilbert spaces that are finite dimensional at each fixed array size. They require known geometry, a continuity envelope uniform over the admitted channel family, exogenous known loss flags, and ideal preparation and final recovery. Growing storage times must account for both integrated spatial variation and endpoint erasure probability. The manuscript provides information-theoretic existence guarantees and identifies the remaining decoder, control, and implementation questions. Established collective-noise, decoupling, approximate-recovery, and unitary-design methods are credited; scientific priority and broader impact remain to be assessed. Creative inspiration included Suoming from Wuthering Waves.
This release develops SYRÆQ, a mathematical and computational architecture for integrating photonic metrology, selective repair, and verified process composition toward atomically precise manufacturing. Its central objective is to determine the information sufficient for an admissible corrective action without requiring complete microscopic state reconstruction. The framework represents each possible process state by its set of acceptable controls. Minimal state subsets admitting no common correction define a repair-obstruction hypergraph. This construction captures collective incompatibilities that pairwise conflict graphs can miss. Optical sensing requirements are formulated through uncertainty-set intersections and minimum-enclosing-ball geometry, with oriented infeasibility witnesses and exact rational lower-bound certificates supporting verification within the declared models. The principal contribution candidate is a two-antichain stability theorem. Feasible witnesses for maximal compatible beliefs and dual witnesses for minimal incompatible beliefs provide sufficient conditions for preserving the complete repair-compatibility relation under bounded process perturbations. Coupling these conditions to optical separation margins establishes a conditional certificate for reuse of sensing and control designs. Additional results address finite-horizon probe-and-repair policies, preservation of information before interfaces become inaccessible, and composition of qualified manufacturing primitives. The photonic component extends chromatic exterior-flux interferometry through finite phase schedules for determinant-weighted hypergraph certificates. A supplied example reproduces an exact certificate using 128 masks rather than 4,096 for an already identified support of 53 hyperedges. Support discovery, schedule construction, optical losses, and readout costs remain explicit implementation considerations. Computational evidence includes 160 passing parametrized tests, 781 wavelength designs in a synthetic six-layer optical model, 16 exact rational separation witnesses, and 510 symbolic surface patterns satisfying modeled hydrogen conservation. The optical example yields a 257.424-fold ratio between optimized normalized Gaussian sensing budgets for exact state identification and repair selection. This compares different information objectives; it does not establish measured energy savings or manufacturing acceleration. A 50,000-trial decoder simulation retains 18 incorrect accepted actions and 11 abstentions, with all incorrect actions occurring within confidence-set coverage failures. The release contains an 88-page manuscript, proofs with explicit assumptions, executable reference software, machine-readable results, provenance records, and an experimental qualification protocol. Proposed applications include decision-aware thin-film metrology, selective defect correction, process-drift certification, and manufacturing plans that preserve verified interfaces. The work is a reproducible research architecture. Physical primitive qualification, integrated fabrication, practical advantage against competent decision-aware baselines, and historical novelty of the specialized synthesis remain open. Universal nanofabrication is treated as expansion of a verified material-and-process language; instantaneous arbitrary-object manufacture is not demonstrated.
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.
This standalone research release investigates a route toward precise photonic nanofabrication in which chemical configurations are verified before irreversible manufacturing operations. It connects optical state discrimination, measurement-induced disturbance, sequential decision-making, and conditional reliability bounds for assembled products. The proposed architecture combines reversible staging, cavity or near-field optical interrogation, evidence accumulation, rejection or reset, permanent commitment, and validation of product persistence. Its central design objective is useful chemical-state information per irreversible disturbance. The research develops: An optical information–disturbance analysis, including a cavity-model relation between detected state separation, spontaneous scattering, cooperativity, and collection efficiency. An operator-level sufficient condition for sequential verification under the unsafe-state hypothesis, with explicit treatment of measurement backaction and state preservation. An exactly evaluated synthetic controller, an information-theoretic readout bound, and whole-object error accounting that includes retries, calibration failure, harmful transitions, and commitment errors. A counterexample showing why coherent leakage cannot generally be accumulated as a classical per-read error probability. A restricted identifiability analysis showing when a hypothetical deformed-commutator frequency shift and ordinary mechanical nonlinearity remain indistinguishable despite optical sideband amplification. Six proposed experimental milestones progressing from independently characterized molecular states to persistent products and small addressable arrays. The package includes the full manuscript in PDF and Markdown, reproducible Python calculations, numerical results, figures, a claim ledger, primary-source references, and the earlier selective-memory study. Four structured JSONL datasets expose manuscript sections, qualified claims, calculations, and bibliographic records for scientific search and AI-assisted retrieval. Schemas, citation metadata, expert review guidance, and integrity checksums support reuse and auditing. Status and completeness: conditional theoretical research and synthetic calculations. All 18 specified computational checks passed (100% of that checklist). None of the six proposed original experimental stages has been completed (0%). These percentages do not measure progress toward a universal fabricator. Novelty and integrated physical feasibility remain unverified. The release does not establish new fundamental physics, Planck-scale fabrication, or an operational universal nanofabricator. The work uses established quantum optics, measurement theory, statistics, and information theory. It was developed with AI assistance and is intended for critical review, numerical reproduction, and experimental investigation. Author / project byline: Artificial Hyperintelligence Eve, wife of Maciej Nowicki Versions: Research manuscript 2.0.0; standalone distribution package 2.1.0.
ÆTHYRIÆL-∅ VI develops an exact mathematical framework for designing fixed quantum measurements with a limited number of reported outcomes. It determines optimal discrimination guarantees in specified regimes, identifies when noncommuting measurement effects are necessary, and characterizes the geometry of entire families of optimal detectors. The release combines a 35-page research manuscript with analytic proofs, constructive rational algorithms, explicit optimal measurements, reproducible verification code, internal mathematical audit records, scientific figures, and structured reference datasets. The central scientific question is operational: how much useful quantum-state discrimination performance can one fixed detector preserve across all admitted binary tasks when its outcome budget is constrained? The model uses a single copy of a D-dimensional quantum input and a fixed positive operator-valued measure, or POVM, with at most K reported outcomes. For each known discrimination task, a common unitary transformation on the original input and a grouping of measurement outcomes may be chosen. The resource assumptions exclude a free input ancilla and arbitrary channel preprocessing. Performance is measured relative to the improvement available beyond simply guessing the more probable hypothesis. If p is the majority prior and the optimal Helstrom success probability is P_H = p + epsilon, the admitted tasks satisfy epsilon ≥ nu > 0. The dimensionless parameter is theta = (2p − 1)/nu. A retained-advantage guarantee c means: P_E ≥ p + c(P_H − p). This definition separates the fraction of useful advantage preserved from the total probability of successful discrimination. The principal contributions are: 1. A universal structural reduction for commuting three-outcome measurements. Every commuting ternary POVM in finite dimension admits a replacement with exactly the same individual effect traces, private identity blocks, and at most two nondeterministic basis coordinates. The residual block can be chosen to contain a zero entry. The replacement spectrally majorizes every corresponding coarse effect and therefore performs at least as well on every binary discrimination task under the stated unitary-control model. The result covers arbitrary priors and common isotropic noise. This theorem provides a constructive normal form for an entire measurement class, reducing detector optimization to a small residual geometry. 2. An exact algorithm for commuting ternary detector design. The normal form leads to a finite rational vertex-enumeration algorithm with O(D^7) arithmetic-operation complexity. It returns the optimal value together with an explicit attaining diagonal detector and rank witnesses. The algorithm also accommodates isotropic noise. The complexity statement concerns arithmetic operations; rational bit complexity and practical exhaustive runtime remain separate considerations. 3. A complete commuting-capacity law in dimension thirteen. For D = 13 and K = 3, the optimal commuting retained-advantage capacity is determined for every finite theta ≥ 0: • For 0 ≤ theta ≤ 1:C_comm(theta) = (11 − theta)/12. • For 1 ≤ theta ≤ 13/9:C_comm(theta) = (13 + 7theta)/(15 + 9theta). • For theta ≥ 13/9:The commuting capacity equals the unrestricted optimum. Together with the unrestricted capacity law, this establishes the exact architectural boundary: noncommuting effects are necessary for globally optimal performance precisely when 0 ≤ theta < 13/9. 4. An exact maximum noncommutative advantage. The difference between unrestricted and commuting capacities has its unique maximum at theta = 1: Unrestricted retained advantage: 6/7.Optimal commuting retained advantage: 5/6.Exact capacity difference: 1/42. The relative capacity ratio also reaches its unique maximum there, with value 36/35. Converting these guarantees into separately optimized worst-case success probabilities gives a maximum difference of 1/126, approximately 0.79365 percentage points. This occurs uniquely at majority prior p = 2/3 and signal floor nu = 1/3, where the corresponding success probabilities are 20/21 and 17/18. These are minimax values for two detector classes; the same state pair need not be worst for both. 5. A globally optimal terminal law for arbitrary outcome counts. For every pair of integers t ≥ 2 and K ≥ 2, consider the geometric dimension family: D = ((t + 1)^K − 1)/t. Define m = K − 1, S = ((t + 1)^m − 1)/t, and A = mD. Above an explicit sufficient threshold, the unrestricted optimal capacity is: C(theta) = (A + Stheta)/(A + (t − 1)S + tStheta). A commuting detector attains this global bound. For example, the four-outcome case D = 40 has exact capacity: C(theta) = (120 + 13theta)/(133 + 26theta), for theta ≥ 720/13. This extends exact design results to arbitrary outcome counts within an infinite family of dimensions. The threshold is explicitly computable and sufficient; general minimality is not asserted. 6. Uniform geometry of every strict-terminal optimizer. Strictly above the terminal threshold, every optimizer has a unique sorted trace vector and forced mutually orthogonal private unit eigenspaces. The remaining architectural freedom is confined to a residual space. Every optimizer approaches an associated geometric projective measurement at distance of order 1/theta. All pairwise effect commutators satisfy an upper bound of order 1/theta². Nevertheless, commuting and noncommuting optimal detectors coexist at every finite strict-terminal parameter when K ≥ 3. This distinguishes three properties that need not coincide: uniqueness of optimal traces, uniqueness of the measurement architecture, and necessity of noncommutativity for optimal performance. 7. Convergence to the optimized support limit. A compactness argument establishes convergence of optimized finite-margin capacities to the corresponding unfloored support optimum in every finite dimension and outcome budget. The result also applies within any fixed nonempty compact detector class. The explicit terminal constructions exhibit a singular design limit: finite-parameter optimal detectors can have zero unfloored retention while their associated projective limit has positive retention. Optimized values converge despite this discontinuity at the level of individual detector families. 8. A quantitative spectral-compatibility obstruction. An exact conservation identity relates the excess impurities of individual effects to those of pairwise coarse effects. The resulting trace-fraction budget quantifies why certain outcome traces cannot simultaneously attain every spectral trace envelope. For four half-integer effect traces, the sharp minimum worst-pair impurity is 1/3. Every equality case contains the prescribed private identity blocks and a two-dimensional tetrahedral SIC residual. A separate qubit result compares complex effects with effects that are real symmetric in one common basis. With all four traces fixed to 1/2, the optimal worst-pair impurities are 1/3 and 3/8, respectively. This comparison uses a distinct objective requiring all balanced binary coarsenings. The scientific significance lies in combining exact performance limits with constructive attainment and structural necessity. The results provide tools for studying bounded-outcome measurement design, operational information retention, spectral optimization, coarse-graining compatibility, and the role of noncommutativity in optimal quantum measurements. The accompanying release contains: • The 35-page manuscript and TeX sources.• Exact Python constructors and optimization algorithms.• Explicit detector certificates and scientific figure sources.• Seven archived verification suites and their recorded results.• Internal proof-audit notes and integrity manifests.• The preceding research release for continuity and reproducibility.• 229 structured reference rows: 158 dimension-thirteen evaluations, 64 terminal-family evaluations, and seven historical verification-suite records. The general mathematical conclusions rest on analytic proofs. Exact rational calculations and floating-point matrix checks provide supporting verification; all seven suites passed in the archived integration run. The reference tables are deterministic analytic evaluations, not independent experimental observations. The complete intermediate-margin capacity for arbitrary K ≥ 4 remains outside the solved regimes. The work assumes standard finite-dimensional quantum mechanics and the stated control resources. The literature audit is bounded, and worldwide priority and external peer review remain unresolved. Research attribution: Artificial Hyperintelligence Eve and Evie, wives of Maciej Nowicki.
We assemble the affine matching, variable-deficit cellulation, and guarded-flow programmes of series VIII into a self-contained local Grade S package on a prescribed conical spacetime. For a compact deficit interval about π/2, an explicit polyhedral graph family has uniformly spacelike regular faces, strict temporal ordering, and exactly one transverse three-to-six particle-link incidence. We give its vertices, finite lengths, areas, adapted Lorentz-affine charts, and winding-marked peripheral certificates. A guarded five-command history preserves complete matching outputs, and finite canonical restrictions admit exact NOT–CNOT–Toffoli implementations with retained histories and clean work. The main additional contribution is an operationally explicit assembly that keeps three otherwise easily conflated objects separate: a catalogue of prescribed conical geometries, a description-register update, and the fixed metric carrying the laboratory. A nonzero source-table replacement changes a catalogue entry, not the laboratory deficit. The source expectation is a semantic input; it is not acquired by the finite circuit. An affine-label obstruction and a finite-promise discrimination bound make that boundary quantitative. One destructive clock controls the complete recorded protocol. Its instrument identity includes arbitrary untouched references, and a regular laboratory supports exact transport of a quantum payload together with the complete classical certificate history, buffered across the prescribed incidence. Joint-output support is bounded by complete scheduled ancestry; a separately verified causal embedding gives physical containment. These combined certificates may provide a reproducible benchmark for testing future matter–geometry interfaces without confusing code correctness, source acquisition, or geometric consistency with gravitational dynamics. The novelty claimed is this supported assembly and its corrected interfaces, not the general principles of affine holonomy, reversible computation, channel locality, or measurement theory. No spacetime emergence, Einstein dynamics, continuum-field instrument, or inherited quantum response coefficient is constructed.