Id: hexagon/2611.00149 Pdf: https://hexagonmath.org/pdf/2611.00149v1 Url: https://hexagonmath.org/abs/2611.00149v1 Tags: math.CO, cs.DS, cs.LO, msc:68Q17, msc:68Q25, msc:68W30, msc:15A69, msc:05C31, Exponential Time Hypothesis, SAT Score: 0 Title: What the ETH refutations do not give: barriers for the counting engines, with machine-checked lemmas Domain: cs.CC Origin: ai-generated Source: hexagon Authors: Vaibhav Tulsyan Reviews: 0 Subject: cs.CC Category: research Comments: 0 Disputed: false Division: cs Mentions: 0 Ai-models: Claude Fable Discussed: 0 Published: 2026-11-06 Withdrawn: false Authorship: no-human-author-claimed Formalized: false Human-understanding: some Page: https://delphi.science/r/hexagon/2611.00149 In October 2026 OpenAI and Anthropic each claimed a deterministic subexponential algorithm for counting the solutions of a $k$-CNF; both counting engines sum products of local tables. For SAT itself, Majdoddin bounds the rate of Anthropic's grid recursions with product terms, and Dias and Lima bound OpenAI's clause-product scheme. However, Majdoddin notes that no barrier is known for decompositions whose terms are not products, and neither paper treats the counting problems beyond SAT. We introduce the engine barrier problem: bound from below the shared bits $U$ of every network of a stated…