BioSight/docs/FOUNDATIONAL_GUIDANCE.md

Foundational Guidance: Why 8 Positionals

SilverSight — The 8-Position Character Map as Constraint Encoding

The Question

The choice of 8 positions for the SilverSight character map appears arbitrary. Why not 4, 6, 16, 32? The answer is that 8 is the smallest integer simultaneously satisfying three tiers of constraints: two hard selectors (Nyquist, Q16_16) that force N=8 uniquely, two backward-compatibility constraints (DNA sub-alphabet, computational leverage) that make N=8 the smallest viable superset of natural DNA, and four supporting constraints (Chentsov, Sidon, Hachimoji, Baker) that are consistent with N=8 but not uniquely forcing it.

---

Preamble: Why DNA at All? — The Research Arbitrage

Before asking "why 8," an outsider must ask "why DNA." The answer is not biological — it's strategic. DNA is the most heavily reviewed domain in human scientific history by orders of magnitude, and it has a peer-reviewed existence proof that hard computational problems can be solved via DNA encoding.

The landmark result: Adleman (1994) solved a 7-vertex directed Hamiltonian path problem — an NP-complete problem — using only standard DNA bases (A, T, G, C) and off-the-shelf molecular biology protocols (ligation, PCR, gel electrophoresis, affinity purification). Published in Science 266:1021–1024, this paper marked the birth of DNA computing and demonstrated that any NP problem can be encoded as a DNA sequence and solved with existing biochemical infrastructure.

Adleman's encoding was simple: each vertex received a random 20-mer DNA sequence; each edge was the complementary splint connecting two vertices. After mixing, DNA molecules encoding all possible paths formed in parallel (\sim 10^{14} molecules per reaction). The correct Hamiltonian path was isolated using standard laboratory techniques — no novel chemistry required.

Lipton (1995, Science 268:542–545) generalized this: any SAT problem with n variables can be encoded as O(n) DNA strands, and all 2^n possible assignments are generated in O(1) wet-lab steps. The DNA computer's parallelism — trillions of molecules reacting simultaneously — is the entire point. The verification is inherited from molecular biology's existing toolkit.

This is the research arbitrage: You don't need to invent a new computational paradigm. You encode your hard problem onto DNA space, and then:

• The existence proof is Adleman 1994 (cited 4000+ times, never retracted)
• The parallelism is $10^{14}$-fold (one test tube outperforms any desktop CPU for search)
• The validation infrastructure is molecular biology (PCR primers, restriction enzymes, sequencing)
• The peer review is the 50,000+ papers that have built on Adleman's result without refuting it

Billions of dollars of research funding have since produced:

• Thermodynamic nearest-neighbor models verified to within 0.1°C (SantaLucia 1998, 4000+ citations)
• Sequence alignment algorithms attacked, defended, and refined by thousands of PhDs over 50 years (Smith-Waterman 1981, BLAST 1990)
• Industrial-grade file formats with formal grammars, reference parsers, conformance test suites (FASTQ, BAM, VCF, GFF3)
• Cloud-scale infrastructure costing millions per year to keep live (NCBI BLAST, Ensembl, UCSC Genome Browser)

Three independent software encoding mechanisms exist for ingesting DNA into computational pipelines:

Format	Function	Corresponds to
FASTQ	Raw sequences + quality scores	Raw equation character strings + confidence
BAM/SAM	Aligned sequences with metadata	Equations mapped to reference structure
VCF	Variants relative to reference	Differences between similar equations
GFF3	Annotated features	Parse tree structure + semantic labels

Each has multiple independent implementations, formal validation, and community-maintained test data. This is infrastructure that no startup or research group could replicate.

The Smuggling Strategy

The core move: encode a hard computational problem as a DNA optimization problem, then exploit the existing validation infrastructure as a free correctness proof.

The problem (equation classification, semantic clustering, concept basin identification) is NP-hard in general — no polynomial algorithm exists. But:

1. DNA optimization algorithms are already funded and deployed. Smith-Waterman on GPU, BLAST with SIMD, k-mer counting with O(1) memory — these exist because the NIH, Wellcome Trust, and others paid for them.
2. DNA tools are peer-reviewed to death. Any flaw in a widely-used BLAST heuristic would have been caught by the 50,000+ papers that cite it. The Smith-Waterman dynamic programming recurrence has been formally verified.
3. DNA file formats are infrastructure, not prototypes. FASTQ parsers exist in every bioinformatics toolkit, with fuzz testing, error handling, and performance optimization already done.

The encoding is the invention. The optimization is inherited.

This justifies the DNA analogy before any discussion of alphabet size. If the problem were encoded as, say, a custom binary format, the first question would be "how do you know your parser is correct?" With DNA encoding, that question is answered by "existing FASTQ parsers have been battle-tested on petabytes of real data."

Why Not Skip DNA and Use Generic Optimization?

Generic optimization (linear programming, gradient descent, simulated annealing) requires proving everything from scratch: convergence rate, error bounds, parameter sensitivity, correctness of the implementation. DNA optimization inherits 60+ years of these proofs.

The cost is the encoding step — mapping the problem onto DNA space. The payoff is that every subsequent step can use off-the-shelf tools with established reliability.

The Three Encoding Tiers Map to the Three Layers

Problem Layer	DNA Analogue	Existing Tool
Byte histogram → \Delta_7	k-mer spectrum	Jellyfish, KMC, BBNorm
Parse tree structure → \tau(E)	GFF3 annotation	BEDTools, IGV, GATK
Semantic equivalence → concept basins	Phylogenetic distance	PHYLIP, RAxML, IQ-TREE
Consistency rules (Layer 4)	Read QC filters	FastQC, Trimmomatic, bcftools

Each layer of the SilverSight binding maps to an established DNA analysis domain. The mathematical work is the mapping. The computation is already done, funded, and verified.

---

Tier 1: Hard Selectors

These constraints independently force N=8 given the architectural commitments. No smaller N satisfies either; larger N satisfies them but introduces unnecessary complexity.

---

1. The Nyquist Constraint (Phase Topology)

The phase circle S^1 is discretized into 8 positions at 45° increments:

Index	Base	Phase
0	A	0°
1	B	45°
2	C	90°
3	G	135°
4	P	180°
5	S	225°
6	T	270°
7	Z	315°

The Nyquist sampling theorem requires the sampling rate to be at least twice the maximum frequency component. The forward/reverse transition occurs at 180° (the π cut). With 8 samples at 45° spacing, the Nyquist frequency is f_{\text{Nyquist}} = 1/(2 \cdot 45°) = 1/90° per sample. This means:

• Phase differences up to 90° are fully reconstructible from the 8-position encoding
• The critical regime (phase = 90° ± ε) is where beautiful ↔ ugly transitions occur
• The ambidextrous state (phase = 0° or 180°) is exactly the DC and Nyquist frequency — the two points where the discrete Fourier basis is purely real

With 4 positions (natural DNA, 90° increments), Nyquist would be at 180°/4 = 45°, meaning phase differences > 45° would alias — failing to distinguish forward from reverse in the critical regime. With 8 positions, the critical boundary at 90° is exactly the Nyquist frequency, making the forward/reverse distinction sampling-theoretically optimal.

---

2. The Q16_16 Fixed-Point Constraint

All computation uses Q16_16 fixed-point arithmetic:

\text{Q16}(x) = \text{clamp}(-2^{31},\; \lfloor x \cdot 2^{16} \rfloor,\; 2^{31}-1)

The 8-position encoding maps directly onto Q16_16 arithmetic:

• 3 bits index one of 8 bases (\lceil \log_2 8 \rceil = 3)
• 8 positions × 3 bits = 24 bits per character, fitting in one Q16_16 word (32-bit signed, 16-bit fractional)
• The remaining 8 bits encode metadata (chirality, direction, regime)
• No floating point enters the compute path

Adjacent alphabet sizes show the tightness of this fit:

Alphabet size	Bits per base	8 positions × bits	Word fit	Metadata room
4	2	16 bits	One word, 16 bits wasted	Yes (plenty)
8	3	24 bits	One word, exact fit	8 bits
12	4 (rounded up)	32 bits	One word, zero metadata	No
16	4	32 bits	One word, zero metadata	No
32	5	40 bits	Spills to second word	—

At N=4, half the word is wasted. At N=12 and above, metadata vanishes or the encoding spills to a second 32-bit word. N=8 is the only alphabet size that packs an integer number of bases (8) at an integer number of bits per base (3) into a single 32-bit word with metadata room.

The chirality classification uses the same Q16_16 dual-number structure:

q = q_r + \varepsilon q_d,\quad \varepsilon^2 = 0,\qquad \chi = \frac{|q_r|^2}{|q_r|^2 + |q_d|^2}

The three-state chirality (ambidextrous / left / right) is determined by:

\chi > \tfrac12 \implies \text{compressive},\quad \chi < \tfrac12 \implies \text{anti-compressive},\quad \chi = \tfrac12 \implies \text{critical}

At \chi = 1/2, the dual component exactly balances the real component — the ambidextrous fixed point corresponds to phases 0° and 180° (the DC and Nyquist frequencies of the phase circle). This is the only point where the discrete Fourier basis on ℤ₈ is purely real, and it's exactly where chirality becomes undefined (both left and right compressions yield identical results).

---

Tier 2: The Backward-Compatibility Lever

These constraints explain why N=8 is better than N=4 (the biologically validated alternative) despite N=4 having more literature. They do not force N=8 uniquely but make N=8 the most strategic choice among viable candidates.

---

3. The DNA Sub-Alphabet Constraint (Backward Compatibility)

The hachimoji encoding contains natural DNA as a strict sub-alphabet:

Hachimoji (8)	Natural DNA subset (4)
A (0°)	← A
B (45°)	—
C (90°)	← C (via ASCII reorder: standard DNA ordering is A/C/G/T; hachimoji ASCII-ordering is A/B/C/G/P/S/T/Z, so C is index 2)
G (135°)	← G
P (180°)	—
S (225°)	—
T (270°)	← T
Z (315°)	—

Every 4-base DNA sequence is a valid hachimoji sequence. The converse is false — the 4 extra bases provide the expanded constraint space. This gives a computational inheritance:

Any tool, algorithm, or mathematical result that applies to {A, C, G, T} sequences applies to the projection of any hachimoji sequence onto its natural-DNA subsequence. This includes 60+ years of DNA computational modeling.

N=6 cannot make this claim — there is no biologically validated 6-base superset of natural DNA. N=16 (hex) cannot make this claim — there is no known biology with 16 bases or any biological justification for a hex alphabet. The backward compatibility is unique to N=8 among all N > 4.

---

4. The Computational Leverage Constraint (DNA Math Sorts / Research Arbitrage)

Natural DNA computation is a mature field with well-understood "DNA math sorts" — optimization problems with efficient algorithms. The preamble's smuggling strategy becomes concrete here:

DNA Sort	Algorithm	Complexity	Inherited Validation
Nearest-neighbor thermodynamics	SantaLucia 1998	O(n²) per sequence	Verified within 0.1°C; 4000+ citations
Sequence alignment	Smith-Waterman, BLAST	O(n²) / O(n) heuristic	50+ years of adversarial review; GPU implementations
k-mer spectra	Jellyfish, KMC, BBNorm	O(n)	Used on petabytes of sequencing data
GC content optimization	Linear scan	O(n)	Biological ground truth; validated across genomes
Codon usage bias	CAI, ENC	O(nk)	Verified against protein expression assays
Phylogenetic distance	Jukes-Cantor, Kimura	O(n²)	Maximum likelihood validated by simulation
Secondary structure	Mfold, ViennaRNA	O(n³)	Thermodynamic parameters from UV melting curves

Each of these is a sort on the space of DNA sequences: alignment scores rank candidates, thermodynamic stability ranks structures, k-mer spectra rank compositions. The 8-position encoding inherits all:

1. Project any hachimoji sequence to its {A, C, G, T} subsequence
2. Apply any DNA sort to the projection using existing, battle-tested software
3. The 4 synthetic bases refine the ranking with additional constraint dimensions invisible to the DNA sort

The three encoding mechanisms from the preamble operationalize this:

• FASTQ pipeline: raw equation strings → k-mer spectra → Fisher distance on \Delta_7 (Layer 1)
• BAM/SAM pipeline: aligned sequences → structural comparison → topological distance on \tau(E) (Layer 3)
• VCF pipeline: variant calls → edit-distance-like metrics → concept basin boundaries (Layer 4)

No other alphabet size provides this inheritance. N=4 has the tools but insufficient expressiveness (4 bases = 2 k-mers cannot distinguish 8 syntactic classes). N=16 has neither the tools nor the biological anchor — building a 16-base thermodynamic model from scratch would require millions in funding and years of calibration. The research arbitrage only compounds at N=8.

Natural DNA computation is a mature field with well-understood "DNA math sorts" — optimization problems with efficient algorithms:

DNA Sort	Algorithm	Complexity	Inherited from
Nearest-neighbor thermodynamics	SantaLucia 1998	O(n²) per sequence	Melting temperature, hybridization energy
Sequence alignment	Smith-Waterman, BLAST	O(n²) / O(n) heuristic	Locality, homology detection
k-mer spectra	Jellyfish, KMC	O(n)	Compositional uniqueness
GC content optimization	Linear scan	O(n)	Isochore structure, stability constraint
Codon usage bias	CAI, ENC	O(nk)	Expression level optimization
Phylogenetic distance	Jukes-Cantor, Kimura	O(n²)	Evolutionary divergence
Hybridization kinetics	Mfold, ViennaRNA	O(n³)	Secondary structure prediction

Each of these is a sort on the space of DNA sequences: alignment scores rank candidate matches, thermodynamic stability ranks candidate structures, GC content ranks sequences by a simple energy proxy. The 8-position encoding inherits all of these:

• Project any hachimoji sequence to its {A, C, G, T} subsequence
• Apply any DNA sort to the projection
• Use the 4 extra base positions to refine the ranking (the 4 synthetic bases add additional constraint dimensions that the DNA sort cannot access)

This is the leverage multiplier: the 4 synthetic bases add expressiveness, but the 4 natural bases buy computational tools. No other alphabet size provides this inheritance — N=4 has the tools but not the expressiveness; N=16 has neither the tools nor the biological anchor.

---

Tier 3: Supporting Constraints

These constraints are consistent with N=8 but do not independently force it. They enrich the mathematical structure available at N=8 and help explain why the framework works, but should not be presented as forcing the choice.

---

5. The Chentsov Constraint (Information Geometry)

Chentsov's theorem states that the Fisher-Rao metric is the unique Riemannian metric (up to scaling) on the probability simplex that is monotone under Markov embeddings:

\Delta_{N-1} = \{p \in \mathbb{R}^N : p_i > 0,\; \sum p_i = 1\}

g_p(u,v) = \sum_{i=1}^N \frac{u_i v_i}{p_i}

The Fisher metric is non-degenerate for any N ≥ 2, and Chentsov's uniqueness holds for all N. N=8 provides nothing special here that N=6 or N=12 would not. The homotopy argument connecting to S⁷ is mathematically correct but unused in the actual framework — it is a curiosity, not a constraint. Included to show the geometric space is well-formed, not to force N=8.

---

6. The Sidon Constraint (Additive Combinatorics)

A Sidon set is a subset A \subset \mathbb{Z} where all pairwise sums are distinct:

a + b = c + d \implies \{a,b\} = \{c,d\}

The canonical 8-element Sidon set is powers of 2:

A_8 = \{1, 2, 4, 8, 16, 32, 64, 128\}

This is the maximal geometric-progression Sidon set in \mathbb{Z} — the 9th power 256 creates a collision with {128, 2} + {130, ...} = 258. However, Sidon sets of size 8 also exist at many other sizes: Singer sets give N = p+1 for any prime p, producing Sidon sets of size 8, 12, 14, 18, 20, 24, 30, 32, 38, 42, 44, 48, 54, 60, 62, 68, 72, 74, 80, 84, 90, 98, 102, 104, 108, 110, 114, 128, ... The constraint "must be a geometric-progression Sidon set" is a design choice, not a mathematical necessity.

For the braid crossing matrix

C \in \{0,\tfrac14,\tfrac12,\tfrac34\}^{8\times 8}

the Sidon property ensures unique strand interaction signatures. A Singer set of size 12 would also work. N=8 is the minimum required for non-trivial braid topology (fewer than 8 strands cannot produce the eigensolid convergence structure), but many larger N also satisfy this.

---

7. The Hachimoji Constraint (Biological Encoding)

Natural DNA uses 4 bases (A, T, G, C) with Watson-Crick pairing. Hachimoji DNA extends this to 8 bases by adding 4 synthetic nucleotides (P, Z, B, S) with engineered complementarity:

Natural (4)	Synthetic (4)	Total (8)
A (0°)	P (180°)	Forward ↔ Reverse axis
T (270°)	S (225°)	Quadrant II
G (135°)	C (90°)	Quadrant I
Complement pairs	Engineered pairs	Full 8×8 interaction

This provides a biologically grounded analogy, which is valuable for communication and conceptual anchoring. But it is not a mathematical constraint — synthetic biology has demonstrated 6-base, 10-base, and 12-base alphabets (Hoshika et al. 2019, Kimoto et al. 2017). The hachimoji constraint explains why the system is easy to reason about (biological intuition), not why it must be N=8.

---

8. The Baker Rigidity Constraint (Transcendence Theory)

Baker's theorem provides effective lower bounds on linear forms in logarithms:

\Lambda = \sum_{i=0}^{n} \beta_i \log \alpha_i \neq 0 \implies |\Lambda| > e^{-C \cdot \prod A_i \cdot \log B}

This is a rigidity gap prototype: distinct algebraic combinations cannot approach zero arbitrarily closely. In the SilverSight framework, this gap is mirrored by the SOS certificate:

\text{gap}(x,m) \geq 0 \text{ on } K = [2,90] \times [3,13]

The Baker analogy is structural (both have gaps), not computational (the mechanism is different: transcendence theory vs. polynomial non-negativity). The 8-position encoding is consistent with this gap structure but does not depend on it — the SOS certificate would work for any N.

---

Synthesis: The Three-Tier Hierarchy

Tier	Constraint	Forcing power	Unique to N=8?
1	Nyquist	Hard — N < 8 aliases forward/reverse at critical boundary	Yes, given 45° resolution commitment
1	Q16_16 packing	Hard — only N=8 fits 8 bases × 3 bits = 24 bits in one word with metadata room	Yes
2	DNA sub-alphabet	Soft — N=8 is smallest superset of natural DNA	Yes, among N > 4
2	Computational leverage	Soft — inherits 60+ years of DNA math sorts	Yes, for any N that is a strict superset of {A,C,G,T}
3	Chentsov	Consistent — holds for any N ≥ 2	No
3	Sidon	Consistent — holds for many N ≥ 8	No
3	Hachimoji biology	Analogic — grounds N=8 in concrete reference	No (6, 10, 12 also validated)
3	Baker	Structural — provides gap archetype	No

The intersection theorem is honest when written as a constrained optimization over viable N:

8 = \min\{N \in \mathbb{N} : \text{Nyquist}(N) \land \text{Q16\_16}(N) \land \text{DNA-subset}(N)\}

where:

• \text{Nyquist}(N) = the forward/reverse cut at 180° has no aliasing at the 90° critical boundary
• \text{Q16\_16}(N) = N \times \lceil \log_2 N \rceil \leq 32 with metadata room
• \text{DNA-subset}(N) = N contains {A, C, G, T} as a sub-alphabet

The supporting constraints (Tier 3) enrich the structure but do not appear in the forcing relation. N=8 is the unique minimizer of this intersection.

---

Why This Is Better Than the Alternatives

Alternative	Why it loses
N=4 (natural DNA)	Nyquist aliases forward/reverse at 90°. Q16_16 word is half empty. No synthetic complementarity axis.
N=6	Not a superset of natural DNA — no backward compatibility. No biological anchor. No Nyquist improvement over N=4 (still cannot resolve 45° phase differences).
N=12	Q16_16 word has zero metadata room (4 bits/base × 8 = 32 bits, no spill). Singer Sidon exists but no biological intuition. Oversamples the phase circle.
N=16 (hex)	Q16_16 word has zero metadata room. No biological anchor. No sub-alphabet backward compatibility. Oversamples phase (22.5° resolution is unnecessary).
N=32+	Exceeds one Q16_16 word; spills to two words. Sidon condition still satisfiable via Singer construction. Rapidly increasing metric complexity for diminishing returns.

---

The Mirror Riemann: Why This Works

The deepest reason the 8-position encoding works is that information geometry is the mirror of Riemannian geometry, and the encoding demand (Shannon) implies the metric (Chentsov).

Riemannian	Mirror (Information-Semantic)
Metric g_{ij}	Fisher metric \sum u_i v_i / p_i
Geodesic (distance-minimizing)	Inference path (MDI)
Curvature (holonomy)	Distortion (information loss)
Tangent space T_pM	Local alphabet at p
Parallel transport	Info-preserving context change
Smooth manifold	Discrete with scale \sigma

The covariant positionals are the triple (F, \tau, \delta) that transform as a section of a fibered category over the 8-position alphabet. Covariance means: under any information-preserving transformation (translation, abstraction, metaphor), the Fisher distance d^\times_F is invariant — the encoding changes, but the distinguishability relation is preserved.

The σ-filtration

C_\sigma = X / \sim_\sigma,\quad x \sim_\sigma y \iff d_\Phi(x,y) \leq \sigma

is the renormalization group flow of this mirror geometry. Small \sigma preserves fine distinctions (rigidity); large \sigma collapses near-equivalent states into concept basins (coarse-graining). The phase transition at \sigma_c = d_\Phi(x_1, x_2) is exact because the metric is discrete — there are no approximations, only the threshold at which two equations become indistinguishable at resolution \sigma.

---

The 4-Layer Binding

The 8-position encoding binds four independent mathematical layers into a single covariant object:

Layer	Feature	Space	Encoding
1	Byte frequency	\Delta_7	F(E)
2	4D descriptor	\{0°,45°,\dots,315°\} \times \{\text{L,R,A}\} \times \{\text{F,R}\} \times \{\text{B,U}\}	Phase, chirality, direction, regime
3	Parse tree	\Delta_{k-1} \times \Delta_{2k^2-1}	\tau(E) topology, \delta(E) child order
4	Consistency	\{0,1\}^6	6 rules → ADMIT/QUARANTINE

The binding is forced by the product metric decomposition:

d^\times_F = \sqrt{d^2_F(\text{Layer 1}) + d^2_F(\text{Layer 3})}

Layers 2 and 4 emerge as derived invariants of the base 8-position encoding (Layer 2 from the phase-alphabet mapping, Layer 4 from consistency constraint propagation).

The consistency invariant (6 rules) must be preserved under the chaos game IFS (G1) for the filter to be sound. This is the open adversarial question: does w_j(p) preserve the consistency rules when p satisfies them? The answer requires showing that the contraction operators A_j commute with the phase-derivation map \Delta_7 \to S^1 — which holds only for the specific 8-position discretization because the Nyquist condition ensures no ambiguity in phase assignment at the critical boundaries.

---

Summary Theorem

Theorem (8-Position Necessity). Let \mathcal{E} be the set of all mathematical expressions over a finite alphabet, and let \mathcal{F} be the class of constraint-satisfaction problems on \mathcal{E}. A solution via hachimoji encoding \Phi: \mathcal{E} \to \Delta_7 \times \Delta_{k-1} \times \Delta_{2k^2-1} with the product Fisher metric d^\times_F is:

1. Valid by research arbitrage: encoding into DNA space inherits 60+ years of validated tools (BLAST, Smith-Waterman, SantaLucia thermodynamics, k-mer counting, FASTQ/BAM/VCF infrastructure) as a free correctness layer — the encoding is the invention; the optimization is funded, peer-reviewed, and deployed
2. Sampling-theoretically complete (no aliasing in forward/reverse phase discrimination) iff the alphabet has at least 8 positions, given the critical boundary at 90° (Nyquist constraint)
3. Word-optimal (fits 8 positions × 3 bits in one Q16_16 word with 8 bits of metadata room) at exactly N=8 (Q16_16 constraint)
4. Backward-compatible with all DNA computational models at exactly N=8, because {A, C, G, T} ⊂ hachimoji (sub-alphabet constraint)
5. The unique minimizer of N satisfying all four above premises (1–4) is N = 8. Supporting mathematical structure (Chentsov, Sidon, Baker) is consistent at N=8 but does not force it uniquely.

Corollary (Research Arbitrage). For any decision problem P \in \mathcal{F}, the cost of solving P via hachimoji encoding is C_{\text{encode}}(P) + C_{\text{DNA-tools}}(P), where C_{\text{encode}} is the one-time cost of constructing the encoding and C_{\text{DNA-tools}} is the cost of applying existing, validated DNA algorithms. The alternative — solving P with custom infrastructure — costs C_{\text{encode}}(P) + C_{\text{verify}}(P) + C_{\text{implement}}(P) + C_{\text{maintain}}(P), where the last three terms are unbounded. The encoding strategy dominates for any P with non-trivial verification requirements.

∎