# Spectral construction: millions of tracked parameters and uninstantiated thresholds

Family 178; selected construction addendum, 9 October 2026 Australia/Brisbane. Source `fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb`.

Read full introduction, setup and algorithm; selected accounts, exact-repair theorem and affine seed enumeration were also read. Fixed a=1/10000 implies 3,333,334 auxiliary points and 6,666,668 signed auxiliary points during early/cleanup phases. This is a parameter count, not a moment order, complexity exponent or mandatory simultaneous-memory allocation. Repair enumerates P squared seeds with an unselected sufficiently-large fixed exponent. n0(d), kd and remaining parameter margins are not numerically instantiated. The theorem outputs an adjacency list at sufficiently large even orders for fixed degree, not joint-polynomial degree/order or local-query access. The exact finite acceptance checker remains useful independently of a full constructor. No family formal scope is listed, no independent proof check was run, and full construction/proof review remains pending. Dossier 036 is revised.

## Exact sections read

- `preprints/Deterministic-nonbipartite-Ramanujan-graphs-in-every-fixed-degree-September-23-2026/build/sections/introduction.tex`: full introduction.
- `preprints/Deterministic-nonbipartite-Ramanujan-graphs-in-every-fixed-degree-September-23-2026/build/sections/setup.tex`: full parameter hierarchy.
- `preprints/Deterministic-nonbipartite-Ramanujan-graphs-in-every-fixed-degree-September-23-2026/build/sections/accounts.tex`: lines 1–115.
- `preprints/Deterministic-nonbipartite-Ramanujan-graphs-in-every-fixed-degree-September-23-2026/build/sections/algorithm.tex`: full algorithm/bit-model section.
- `preprints/Deterministic-nonbipartite-Ramanujan-graphs-in-every-fixed-degree-September-23-2026/build/sections/repair.tex`: lines 280–335 and 724–764.

See [source metadata](source.json). No independent proof verification, full-paper completion or buyer validation is implied.