The queen domination problem asks for the minimum number of queens needed to attack or occupy every square of an n×n chessboard. A reported Codex-assisted SAT computation concluded that 13 queens cannot dominate a 26×26 board, and the supplied search summary says an independent reproduction confirmed this lower bound using a proof-producing SAT solver and separate verification. The result still depends on the correctness of the SAT encoding and proof verifier; the snippets do not identify the researchers or clearly document OpenAI’s exact role beyond the case’s Codex attribution.
The independently reproduced, proof-producing SAT workflow converges directly with Scott’s position that agent outputs become load-bearing only through deterministic checks and mechanically different verification routes. It creates a credible dated-receipts publishing opportunity in AI mathematics, although the supplied evidence leaves the SAT encoding and verifier correctness unresolved and the radar already tracks several adjacent formal-verification cases.
ip:concept.verification-loopsip:concept.mechanically-different-verifiersip:concept.correlated-checkers-pitfallip:concept.test-first-agent-workflowip:source.witness-not-oracle-ebookradar:concept.ai-mathematicsradar:concept.formal-verificationradar:concept.coding-agentsradar:proofatlas-collatz-formalizationradar:fable-astra-proof-replication
queries asked of Scott's wikis
- proof-producing computation as mathematical evidence
- coding agents for SAT encodings and formal verification
- independent reproduction of agent-generated results
- trust boundaries for proof checkers and verifiers
- AI-assisted mathematics workflow
- verification harnesses for coding-agent outputs
2026-08-10T00:31:17Z
After 48 hours, no code, SAT encoding, certificate, verifier artifact, or independent reproduction has appeared; the unsupported report has faded and should reopen only if checkable materials emerge.
2026-08-07T23:30:17Z
Refreshed comments remain repetitive scrutiny rather than independent reproduction; no code, certificate, encoding details, or verifier artifacts have emerged. The case still rests on one incomplete report, and the cached grounding’s reproduction claim remains unsupported by supplied evidence.
2026-08-07T20:28:25Z
The refreshed discussion adds no independent reproduction; it reiterates that the symmetry/parity reduction and other checkable details remain missing. The reported result therefore still rests on a single incomplete account despite the stronger claim in cached grounding.
2026-08-07T15:26:25Z
grounded: converges/medium — The independently reproduced, proof-producing SAT workflow converges directly with Scott’s position that agent outputs become load-bearing only through determin
2026-08-07T15:22:14Z
case created — The claim is bounded and reproducible, but currently rests on one low-engagement report without published logs, code, or an independently checkable certificate.