~/talk

Verifiably Safe Agentic Compute

Talkat AI By the Bay 2025 · 2025-11-17..11-19· [security, ai-assisted-development]
slides:none on file

Claims that LLMs are just branch predictors and that useful agentic systems need a new compute stack not bigger models. Proposes a programming language that emits a Universalis spec, LLMs generate JSON-backed code plus a machine-checkable proof, and a non-ML verifier such as a Lean verifier checks the proof before running on the Automat runtime. Uses structured outputs to enforce syntax, treats proofs as cheap to check and tool calls as primitives rather than teaching models arithmetic.

AI-written summary · about

  1. 0:00Introduction
  2. 0:10Learning from AI history
  3. 11:12Asymmetry in verification
  4. 12:54Neural computers vision
  5. 16:36Programming for the AI era
  6. 17:51Extended mind and tools
  7. 21:01The lethal trifecta
  8. 21:52Principles of secure AI
  9. 24:36Proof-carrying code
  10. 25:14The case for new languages
  11. 28:13Universalis implementation
  12. 28:56Hybrid user interfaces
  13. 29:37Intentional programming
  14. 29:58Open safety problems
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.