WHAT NEW IN X10.28 WED

X 上的 AI 合集档案 · 22 个合集 · 58,924 条

jevVIDEO

Jev 信号 loom 泄露:决策压成 8–13 位数据包

泄露的 Jev 决策 loom 用 CHOICE、SCORE、NOUL 三种头把每次决策压成 8–13 位,2–4ms 一包,带 hex 包日志和 0.85 置信度门控,不再解析整段模型推理。

Varian
@0xVarian1 天前收录原推发布于 2026.10.27
Varian @0xVarian原推发布于 2026.10.27
在 X 上打开原推

WHOEVER LEAKED THIS JEV SIGNAL LOOM DESERVES A SHANNON MEDAL I thought an agent decision was a whole paragraph of model reasoning parsed into a boolean at the end. Apparently not. This loom's setup is much more interesting: → CHOICE packs the answer into 8 bits of one label from a labeled set, 2ms per packet, 472 per second, no prose anywhere in the loop → SCORE packs into 9 to 12 bits of ordered labels or a bounded float, 3ms per packet, 422 per second, no "explain the score" filler → NOUL packs into 10 to 13 bits of yes/no with calibrated confidence, 4ms per packet, 472 per second, no third outcome allowed → PACKET LOG tags every answer with a hex id, bit count and confidence (PKT 0x5710 noul 13 bits 0.87, PKT 0xA180 choice 8 bits 0.86), no ambiguous mapping between answer and action → GATE checks confidence against 0.85 per packet type before anything reaches code, flags 7 packets whose bit entropy spiked past the baseline this run so you get: Choices in 8 bits. Scores in 12. Nouls in 13. Gates per packet. the interesting part isn't picking a smarter model. it's giving every decision an answer small enough to fit in a packet. Instead of parsing a 400-token model reply to extract a yes-or-no, you run three heads at 2 to 4ms per answer, each one 8 to 13 bits wide, with the gate dropping anything under 0.85 before it ever hits the executor. Pack the choice. Score the ordered. Noul the yes.

这条是引用着另一条写的:「长文:如何搭好 Jev 驱动的 agent 技术栈」

x.com/0xvarian/status/2114751571355459966采集于 2026.10.27 09:58