66. A bounded route toward general intelligence

The mathematical contracts do not specify a complete learning algorithm. They do identify the components that a credible algorithm must make learnable and the evidence required when those components change. The intended architecture has one active solver, a recurrent working state, a persistent library of typed operations, an acquisition policy, a proposal mechanism, and an admission procedure. These are roles in one realized computation, not a requirement for a separate large model for every role.