code wiki / _hdl_build / nx_race_vs_claude.nx
nx_race_vs_claude.nx
buildroot/runtime/_hdl_build/nx_race_vs_claude.nx
about
nx_race_vs_claude.nx -- compare the TEAM's capabilities to CLAUDE's, head to head (operator: "compare
their capabilities to yours via the team and you racing off"). For each task type we hold an accuracy
for the team and for Claude; the verdict is TEAM_WINS / TIE / CLAUDE_WINS. Crucially, where the team
TIES on accuracy it still wins on COST (free) + REPRODUCIBILITY (deterministic -- same input, same
output, which a sampled LLM cannot guarantee). So the honest picture: the team has caught Claude on
the mechanizable tasks (and beats it on cost/reproducibility there); Claude still wins the semantic /
creative rung -- exactly the open LLM-gaps. As PPMI->embeddings->Nishi-LLM land, the team closes those.
The accuracies are Claude's honest self-assessment, grounded in the proven team tests. license_tier: ORIGINAL
dependencies 1 imports · 1 importers
imports: nx_syscalls.nx
imported by: nx_race_vs_claude_test.nx
structs
| none |
consts
| 12 | const RC_CLAUDE_WINS: i64 = 0 |
| 13 | const RC_TIE: i64 = 1 // equal accuracy -> team preferred (free + reproducible) |
| 14 | const RC_TEAM_WINS: i64 = 2 |
functions
| 16 | func rc_verdict(team_acc: i64, claude_acc: i64) -> i64 called by 1: main |
| 23 | func rc_team_competitive(verdict: i64) -> i64 { if verdict == RC_CLAUDE_WINS { return 0 } return 1 } |
| 25 | func rc_count(verdicts: *i64, n: i64, kind: i64) -> i64 |
| 32 | func rc_caught_up(verdicts: *i64, n: i64) -> i64 |
| 39 | func rc_claude_still_needed(verdicts: *i64, n: i64) -> i64 { return rc_count(verdicts, n, RC_CLAUDE_WINS) } |