Abstract: Efficient zero-knowledge (ZK) proofs for arbitrary boolean or arithmetic circuits have recently attracted much attention. Existing solutions suffer from either significant prover overhead (i ...

Increment and decrement. They sound like simple functions. But even the simplest functions can get quite complex in a microprocessor design. Ken Shirriff has written up a great blog post about his ...

Abstract: In this paper, we study the problem of finding the complexity of representations of Boolean functions in classes of polynomials and reversible circuits of a special form. The extending ...