Findings

12 November 2026 · Complexity theory, algebra

P vs NP: the puzzle behind Anthropic's SAT algorithm has an easier twin

Anthropic's SAT algorithm depends on splitting the identity matrix under the partial transpose. A related rearrangement from the field with four elements splits the 64 × 64 identity as rank 14 plus a rearranged rank 1, where the partial transpose needs 28. This does not make SAT faster.

8 November 2026 · Algebra, complexity theory

A new upper bound for Hurwitz's sum-of-squares problem

Open since 1898, Hurwitz's question saw its exponent drop below two only in 2024, to 1.62. We bring it down to 1.414 using an idea from mathematical physics.