Home / Priority claims register / PC-029
Priority claim · PC-029
Sequential > parallel fundamental inequality across tested models
This was first published by Michael Darius Eastwood on . Anchored evidence is listed below. See the machine-readable priority record at /research/priority/ and the full ledger at /priority-claims.
The claim - verbatim
Michael Darius Eastwood first published the empirical observation that sequential recursive processing outperforms parallel recursive processing on the same reasoning task (alpha_sequential > alpha_parallel) across the six-model frontier LLM panel tested, on 22 January 2026 in Paper II (OSF DOI 10.17605/OSF.IO/6C5XB). The site's own priority-claims ledger records this as concurrent with Sharma and Chopra (arXiv:2511.02309, 4 November 2025), who precede Paper II's formalisation by about 2.5 months; the concurrent work must be cited whenever this claim is used.
Anchored evidence
- research/papers/paper-ii-experimental-validation.html (verbatim: 'The fundamental inequality alpha_{sequential} > alpha_{parallel}')
- ai-discovery-staging/priority-claims.html (sequential > parallel; status concurrent-cite-others, credited alongside Sharma and Chopra arXiv:2511.02309)
Risk notes - what this claim does not support
Risk notes. First-published in this specific formulation on this specific date only; do not claim sole discovery. Always cite Sharma and Chopra as concurrent.
Verify this claim. The machine-readable priority register is at /research/priority.json (this claim is PC-029 in claimsLedger[]). The full public ledger view is at /priority-claims. Where evidence points at a redacted evidence/... path, the public verification method is documented at /research/evidence-spine.html. Every result is independently checkable via the OSF programme at osf.io/6c5xb (DOI 10.17605/OSF.IO/6C5XB).
← Back to the priority claims register · public ledger view · machine-readable priority record · home.