Jev replaces Claude for ranking: 10,000 ranks for about $0.25
Jev returns only an ordered list, the gap between neighbors, and a cut-point, each with a stability score, at 80–500ms per rank.
the one skill Claude is bad at is the one skill your agent uses most. it's ranking. and you're paying for it 300 times a day. you ask it to pick the top 5 from 50 candidates. it reads them all, writes a paragraph on each, re-reads its own paragraphs to pick. three minutes later the top three change if you re-run it. same input, different winner. Jev was built for this. it's a mode that cannot write a single sentence. you hand it a list and a criterion, it gives back one of three things: -> an ordered list, best to worst -> the gap between each neighbor -> a cut-point where the gap goes flat each with a stability score, so your code knows whether to show 3 or 10. that's the whole mode. -> 80 to 500 milliseconds per rank -> $0.025 per million input tokens -> output is free -> 10,000 ranks for around $0.25. that's not because Jev reads your candidates better than Claude. it's because nobody asked it to show its work. > let Claude think about the criterion. > let Jev order by it. > let code decide where to cut. the catch: schema only, 200 candidates max per call, and ties return in input order not alphabetical. how to wire Jev-rank in front of every retrieval cutoff + the exact criterion format in the article below
This post quotes another post: x.com/0xcarnagee/status/2090102148344262659