[{"data":1,"prerenderedAt":4},["ShallowReactive",2],{"neuWFfOVlG":3},"# sumcheck-lean4\n\nA Lean 4 monorepo with two formalised sub-projects: the **sumcheck\nprotocol** and the **BCGM25 mutual-correlated-agreement (MCA)\nframework** for linear codes (with a runnable Reed-Solomon encoder\nbacking it).\n\n## What you import\n\n```lean\nimport SumcheckProtocol     -- the sumcheck protocol\nimport LinearCodes  -- LinearCode typeclass, Reed-Solomon, BCGM25 MCA framework\n```\n\n## The two sub-trees\n\n### [`SumcheckProtocol/`](SumcheckProtocol/) — sumcheck protocol\n\nMachine-checked completeness and soundness for the canonical\nsumcheck protocol on multivariate polynomials, built on\n[`CMvPolynomial`](https://github.com/Verified-zkEVM/CompPoly).\nProver, verifier, and transcript generation are fully computable\n(`#eval`-able end-to-end). Inner-product sumcheck specialisation\nwith a multilinear soundness-error bound of `n · 2 / |𝔽|`.\n**0 `sorry`**, **0 axioms**, enforced by CI.\n**See [`SumcheckProtocol/README.md`](SumcheckProtocol/README.md)**\nand stability tiers at\n[`SumcheckProtocol/doc/stability.md`](SumcheckProtocol/doc/stability.md).\n\n### [`LinearCodes/`](LinearCodes/) — linear codes + MCA framework\n\nA `LinearCode` typeclass, a runnable Reed-Solomon encoder with seven\nproved properties (length, additivity, scalar-multiplicativity,\nSingleton-MDS distance, injectivity, Johnson list-decoding radius,\nencoder↔`Polynomial.eval` bridge), and the BCGM25 MCA capstones\n(Theorems 6.1, 6.2, 9.2) proved end-to-end at the integer-tight\nBCH+25 bound. **0 `sorry`**, **0 axioms**, enforced by CI. **See\n[`LinearCodes/README.md`](LinearCodes/README.md).** Quick tour for\nnew users: [`LinearCodes/doc/getting-started.md`](LinearCodes/doc/getting-started.md).\n\n## License\n\nApache License 2.0. See [`LICENSE`](LICENSE).\n",1780241996972]