Observed arrival · 2026-10-22
Antoine Olivier’s AI-assisted coding-theory results
An independent researcher documents computational results in spherical and constant-weight binary codes, linking them to public record tables and proof material.
- For
- Coding-theory and discrete-geometry researchers
- Worth noticing
- Two independent programs, in Python and PARI/GP, check the spherical-code cosine bounds using exact integer arithmetic.
Field notes
To check the spherical-code values, the researcher scales coordinates by 2^52, rounds them to integers, then uses separate Python and PARI/GP programs to verify the maximum cosine bound in exact integer arithmetic. Eight cases begin from entries the cited table marked for further optimization; two others start from codes with one extra point, then remove a point. The page explicitly distinguishes these computational records from proofs of optimality and dates its table checks to 20 October 2026.
Observed signals
Read the marks
Editorial observations of this landing page, not a rating.
One card from the complete issue