I've been reviewing Intel's paper Bonanza Mine: an Ultra-Low-Voltage Energy-Efficient Bitcoin Mining ASIC where they claim to have a completion adder optimised with a hardcoded constant that is unique to each round.

This shows a completion adder that follows a CSA to have 2 variable and 1 constant input to produce the output value.

I'm trying to wrap my head around how would this work internally. From a truth table point of view, there will be a case where A = B = Cin = K = 1. How would such a case be handled?

Considering a Carry Look-ahead mechanism may have been used which doesn't require the propagation of the carry internally, how would the constant K be integrated into this architecture? Additionally, can K be hardcoded in a similar way into the CSA such that the CSA would have 3 variable and 1 constant input?


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.