Skip to main content
Ryan Orban

Ryan Orban

Subject
2 entries

Verification

Bookmarks

  1. LLM Verified with Monte Carlo Tree Search

    A research project using Monte Carlo Tree Search to guide and verify LLM code generation — MCTS explores the tree of possible completions and selects branches where generated code actually passes verification checks. An early example of search-augmented LLM reasoning.

  2. Agatha: Smart Contract for DNN Computation

    Agatha is a system for verifiable DNN computation on Ethereum smart contracts, achieving native-speed off-chain inference with only 3% overhead via a graph-based pinpoint protocol. It bridges AI and blockchain by solving the mismatch between neural network computational graphs and the VM-based execution model that existing verification schemes assume.

All bookmarks