Observed arrival · 2026-10-21
PolyLabs Research: proving laws of cellular automata
A research project studies cellular automata on finite lattices using simulations, predictions registered before testing, and Lean proofs.
○Open
⊠Login
$Paid
†Ads
✦Pretty
●Pro
◎Niche
◉Human
⚑Risk
ƒJS
- For
- Cellular automata and formal verification researchers
- Worth noticing
- Its ledger records predictions before the corresponding simulations, and the site includes tests that refuted the original claims.
Field notes
The described pipeline separates simulation, law fitting, preregistered tests, and Lean verification, with each stage handing its output to a check it cannot change. The page gives concrete examples of revision: an initial hexagon parity law failed at sizes 74, 148, and 190, while a corrected form was tested on 100 new sizes and reported proved for every even n. It also points readers to a study ledger and an agent activity record.
Observed signals
Read the marks
Editorial observations of this landing page, not a rating.
○OpenPublic substance visible
✦PrettyNotable craft visible
●ProPolished or operationally mature
◎NicheUnusually specific use
One card from the complete issue