I have been reviewing Intel’s paper Bonanza Mine: an Extremely-Low-Voltage Power-Environment friendly Bitcoin Mining ASIC the place they declare to have a completion adder optimised with a hardcoded fixed that’s distinctive to every spherical.
This reveals a completion adder that follows a CSA to have 2 variable and 1 fixed enter to provide the output worth.
I am attempting to wrap my head round how would this work internally. From a fact desk viewpoint, there will probably be a case the place A = B = Cin = Ok = 1. How would such a case be dealt with?
Contemplating a Carry Look-ahead mechanism might have been used which does not require the propagation of the carry internally, how would the fixed Ok be built-in into this structure? Moreover, can Ok be hardcoded in the same approach into the CSA such that the CSA would have 3 variable and 1 fixed enter?