user4334: What is the theoretical minimum number of logical operations an ASIC needs to perform to compute double iterated SHA256, i.e., sha(sha(•))?

user4334: 
SHA256D, which is what Bitcoin uses, is 128 rounds, comprising
768 additions,
640 ORs
896 XORs
And a bunch of bit shifts but bit shifts are free on an ASIC.

(source)

4334: <p>What is the theoretical minimum number of logical operations an ASIC needs to perform to compute double iterated SHA256, i.e., sha(sha(•))?</p>
 4334: <blockquote>
<p>SHA256D, which is what Bitcoin uses, is 128 rounds, comprising</p>
<p>768 additions,</p>
<p>640 ORs</p>
<p>896 XORs</p>
<p>And a bunch of bit shifts but bit shifts are free on an ASIC.</p>
</blockquote>
<p>(<a href="https://bitcointalk.org/index.php?topic=1029536.msg11131028#msg11131028" rel="nofollow noreferrer">source</a>)</p>
