Home / Priority claims register / PC-036
Priority claim · PC-036
Application of the bare alpha = d / (d + 1) scaling exponent to recursive AI capability
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 applied the bare scaling exponent alpha = d/(d+1) to recursive AI-capability growth in the Foundational paper on 13 February 2026 (OSF DOI 10.17605/OSF.IO/6C5XB). The exponent d/(d+1) itself is prior art in the wider scaling-law literature, independently derived by at least seven groups (West-Brown-Enquist 1997; Banavar et al. 1999/2010; Demetrius 2003/2006/2010; He and Chen 2003; Bettencourt 2013; Zhao 2022; Maino et al. 2014). Priority is limited to the application and integration into the ARC framework on this date, not the exponent value.
Anchored evidence
- research/papers/foundational.html (Foundational paper)
- ai-discovery-staging/priority-claims.html (bare alpha = d / (d + 1); status prior-art-synthesis; explicit self-correction that 'the bare d / (d + 1) exponent itself is prior art')
- research/papers/paper-ii-experimental-validation.html (equation: alpha = 1 / (1 - beta))
Risk notes - what this claim does not support
Risk notes. Do not claim invention of the d/(d+1) form; scope priority strictly to the AI-capability application on this date.
Verify this claim. The machine-readable priority register is at /research/priority.json (this claim is PC-036 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.