Playground
CommunityJev Demos & Experiments
Jev Wikiracer
A Wikipedia race you play against Jev. From the same start article, each hop is one Choice over that page's outbound links.
- Format
- Playground
- Reading time
- 2 min
- Published by
- Community
- Last verified
- Sep 2026
Works forJev for Ranking
- Platforms
- Browser
Highlights
- You and Jev start on one Wikipedia article and race to a target using only in-article links.
- Each Jev hop is one Choice over dozens of outbound links, asking which link gets closest to the target.
- The page says the hosted race needs no key, and quotes about 200 ms per hop.
- A random-pair button picks the start and target. First to the target wins.
Watch out
Independent site, not TypeSafe or Wikimedia. The sample client posts to jevtypesafeai.com/api/v1/decide. Link text is whatever Wikipedia returns.
Questions about this entry
Short answers drawn from the linked project or page.
It is presented as live: each hop shows its own latency, cost and confidence split, one example reads 208 ms at $0.000017 with Coffeehouse 58%, Enlightenment 27%, Trade 15%. The page also prints the full request so you can rebuild it yourself. Nothing here is independently verifiable, though. Treat the numbers as the site's own demonstration.
Nothing does, and the page does not claim otherwise. The hosted race runs on jevtypesafeai.com with no key, while the build-it-yourself snippet posts to the same /api/v1/decide endpoint with a bearer JEV_API_KEY. So the hosted version proves the loop works, not that the reasoning behind each pick is anything a canned script could not imitate.
The page shows a three-way split per hop and nothing else. There is no accuracy measured over finished races, no confidence-versus-hit-rate curve, and no explanation of what the percentages are probabilities of. If you want to know whether a 58% pick is right 58% of the time, this page cannot tell you.
You are not handicapped, but you are not helped either. The page concedes Jev only hops roughly every 1.7 seconds and calls itself quick, while you click freely. Its own advice is that a broad hub article links onward to more pages than a narrow one, and that directly-linked targets are highlighted for you.
A random-pair button picks the start and target article, or you can begin from the same start as Jev and race to the target using only in-article links.
Each hop is one Choice over that page's outbound in-article links, asking which link gets closest to the target; the option list is whatever Wikipedia's article links provide.
No. It only reads article links and uses whatever text Wikipedia returns; it is an independent site, not Wikimedia or TypeSafe, and the hosted race needs no key.
Reactions & coverage
Posts, threads, and videos about this entry from around the web.
Hacker News: Software Bombe and live Enigma demo where Jev ranks cribs and judges plaintext.
ag_212 pointsShow HN: Jev as the Bletchley Park Analyst: A Software Bombe on EnigmaRead the thread on Hacker NewsHacker News: Show HN for public Minecraft PvP where a diffusion LM picks moves from structured state.
2 pointsShow HN: Minecraft PvP against DiffusionGemma-as-Jev, 24 ms per decisionRead the thread on Hacker NewsHacker News: Show HN: Jev finished a Pokémon Red run, with the Hall of Fame stats on the landing page.
pancomplex272 pointsShow HN: Jev Plays Pokémon RedRead the thread on Hacker NewsHacker News: Show HN: a mouse colony where each next move is Jev or a fixed rule.
1 pointShow HN: Jev-mice – mouse colony simulation using Jev and deterministic engineRead the thread on Hacker NewsFrom the Jev guides
Original write-ups on what this entry is for.
From the Jev AI model community
Posts from builders shipping with Jev right now.