GF(2) Möbius / zeta transform in o(N log N) XOR gates, the first asymptotic improvement over Yates (1937) for circuits with cancellation: proofs, certificates, Lean 4 checks, and closed ideas. Asymptotic only, AI-checked, not yet human-refereed.
algorithms finite-fields theoretical-computer-science formal-verification open-problems reed-muller complexity-theory mathlib boolean-functions lean4 gf2 linear-circuits circuit-complexity algebraic-complexity mobius-transform zeta-transform yates-algorithm xor-circuits fast-transforms
-
Updated
Oct 11, 2026 - C