Hacker News Reader

Bitcoin does have a (non-turing-complete) scripting language built in for ensuring that transactions meet arbitrary requirements. I wonder what subset of proofs could be verified in that environment.

View on HN

The language doesn't support loops; in terms of flow control, you get if statements and that's it. So probably not much of interest.

I wonder which is easier to encode, natural deduction or Hilbert style.

Reply on news.ycombinator.com