IDKMesh can already represent a bounded WorkUnit and a worker ResultManifest, but a scalable swarm needs a protocol boundary between worker claims and independent evidence.
It also needs a way to prevent candidate generation from outrunning verification. Raw queue length is insufficient because pending candidates have different risk, uncertainty, blast radius, verification cost, and evidence correlation.
The execution/evidence chain is:
WorkUnit
-> worker attempt
-> ResultManifest
-> independent verifier
-> VerificationResult
-> integration/human policy decision
A worker cannot self-accept its candidate. A verifier can recommend acceptance, rejection, escalation, or insufficient evidence, but the VerificationResult does not itself authorize a canonical merge/integration action.
schemas/verification-result-v0.1.schema.json is the initial experimental contract.
IDKMesh will experimentally model pending verification burden as risk-weighted debt rather than only candidate count.
The initial reference model increases debt with:
This is a controller signal, not a probability or permanent quality score.
The first reference controller is Risk-Weighted Verification Backpressure (RWVB), implemented in experiments/verification_backpressure.py.
RWVB:
The project objective is verified useful work, not maximum candidate production. If generator count grows while independent evidence capacity stays fixed, verification backlog and escaped-risk pressure can dominate any benefit from additional agents.
Making verification pressure part of the control loop creates negative feedback:
high unverified risk
-> higher verification pressure
-> lower generation fan-out
-> debt clears
-> generation can expand again
This also aligns with IDKMesh’s earlier decision that verification must scale with generation.
RWVB is inspired by queueing/network MaxWeight/backpressure methods, especially work originating with Tassiulas and Ephremides and later stochastic-network optimization methods.
The classical throughput/stability theorems do not automatically transfer to IDKMesh’s heuristic risk/verification model. The analogy is a research hypothesis and must be benchmarked against simpler baselines.
See docs/research/VERIFICATION_DEBT_AND_BACKPRESSURE.md.
Positive:
Costs/risks:
Compare FIFO, highest-risk-first, cheapest-first, and RWVB under controlled workloads with seeded defects and increasing generation fan-out. Measure escaped defects, accepted throughput, total verification debt, queue latency, verifier cost, human attention, false rejection, and evidence correlation.
Parameters remain experimental until evidence supports defaults.
docs/research/VERIFICATION_DEBT_AND_BACKPRESSURE.mddocs/research/VERIFICATION_BACKPRESSURE_BENCHMARK.md