Making Nock Fly
summary
Claims a new static analysis called subject knowledge analysis implemented in the Ares solid-state interpreter that eliminates most indirect calls, uses destination-driven code generation to registerize Nock programs, and refines Cheney on the MTA stack allocation so standard compiler optimizations apply. Compiles Nock to an SSA IR with direct calls, uses jets to avoid exponential number tricks for arithmetic, and runs a minimal Urbit‑shaped kernel (baby pill) with no indirect calls.
AI-written summary · about
chapters (10)
- 0:00Introduction to Knack
- 3:21Destination-driven code
- 6:37SSA code generation
- 10:40Optimization challenges
- 13:32Addressing interpreter latency
- 16:49Static call analysis
- 20:28Refining recursion handling
- 23:23Tracking provenance
- 27:02Demo and IR inspection
- 30:41Q&A and closing remarks
related talks
28mJolt: SNARKs for virtual machines via lookups
18mAirScript: Arithmetization for zk-STARKs
49mCoding Tomorrow
01h 00mAI Safety through Programming?
53mDoors of (AI)pportunity: The Front and Backdoors of LLMs
33mThe science of zero-knowledge
23mRunning an Open Source LLM on Open Source Hardware
15mI Know What You Said: Unveiling Hardware Cache Side-Channels in Local Large