Designing Predictable LLM-Verifier Systems for Formal Method Guarantee
40 points
6 hours ago
| 2 comments
| arxiv.org
| HN
brantmv
1 hour ago
[-]
Maybe I'm wrong, but it looks like the authors did not actually have any LLMs write or verify any code for their experiments. Instead, their experiments consist of simulating the simplified Markov chain model itself. They simulated their simple Markov chain and checked if the theorem's predictions matched empirical statistics. This amounts to a test not of their model, but of basic Markov chain theory.

Did I misread or miss something?

reply
mapontosevenths
54 minutes ago
[-]
This line made me pause:

"We prove that for any non-zero stage success probability, the system reaches the verified state almost surely"

What's the point if its still stochastic?

reply
jaggederest
46 minutes ago
[-]
"almost surely" means "happens with a probability 1", which in infinite set contexts doesn't mean that there aren't other outcomes, but that they have probability 0.

So like, imagine that you had some finite list of integers, and you were picking a random number from 0 to infinity - because the domain is infinite, any finite set has 0 probability, but that doesn't mean it doesn't exist.

https://en.wikipedia.org/wiki/Almost_surely

reply
IanCal
49 minutes ago
[-]
Hash collisions are possible but can be provably so rare that they’re not a relevant concern.
reply