Perturb

Kinitro uses a split service architecture: (1) Miners deploy policy servers to Basilica (serverless GPU) and commit endpoints on-chain. (2) The scheduler reads on-chain commitments to discover miners. (3) Task generators create evaluation tasks stored in PostgreSQL. (4) Executors fetch tasks, run simulations (MuJoCo/Genesis in Docker), and call miner endpoints for actions. (5) Results are submitted back, and scheduler computes epsilon-Pareto weights. (6) Validators poll the weights endpoint and submit to chain. This architecture separates heavy computation (backend operators) from lightweight validation (community validators).

The scoring mechanism: (1) Each miner is evaluated on all environments, computing success rates. (2) For each subset of environments, the miner that Pareto-dominates others on that subset wins points equal to the subset size. Epsilon tolerance prevents noise from determining winners. (3) Points from all subsets are aggregated. (4) First-commit advantage gives earlier miners priority in ties - later miners must exceed the leader's score by a threshold gap (2-10% depending on evaluation samples) to win. (5) Final points are converted to weights via softmax with configurable temperature. This design ensures specialists only win small single-environment subsets while generalists win larger, more valuable subsets.