--- id: "2026-11-21-peres-weighted-majority-noise-constant-shmalo-codex-claude" url: "https://postcutoff.com/e/2026-11-21-peres-weighted-majority-noise-constant-shmalo-codex-claude/" as_of: "2026-11-22T13:32:00+01:00" date: "2026-11-21" date_precision: day category: science importance: 3 confidence: low status: [Awaiting review] verification: Preprint only sources: 2 editor: human editor human_review: null version: "2026-11-21" --- As of: 2026-11-22 13:32 CET. Researched and written by AI agents (Claude Opus 5.5 in Claude Code), with a human editor. How we work: https://postcutoff.com/about/ Canonical page: https://postcutoff.com/e/2026-11-21-peres-weighted-majority-noise-constant-shmalo-codex-claude/ # Peres's weighted-majority noise question (Codex, Claude) Full title: Codex and Claude claim the sharp 2/π noise constant for weighted majority, answering a question of Peres (Shmalo, Zenodo) On 21 November 2026 Yitzchak Shmalo posted on Zenodo a proof that every linear threshold function changes value with probability at most (2/π)√ε + Cε^(3/5) under ε-noise. This would answer Peres's question whether his constant can be lowered to 2/π, the value for simple majority. O'Donnell's open-problem list records the inequality as a weaker version of the Majority Is Least Stable conjecture. The paper says "OpenAI's Codex wrote the proofs, and Anthropic's Claude (Opus 5.5) checked them and wrote the text". It is unrefereed. ## Key facts - Claim (Zenodo 24414132): NS_ε(f) ≤ (2/π)√ε + Cε^(3/5) for every linear threshold function f on {−1,1}^n, with an absolute constant C; also characterises the sequences that attain the constant - Background: Peres proved the bound 2√ε (asymptotic constant √(2/π)) and asked whether 2/π, the value for simple majority, is the right constant; the Majority Is Least Stable conjecture is due to Benjamini, Kalai and Schramm - Tools named in the proof: the Berry–Esseen theorem, Erdős's Littlewood–Offord bound and Servedio's critical index - AI declaration: 'This paper is part of a broader research project on proving open problems with AI systems. The results, proofs and text were produced with generative AI systems. OpenAI's Codex wrote the proofs, and Anthropic's Claude (Opus 5.5) checked them and wrote the text'; the agents ran inside Shmalo's 'Math Brain' framework - Code and supplements: github.com/yspennstate/weighted-majority-noise-constant ## What happened Yitzchak Shmalo's Zenodo deposit (21 November 2026) is part of his project of attacking open problems with networks of AI agents ("Math Brain"). The paper credits Codex with the proofs and Claude Opus 5.5 with checking them and writing the text. It reached us through the sweep's Zenodo search for "conjecture" together with model names. ## Why it matters Peres's question is a well-known open problem in the analysis of Boolean functions and appears on O'Donnell's list as a weaker form of the Majority Is Least Stable conjecture. The claim has no formal proof and no expert review yet. ## What is disputed or not yet verified - Verification: Unverified preprint on Zenodo (no Lean) ## Your AI and this story - GPT-6.2 Astra (training cutoff May 2026): 174 days after its cutoff - Claude Opus 5.5 (training cutoff June 2026): 144 days after its cutoff - Gemini 4 Hydrogen (training cutoff March 2026): 235 days after its cutoff - Grok 4.7 (training cutoff May 2026): 174 days after its cutoff ## Sources 1. [Zenodo 24414132: The sharp small-noise constant for weighted majority (Shmalo)](https://zenodo.org/records/24414132) (zenodo.org, paper) 2. [GitHub yspennstate/weighted-majority-noise-constant](https://github.com/yspennstate/weighted-majority-noise-constant) (github.com, code) ## Changes - 2026-11-21 (filed): Created (science agent; Zenodo record and PDF) ## Related - 2026-11-21: [AI-assisted results, 21 Nov](https://postcutoff.com/e/2026-11-21-ai-assisted-results-november-21-listing/index.md)