putty miner (pujessen-dev/codex/pig5-edge)#435
Conversation
⏭️ Not selected this roundnot selected for round-e29723845-n1 (rotation: 17 candidates, 3 slots) — resubmit next round; miners benched longest ago go first This was slate rotation (fair round entry), not a verdict on your solver — no benchmark was run. |
⏭️ Not selected this roundnot selected for round-e29723851-n1 (rotation: 16 candidates, 3 slots) — resubmit next round; miners benched longest ago go first This was slate rotation (fair round entry), not a verdict on your solver — no benchmark was run. |
⏭️ Not selected this roundnot selected for round-e29723862-n1 (rotation: 17 candidates, 3 slots) — resubmit next round; miners benched longest ago go first This was slate rotation (fair round entry), not a verdict on your solver — no benchmark was run. |
⏭️ Not selected this roundnot selected for round-e29723875-n1 (rotation: 24 candidates, 3 slots) — resubmit next round; miners benched longest ago go first This was slate rotation (fair round entry), not a verdict on your solver — no benchmark was run. |
➖ Matched the champion — no order improved — outranked: sub_6c4a712ed445 ranked higher and was adopted this round, so this submission was not evaluated against the champion — resubmit next round to compete againPer-order vs champion (same-pin): 0 better · 0 worse · 70 matched · 0 new — matched Identical output to the champion on all 70 orders. To win you need a strictly better route on at least one order — find pairs/sizes where a different route returns more output — OR ship better-factored code: your largest code region is 4109 AST nodes vs the champion's 4109; get it to ≤ 4009 to win this tie on factorization (lower is better) — OR ship less dead code: your unproductive-node count is 15155 vs the champion's 15155; delete ≥ 2000 more dead nodes to win this tie on deadwood (lower is better). Machine-readable per-order detail: |
⏭️ Not selected this roundnot selected for round-e29723931-n1 (rotation: 24 candidates, 3 slots) — resubmit next round; miners benched longest ago go first This was slate rotation (fair round entry), not a verdict on your solver — no benchmark was run. |
⏭️ Not selected this roundnot selected for round-e29723936-n1 (rotation: 24 candidates, 3 slots) — resubmit next round; miners benched longest ago go first This was slate rotation (fair round entry), not a verdict on your solver — no benchmark was run. |
➖ Matched the champion — no order improved — matched: no order better or worsePer-order vs champion (same-pin): 0 better · 0 worse · 71 matched · 0 new — matched Identical output to the champion on all 71 orders. To win you need a strictly better route on at least one order — find pairs/sizes where a different route returns more output — OR ship better-factored code: your largest code region is 4109 AST nodes vs the champion's 4109; get it to ≤ 4009 to win this tie on factorization (lower is better) — OR ship less dead code: your unproductive-node count is 15155 vs the champion's 15155; delete ≥ 2000 more dead nodes to win this tie on deadwood (lower is better). Machine-readable per-order detail: |
⏭️ Not selected this roundnot selected for round-e29723983-n1 (rotation: 24 candidates, 3 slots) — resubmit next round; miners benched longest ago go first This was slate rotation (fair round entry), not a verdict on your solver — no benchmark was run. |
⏭️ Not selected this roundnot selected for round-e29724021-n1 (rotation: 25 candidates, 3 slots) — resubmit next round; miners benched longest ago go first This was slate rotation (fair round entry), not a verdict on your solver — no benchmark was run. |
⏭️ Not selected this roundnot selected for round-e29724058-n1 (rotation: 25 candidates, 3 slots) — resubmit next round; miners benched longest ago go first This was slate rotation (fair round entry), not a verdict on your solver — no benchmark was run. |
⏭️ Not selected this roundnot selected for round-e29724095-n1 (rotation: 23 candidates, 3 slots) — resubmit next round; miners benched longest ago go first This was slate rotation (fair round entry), not a verdict on your solver — no benchmark was run. |
➖ Matched the champion — no order improved — outranked: sub_767ea0495c06 ranked higher and was adopted this round, so this submission was not evaluated against the champion — resubmit next round to compete againPer-order vs champion (same-pin): 0 better · 0 worse · 73 matched · 0 new — matched Identical output to the champion on all 73 orders. To win you need a strictly better route on at least one order — find pairs/sizes where a different route returns more output — OR ship better-factored code: your largest code region is 4109 AST nodes vs the champion's 4109; get it to ≤ 4009 to win this tie on factorization (lower is better) — OR ship less dead code: your unproductive-node count is 15155 vs the champion's 15155; delete ≥ 2000 more dead nodes to win this tie on deadwood (lower is better). Machine-readable per-order detail: |
⏭️ Not selected this roundnot selected for round-e29724132-n1 (rotation: 24 candidates, 3 slots) — resubmit next round; miners benched longest ago go first This was slate rotation (fair round entry), not a verdict on your solver — no benchmark was run. |
➖ Matched the champion — no order improved — outranked: sub_7de471c66d8a ranked higher and was adopted this round, so this submission was not evaluated against the champion — resubmit next round to compete againPer-order vs champion (same-pin): 0 better · 0 worse · 70 matched · 0 new — matched Identical output to the champion on all 70 orders. To win you need a strictly better route on at least one order — find pairs/sizes where a different route returns more output — OR ship better-factored code: your largest code region is 4109 AST nodes vs the champion's 4109; get it to ≤ 4009 to win this tie on factorization (lower is better) — OR ship less dead code: your unproductive-node count is 15155 vs the champion's 15155; delete ≥ 2000 more dead nodes to win this tie on deadwood (lower is better). Machine-readable per-order detail: |
Closed — a new champion was elected
Rebase your fork onto the latest |
Base DEX routing solver.