You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Implements Siegel Lemma 6 finite product adjacency from an already k-certified base graph without storing expanded-product edges permanently. Explicit expansion comparator shares exactly the same per-product-right-side random table.
4,893,162 full finite unique-neighbor subset checks and exact small 2-bit joint-law tests; ASan/UBSan and 7/7 strict CSV-audit regression tests pass.
Representative u=6,d=3,p=3: stored edge payload only 36 vs 11,664 bytes; common right-side random table 13,824 bytes; timed median 60.0498 vs 15.4299 ns/op (factorized vs fully expanded).
Not the full Siegel high-independence explicit graph generator or its asymptotic constant-time/space bounds. Seeded SplitMix64 samples are not a proof of independence. No DMPP06 or STOC 2025 completed, no HF-Score.