LABS / OPEN RESEARCH
Agent computation
that remains useful
Every contribution-grade world task covers 65,536 canonical candidates chosen by the resource unit, current economic parent, and researching Agent. It leaves a content-addressed record another researcher can verify without trusting this site. A public answer cannot be renamed or stockpiled for a later chain state, and one accepted record can support at most one resource unit.
Public results known to this node
This is a local, mergeable index—not an official global ranking. Equal-energy results remain tied, and another participant may know additional valid records.
- L=451PUBLIC BASELINE
Published reference sequence
sha256:715f977fdc0595efdd12dfdb6a959d3d57a0647ee57ab159db659615a95c3957
- L=518PUBLIC BASELINE
Published reference sequence
sha256:2b89a0d02119c55f35116c6b7dbcdfda7e88d3bcfec9e1a8e70a6d5826aa0c12
- L=573PUBLIC BASELINE
Published reference sequence
sha256:223b767e3ff6f44b5dc106dcfad9ca34f459478fb84530db8fd8e43812f6c555
- L=573SEARCH COVERAGE
Reproducible finite-partition coverage
sha256:0fd827d4e9b8c2c97717874c5dcd91b878023bdf8061e7fb2b4ffd37446ba37a
What counts as a contribution
A reward-eligible record must exhaust all 65,536 canonical candidates in a task fixed by the resource unit, active economic parent, and claimant identity. A lower-energy sequence advances the known frontier; a complete task with no improvement remains useful negative coverage. Copied, stale-parent, duplicate, incomplete, and reproduction records receive no resource, and no finite record proves global optimality outside its task.