Overview & Result
I just built a Jev X Viral Post Analyser. 100,000 viral X posts. 20.4 seconds. $0.67. Claude Opus 5, same corpus, same clock, got through 214 posts and spent $0.98. per post that is ~680x cheaper the full Opus pass would have run $458. viral analysis is the perfect Jev job. • it is not writing, it is 14 yes/no calls per post: > does the hook open a loop, > is there a number in the first line, > is the proof real or claimed. classification, not prose. • what it found: 1,220 posts broke into the top 1%. baseline 1.22%. > superlative claim - 2.34% viral. 1.92x baseline > contrarian take - 1.59%. 1.31x > launch / tool drop - 1.46%. 1.19x and numbered lists, the thing everyone writes: 0.55%. below baseline. the most used hook is the least viral one. full stop. • what you are watching: left is the post under analysis, right is Jev answering 14 typed questions about it, each with a confidence score. the run stops at 20.4s because that is when Jev finished all 100k. pulled the corpus through a few X APIs, one parallel pass into Jev. should I drop it to public? Read my latest article on Jev Engineering below and turn your ideas into reality.
How Jev fits in the loop
- Ingest real-time application state and relevant contextual parameters
- Format the decision problem as a bounded Choice or Noul schema
- Query Jev to receive a typed probability distribution in sub-50ms
- Execute downstream actions or route tasks according to the winning choice
How to reproduce
- Inspect the original showcase and source material at https://x.com/0xMovez/status/2101325703635435523
- Verify the bounded prompt and input candidate schema configured for Jev
- Benchmark decision latency and classification accuracy against baseline models
Why this build matters
Demonstrates a real-world, cost-effective implementation of Jev in a specialized agent workflow scenario, replacing expensive generative calls with fast typed decisions.
Reported performance
Reported by authorLatency: Sub-50ms deterministic decision window
Limitations
- Task accuracy is bounded by the precision of the defined candidate choices
- Third-party external dependencies and network latency may affect total workflow duration