Verifiable Computing in Haskell

Speaker: Anthony Sheldon.

Verifiable computing schemes aim to verify the remote execution of a program on an untrusted machine.

Anthony will explain how to encode the operations of a simple embedded DSL to a single cryptographically-checkable polynomial test, and then prove there is correct execution for given inputs and outputs.

Please note this is the October talk, scheduled one week later than normal.