← W33 Theory

Quadratic parent, discriminant chain, multiport compiler, and holonomy

Passes 3813–3820 · semantic certificate 2b57dd96e94217573cf52a7031280ccbaaff8439ec86a3029d985723f10e6101

64 = 1+27+36

The bent Cayley parent is SRG(64,36,20,20); its two nontrivial subconstituents are the Schläfli graph and the complement of the 36-port spread graph.

[36,17,8]

The discriminant chain reaches isotropic rank eleven and determinant four. Rank twelve is blocked by the rank-mod-eight theorem.

944 / 512

The exact tree compiler uses 944 rotations. An adjacent optimization candidate uses 512 rotations in 69 layers; the support lower bound is six layers.

1,2,54,36,27

The four-angle rank-20 frame closes to a rank-five association scheme and a spherical 2-design.

1080 + 2160

Complement-W33 triangles split into flat and transposition holonomy; three-cycles occur on four-loops and generate full S3 curvature.

42I+3J

The weighted frame/triple incidence resolves the complete 35-dimensional port-contrast space.

Evidence boundary

The packet is an exact finite computation. It does not claim serialized Monster words, a Monster subgroup embedding, a Leech or rootless lattice, an optimal optical circuit, fabrication performance, laboratory validation, or physical spacetime curvature.