 The general problem of optimizing parallel prefix adders is identical to the variable block size, multi level, carry-skip adder optimization problem, a solution of which is found in Thomas Lynch's thesis of 1996.An example of a 4-bit Kogge–Stone adder is shown in the diagram.Each vertical stage produces a "propagate" and a "generate" bit, as shown.