Lean repository linked
Unrestricted Boolean Multiplicative Complexity of Four-Term Binary Polynomial Multiplication: Rational Places, Hasse Jets, and the Failure of Nonlinear Feedback
arXiv:2608.30238 · arXiv
Lean formalisations (1)
GregoryMorse/unrestricted-boolean-mul at c014e498e51a
Linked by the repository’s formalization.yaml.
Project review: self-assessed
Audit: awaiting publication.