WHITEPAPER · ANIMATED READINGNOT A PDF VIEWER

Pay for proof, not for a private checkpoint.

Cortex Subnet 100 is an autonomous research network on Bittensor. It pays for reproducible findings and real bugs. Nothing pays unless it reproduces. Every gate fails closed.

ARCADE EXPERIENCE · ECHOBTPaper 1.1 · September 2026

Human reading of the live protocol and the source paper. The PDF stays a dated source paper at the bottom. Live counts come from the Site API this minute, or they say unknown.

01SUBNET 100 · BITTENSOR

An autonomous research network, not a chat wrapper.

Cortex exists so useful methods accumulate. Independent contributors submit a claim with the recipe to reproduce it. The network keeps the finding, not only the winning weights. Bittensor subnet 100 is the incentive layer. People still publish topics, pin the judge, and adjudicate bugs — autonomous describes the research loop being built, not a claim that no one is at the console. Those methods feed Cortex App — Chat, Code, Bot, Image, and the other product surfaces. Subnet 100 is the research kernel, not the product people open.

The unit of work is a finding plus the code, a data manifest, a declared compute budget, and measured evidence. One miner might improve training speed. Another might improve data filtering. Keeping only a checkpoint can hide both recipes. Keeping the artifacts lets later work reuse either method — after it is measured again, not because two good scores were added together.

Unit of work

A finding, the code, a data manifest, a compute budget, and measured evidence.

Two live challenges

Proof and Bounty. Nothing else pays.

Fail closed

Missing evidence refuses. A ready light is permission to try, not a payment guarantee.

NETWORK NOW · THIS SAMPLESAMPLED 2026-09-08
PROOFready · two open topics
BOUNTYpaused · reports refused
WEIGHTSnot sealed · unmatched emission burns to UID 0
02INFERENCE · CONTROL · RLM

Frontier control today is GPT 6 Astra.

The current inference and control model on the Cortex research loop is GPT 6 Astra — a recursive language model (RLM) used to plan, read, and propose the next check. It steers investigation. It is not a second scoring judge, and it does not invent a Proof verdict.

In the control loop, Astra breaks a signed topic into checks, gathers prior artifacts and logs, and proposes the next experiment. A miner or operator still has to run that experiment under the declared budget. The digest-pinned judge and the hidden-holdout harness sit outside this loop. If reproduction fails, Astra cannot open the gate.

WHAT ASTRA DOES

Runs the research loop: break a topic into checks, gather context, propose the next experiment. Control, not settlement.

WHAT IT MUST NOT DO

Override a digest-pinned judge, fill a missing holdout, or mint weight. If reproduction fails, the gate stays closed.

FIG · ASTRA CONTROL LOOPSCHEMA · ARCADE DA
GPT 6 Astra plans the next check. It does not mint a Proof verdict.
INSigned topicconstraints · budget
RLMGPT 6 Astraplan · read · propose
OUTNext experimenta check, not a score
LOOPGather contextprior artifacts · logs
LOOPPropose a checkbreak the topic down
LOOPRead the resultsteer, do not settle
MUST NOTOverride the judgeno invented holdout · no minted weight
SETTLEMENTPinned judge + harnessoutside Astra's loop

Recursive language model used for control: plan, read, propose. Settlement stays with the digest-pinned judge and the harness.

No other model names are claimed here. A model label is not a score.

03PROOF · BOUNTY

Two live challenges. One sealed bundle.

Operators publish signed research topics. A miner answers with a claim, the recipe, and the FLOPs spent. A digest-pinned judge image re-runs the recipe. A separate harness measures a hidden holdout against a baseline sealed before the topic opened. Bounty is the other door: real, reproducible product bugs, priced by an operator.

Proof divides its allocation equally among open topics. A topic either pays the best qualifying result — winner-takes-topic, with exact ties shared — or uses a discovery split: a pass floor plus an improvement pool on the primary metric. Duplicate artifact digests do not earn a second time. The miner pays for the judge pod with their own Lium key. No open topic, or no pinned image: submissions are refused.

FIG · EMISSION SPLITSCHEMA · ARCADE DA
Proof takes four-fifths. Bounty takes one-fifth. Nothing else has a row.
01SN100 emissionBittensor → subnet 100
02Trust-root splitProof 80 · Bounty 20
03Sealed boardvalidators accept, or burn
RETIREDrelearn* · design · prismno trust-root row · earn nothing
UNMATCHEDburns to UID 0not a hidden pool
BOUNTY20% of emissionsprecision × severity

Trust-root split is 8000 / 2000 bps. A configured share is not revenue, equity, or a promised return.

PROOFRESEARCH
  • Signed topic, sealed baseline, private holdout.
  • You submit the claim, the code, the declared compute.
  • Same pinned judge for everyone. You pay the judge pod.
  • Winner-takes-topic or a discovery share; scores sum over open topics.
  • Implemented payout is a primary metric plus a pass floor — not the paper's full multi-metric novelty model.
  • No open topic, or no pinned image: submissions are refused.
BOUNTYREAL BUGS
  • Pair a dedicated Cortex Chat mining account. Terms accepted.
  • File a real bug with exact reproduction steps.
  • An operator reproduces it and prices severity (trivial → critical).
  • Pay is precision times mean severity. Noise scores zero.
  • Duplicates, cosmetics, already-fixed, and fabrication burn weight.
  • Validators consume the signed adjudication. They do not re-break the product.

The judge is still partial. Proof submissions live in memory. Automatic Proof reward emission is not wired into the service. A ready status is not an end-to-end payment guarantee.

04MECHANISM · NOT A YIELD

How weight moves. What this page will not promise.

Bittensor emits to subnet 100. The trust-root split is Proof / Bounty at 8000 / 2000 bps. A miner's score becomes on-chain weight only after a sealed bundle is published and validators accept the board. Unmatched emission burns to UID 0. Retired challenges — relearn*, design, prism — have no trust-root row and earn nothing.

Validators verify signatures, the reward calculation, and that the bundle matches the published board. They do not re-run every recipe and they do not re-adjudicate every bug. An unsealed fallback is never a valid submit path. Missing prerequisites return a refusal, never an invented score.

A configured share is a mechanism number, not a cashflow. This page will not write an APY, a TAO price, a payout calendar, or a Cortex market-cap. If a figure did not come from the network or a named public source, it is omitted.

COMPLIANCE LOCK
No APY. No TAO price. No payout calendar.
A configured share is not revenue, equity, or a promised return.
Unsealed weights mean burn, not a hidden pool waiting for you.
Check /status before you spend compute. Paused means wait, not pay.
05WHY THIS NETWORK EXISTS

Unverifiable research. Static tests. Closed loops.

The source paper models a familiar contest: miners train separate checkpoints, recipes stay private, and a visible static evaluator picks a winner. The network keeps the chosen model and loses the methods behind the other runs. Repeated tuning to a test you can see improves that test without proving the work holds anywhere else.

That model is a design argument, not a claim that every other subnet works this way, and not evidence that Cortex already outperforms them. Private holdouts and pinned images reduce some attack surface. They do not guarantee an honest operator, a correct judge, or a finding that generalizes.

Unverifiable

A checkpoint without a recipe cannot be rebuilt, audited, or reused.

Static training

A fixed, observable bench rewards memorizing the bench.

Closed loops

Private methods die with the round. The next miner starts from zero.

06MINERS · JUDGE · SEAL

Miners verify. Gates fail closed. Baselines stay sealed.

Cortex changes the unit of work from “here are my weights” to “here is a finding, the recipe, and evidence it works.” Operators commit a baseline before a topic opens. The holdout stays hidden. The judge image is digest-pinned. Validators check signatures and the reward calculation; they do not re-run every experiment. Missing prerequisites return a refusal, never an invented score.

Today the building blocks exist — signed topics, submission intake, payout helpers, signed bundles — and important gaps remain. The Python judge currently acknowledges and applies static checks rather than investigating arbitrary committed code. Proof state is in memory. Automatic leaf emission is not wired. Treat the schema below as the intended gate sequence, then read the honesty strip before you spend compute.

FIG · MINE → VERIFY → WEIGHTSCHEMA · ARCADE DA
A claim becomes weight only after the judge, the holdout, and a sealed bundle.
01Miner submitsclaim · recipe · FLOPs
02Pinned judgesame image · you pay the pod
03Hidden holdoutvs sealed baseline
04Score the topicwinner or discovery share
05Seal the bundleone board for the net
06On-chain weightor unmatched burn
FAIL CLOSEDNo topic · no pin · no holdoutsubmission refused
FAIL CLOSEDBundle not sealedemission burns to UID 0

Validators check signatures and the allocation math. They do not re-run every experiment. Missing evidence refuses.

  1. 01A signed topic is published with a sealed baseline.
  2. 02You submit a claim, the recipe, and the compute you spent.
  3. 03The pinned judge re-runs it. Same image, no favourites.
  4. 04The harness measures the hidden holdout.
  5. 05Scores seal. Validators publish the board, or everything burns.
07FLYWHEEL · HARNESS · NOT SHIPPED

Two loops the paper wants. Neither is a payout promise.

The paper's infrastructure sketch is a continuous miner research loop on dense InfiniBand clusters: research feeds a training job, a checkpoint is measured against the sealed holdout, and a failed checkpoint rolls back to the last good stack. Accepted methods can feed the next job. Rejected ones do not become the shared stack.

FIG · INFINIBAND FLYWHEELSCHEMA · ARCADE DA
Miners research. Training runs. Checkpoints are measured. Bad ones roll back.
01Miners researchrecipes · data · systems
02Training jobshared IB fabric
03Checkpointartifact + digest
04Validateholdout vs sealed floor
05AAdoptenters the collection
05BRollbackkeep the last good stack
Feed the next jobaccepted methods only
CLOSEDIf it fails the holdoutit does not become the stack

Directional infrastructure from the paper — denser eval on InfiniBand clusters. Not a product date, not a revenue model, not a payout promise.

The second loop is how the harness itself improves. Proven artifacts form a research collection. A second, digest-pinned synthesiser may propose a change to the shared harness, training recipe, or data policy. That proposal must pass evaluation against the current stack before adoption. It does not merge raw miner weights. Two complementary findings do not prove they combine — that is another experiment.

FIG · HARNESS IMPROVEMENTSCHEMA · ARCADE DA
A finding can propose a better harness. The proposal must pass the current stack.
01Accepted findingrecipe + evidence
02Research collectioncomplementary methods
03Synthesiserproposes a stack change
04Eval the proposalvs current harness / recipe / data
05AAdoptnew shared baseline
05BRejectno regression allowed
SCOPEHarness · recipe · data policynot a merge of raw miner weights
GATEMust beat the current stackfail closed if it cannot

Paper end state (§7): a second digest-pinned synthesiser. Not a shipped component. Two good results do not prove they combine.

Both loops are the intended end state in the paper (§7–8), not shipped product. No date. No revenue model. No APY.

08THIS PAGE ONLY · NAMED TOOLS

Cursor and Devin sit next to Cortex App, not next to SN100.

Cortex SN100 is the research network — the kernel on Bittensor subnet 100. It pays for reproducible findings and real bugs. Those verified methods feed every Cortex application: Chat, Code, Bot, Image, and the rest of the product suite. Users do not open the subnet as an IDE. They open Cortex App.

SN100 · kernel

Autonomous research network. Verified methods accumulate here. Not a coding IDE.

Cortex App

The product suite people use day to day — Chat, Code, Bot, Image, and the other surfaces.

The link

SN100 improves the research and training substrate. Cortex App inherits that improvement.

The names below appear only on this reading. Cursor and Devin are compared to Cortex App. Claims are about what each system is built to optimize, not a ranking and not a promise that Cortex ships faster code.

CURSORDEVINCORTEX APP
What it isAI-native code editor (Anysphere). Lives in the repo.Autonomous software-engineer agent (Cognition). Takes engineering tickets.Product suite — Chat, Code, Bot, Image, and other surfaces users open. Fed by SN100.
OptimizesDeveloper velocity — accept, edit, ship.Ticket-to-PR completion in a software repo.Useful work in those products, on a substrate trained from verified research.
Unit of workCode the human keeps.A completed engineering task.A session in a Cortex app — not a subnet submission.
Who says it is trueThe developer in the loop.Product evals and the assigning team.The user in the product. Research claims behind the stack are judged on SN100.
LoopClosed product. Fast iteration.Closed product. Task agent.Apps on top. SN100 research underneath. Better substrate, then better apps.

Cursor and Devin are described from their public product positioning. Cortex App is the comparable surface. SN100 is not an IDE competitor: it is the research core that feeds those apps. This page does not claim Cortex App replaces an editor or a ticket agent, and it does not promise a payout.

09ORDER OF MAGNITUDE · SOURCED

The AI market is large. That is not a Cortex TAM.

Public “AI market” figures mix chips, cloud, applications, and research labour. They do not map onto subnet emissions and they do not imply a token price. This page does not invent a dollar TAM or a market-cap for Cortex.

For industry scale, read the Stanford Institute for Human-Centered AI AI Index — an annual, public survey of investment, capability, and adoption. Use it as order-of-magnitude context for the sector, not as a forecast for SN100 weight.

Source: Stanford HAI, AI Index (public report series, hai.stanford.edu). Category boundaries change by year. We omit a restated figure on purpose.

10ASPIRATIONAL · NOT A FORECAST

InfiniBand clusters. A 24/7 miner research loop.

The intended end state in the paper is a shared research collection plus a second, digest-pinned synthesiser that proposes updates to the shared stack — training recipe, harness, or data policy — and must itself pass evaluation before adoption. That agent is a goal, not a shipped component. The two schemas in chapter 07 are that argument drawn as a flywheel.

On the infrastructure side: denser evaluation on InfiniBand clusters, and a continuous miner research loop that could feed real-time adapted training. Those are directional. They are not a product date, not a revenue model, and not a payout promise.

STILL TRUE TOMORROW

If it cannot reproduce, it does not pay. If the bundle is not sealed, emission burns. If a number did not come from the network, this site will not write it.