Joseph Bebel is a theoretical computer scientist with research interests in computational complexity theory, probabilistically checkable proofs, and SNARKs. He is interested in ways to apply theoretical results to real world systems.
Joseph Bebel is a theoretical computer scientist with research interests in computational complexity theory, probabilistically checkable proofs, and SNARKs. He is interested in ways to apply theoretical results to real world systems.