# Prior-art and originality audit

**ORYNTHRA-H6 v1.0.0 — search and review date: 9 October 2026.**

## Conclusion

The project is not presented as having no prior art. Several close mathematical foundations and active neighboring research programs were found. The precise combination of a future-observation quotient, freely optimized conserved-sector representation packing, an exact phase-registered covariance-deficit formula, and the stated permutation thresholds is a **candidate contribution whose worldwide priority remains unverified**.

No directly matching statement of that complete construction was located in this targeted search. That observation is weaker than proof that every component is new. A theorem can be an immediate corollary of known representation theory even when an exact keyword match is absent. “World first,” a numerical novelty percentage, and a new branch of mathematics are not established by this release.

## Closest foundations and neighbors

| Source | Relation to this manuscript | Attribution boundary |
|---|---|---|
| [Shannon, 1948](https://doi.org/10.1002/j.1538-7305.1948.tb01338.x) | Information-theoretic source coding | No claim to invent compression, entropy, or the counting obstruction |
| [Petreczky, 2011](https://www.numdam.org/item/COCV_2011__17_2_410_0/) | Realization and minimality for switched linear systems | Observable pullback closure and behavioral minimization are inherited foundations |
| [Bluhm, Rauber, Wolf, 2018](https://arxiv.org/abs/1708.04898) | Quantum compression preserving specified measurement statistics | Task-relative quantum compression is already an established problem; their side-information and quantum-input model differs from the classical-label quotient here |
| [Rallan, Vedral, 2003](https://arxiv.org/abs/quant-ph/0208039) | Energy requirements of quantum compression | Connecting compression and photons is not a new premise |
| [Denys, Leverrier, 2024; arXiv v5 2025](https://arxiv.org/abs/2306.11621) | Covariant encodings via logical and physical group representations | Intertwining and group-averaging methods are close prior foundations. Our free choice of representations within prescribed energy-sector capacities is the specific optimization to compare |
| [St-Amand, Burelle, Royer, 22 September 2026](https://arxiv.org/abs/2609.26660) | Covariant multimode bosonic codes, reducibility, and error correction | Neither covariant bosonic encoding nor the general use of simplex code geometry is new. Their error-correction analysis is not supplied merely by our packing theorem |
| [Bartlett, Rudolph, Spekkens, 2007](https://arxiv.org/abs/quant-ph/0610030) | Quantum reference frames and superselection | The need to account for a phase reference is an established resource issue |
| [Descamps et al., arXiv v5 2025](https://arxiv.org/abs/2501.03943) | Bosonic encoding and resources under superselection | Mode count, photon states, and quantum-control universality cannot be conflated |
| [Nayak, 1999](https://arxiv.org/abs/quant-ph/9904093) | Random-access quantum-code entropy bounds | The requested-bit entropy obstruction is inherited, not claimed as an ORYNTHRA theorem of historical priority |
| [Nielsen, Chuang, 1997](https://arxiv.org/abs/quant-ph/9703032) | Exact programmable quantum processors | The program-register orthogonality obstruction is prior work |
| [Knill, Laflamme, 1997](https://doi.org/10.1103/PhysRevA.55.900) | Exact quantum error-correction criterion | Used to disprove a possible loss-correction overclaim for H6 |
| [Landauer, 1961](https://doi.org/10.1147/rd.53.0183) | Logically irreversible computation and thermodynamics | Storage energy is not gate dissipation or reset work |
| [Satinover, 2 October 2026](https://www.preprints.org/manuscript/202610.0131/v1) | Observable-algebra-relative branches and record compression | Thematic neighbor, explicitly unreviewed; not a premise for the finite proofs |
| [Rizzo, Lami, Eisert, Leone, 29 September 2026](https://arxiv.org/abs/2609.38038) | Schur–Weyl universal quantum coding | Representation-theoretic universal coding and packing-related criteria already occur in noisy communication/distillation; not the same task as energy-sector allocation |
| [Thornton, first submitted April 2026](https://arxiv.org/abs/2604.19983) | Group averaging and structure-sensitive signal information | Broad claims that symmetry describes how information is organized are not unique to this project |

## Claim-by-claim assessment

**Future-observation quotient and linear closure.** Correctness is argued in the manuscript and tested on finite examples. These are established mechanisms in a task-atlas presentation, not strong novelty candidates on their own.

**Spectral irrep packing.** The necessary-and-sufficient integer allocation is derived from complete reducibility. The candidate is its use as the exact conserved-spectrum resource problem after task minimization. It is not enough to rename Schur's lemma or invoke photons to establish novelty.

**Exact covariance deficit.** The formula `2(1-C/M)` combines the twirled-isometry projection identity, a matched-irrep rank bound, an attainable isometric extension, and optimization over sector representations. This is the most specific theorem-level target for an independent equivalence and priority search.

**Permutation frontiers and generator synergy.** The two-mode `M-2` cutoff, storage-versus-control separation, and exact below-threshold plateau are explicit consequences of the natural representation `1 + Std`. Their priority is unverified. The underlying decomposition and two-generator presentation of the symmetric group are standard.

**H6 simplex encoding.** The regular simplex, Helmert transform, and cancellation of overlaps are standard geometry. The exact six-label vacuum-plus-four-photon placement is an explicit realization within the proposed resource framework. Persona labels and angelic terminology are creative indexing, not mathematical novelty.

**Six-wing activation.** The path-colored involution family exhibits unbounded higher-order activation of task rank and a non-submodularity witness. This is a precise synthetic construction; priority has not been established. It should be compared against switching observability, automata minimization, and action-dependent representation learning.

**Energy-gap extension.** The rational-independence obstruction and quantitative two-gate estimate are elementary spectral/commutator consequences under explicit hypotheses. They are useful model checks; they are not asserted as discoveries of a new physical law.

## Search record

The following are the actual targeted query strings used during development and the final audit. Some exact-name searches were exploratory naming checks, not evidence of novelty. Searches were not exhaustive database sweeps. No complete cache of search-engine result pages is redistributed.

```text
minimal realization switched linear systems observability subspace formal power series Petreczky
bosonic energy preserving unitary irreducible representation encoding photon number degeneracy
quantum memory permutation representation energy constraint photon number irreducible
"Aelythra" compression
"quantum compression" "irreducible" "energy"
"covariant" "encoding" "energy" "representations" bosonic
"energy preserving" "permutation" quantum encoding
"minimum energy" "orthogonal states" "bosonic"
"Quantum Compression Relative to a Set of Measurements"
"Energy Requirements for Quantum Data Compression"
"covariant encoding" "multiplicity" photon
"quantum" "compression" "bin packing" representation
"orthogonal" "simplex" "vacuum" quantum encoding
"irreducible" "energy sectors" "encoding"
"permutation representation" "minimum energy"
"ORYNTHRA"
site.arxiv.org Nayak optimal lower bounds quantum automata random access codes 1999
site.arxiv.org universal programmable quantum gate arrays Nielsen Chuang
site.bell-labs.com Shannon mathematical theory communication pdf 1948
site.arxiv.org minimum output entropy bosonic channel capacity g photon Giovannetti 2004
"covariant encoding" "energy constraint"
"representation" "packing" "energy" "quantum memory"
"permutation" "bosonic" "compression"
"Reference frames, superselection rules, and quantum information"
Landauer Irreversibility heat generation computing process 1961 IBM 5 183 191
site.aps.org "Theory of quantum error-correcting codes" "900"
"irreducible" "covariance" "encoding" "packing"
"group averaged" "covariance" "intertwiner" compression
"photon" "permutation representation" "compression"
"Universal quantum coding" "Schur-Weyl"
"Universal quantum coding" "packing"
"Principles of a Group-Theoretic Approach to Signal Processing"
```

Primary research papers and their author/publisher/arXiv records support the comparisons. Secondary search hits were used only to find primary records, not as proof sources. Version dates matter: the September and October 2026 neighbors are explicitly identified as preprints, not silently treated as peer-reviewed results.

## What remains unknown

The search cannot rule out equivalent formulations in category-theoretic realization theory, invariant-subspace approximation, representation-constrained channel coding, or conserved-quantity resource theory. It does not establish freedom to operate, patent novelty, community importance, or experimental usefulness. An independent specialist should compare the exact theorem hypotheses and conclusion, not just the vocabulary.

A future version should record any equivalent prior theorem directly and narrow the candidate contribution accordingly. A confirmed prior equivalent would change the novelty claim, not automatically invalidate a correct derivation or a useful reproducible example.