A. It is NOT a complex calculation. The SHA algo simply takes a set of inputs and applies them to a boolean logic table which then spits out a result. It is not doing any kind of usual add/subtract/multiply/divide/carry sequential math operations like how a typical computer does things. In a sense, you could say those functions happen all at once in a massively parallel operation. A good start on that using code that works with chip design software such as Cadence is or do a search using "sha256 logic gates" as the search term. B. That logic table is hardwired into each ASIC core which is each comprised of thousands of AND, XOR and INV gates, each chip has from several hundred to maybe 2k of those cores and a miner can have from 1 to a few hundred of the ASIC chips in it. C. Operation is:  c1. Pool supplies work to the miner controller that creates the inputs to be fed to the ASIC's.  c2. From that work, apply inputs in parallel, cycle clock to run through the logic table which will then immediately present the result which is a simple 1 or 0 (yes you found a block or no so try again).  c3. If no block found, increment nonce value then repeat 'c2 & c3' until a block is found or until pool sends new work. D. If a block is found, notify the pool you are using so it can verify and broadcast 'Block Found' to the 1win Registration network. The only real bottleneck is that yes, the CPU's in a miner are creating the inputs to the ASIC chips and responding to their output however that does not take much speed to do. That is why RasPi's, BeagleBones, etc can be used as the controller in a miner. A good place for you to read up on what the input data is can be found starting here A rather fun live action page for what happens is here
A. It is NOT a complex calculation. The SHA algo simply takes a set of inputs and applies them to a boolean logic table which then spits out a result. It is not doing any kind of usual add/subtract/multiply/divide/carry sequential math operations like how a typical computer does things. In a sense, you could say those functions happen all at once in a massively parallel operation. A good start on that using code that works with chip design software such as Cadence is or do a search using "sha256 logic gates" as the search term. B. That logic table is hardwired into each ASIC core which is each comprised of thousands of AND, XOR and INV gates, each chip has from several hundred to maybe 2k of those cores and a miner can have from 1 to a few hundred of the ASIC chips in it. C. Operation is:  c1. Pool supplies work to the miner controller that creates the inputs to be fed to the ASIC's.  c2. From that work, apply inputs in parallel, cycle clock to run through the logic table which will then immediately present the result which is a simple 1 or 0 (yes you found a block or no so try again).  c3. If no block found, increment nonce value then repeat 'c2 & c3' until a block is found or until pool sends new work. D. If a block is found, notify the pool you are using so it can verify and broadcast 'Block Found' to the 1win Registration network. The only real bottleneck is that yes, the CPU's in a miner are creating the inputs to the ASIC chips and responding to their output however that does not take much speed to do. That is why RasPi's, BeagleBones, etc can be used as the controller in a miner. A good place for you to read up on what the input data is can be found starting here A rather fun live action page for what happens is here

A. It is NOT a complex calculation. The SHA algo simply takes a set of inputs and applies them to a boolean logic table which then spits out a result. It is not doing any kind of usual add/subtract/multiply/divide/carry sequential math operations like how a typical computer does things. In a sense, you could say those functions happen all at once in a massively parallel operation. A good start on that using code that works with chip design software such as Cadence is or do a search using "sha256 logic gates" as the search term. B. That logic table is hardwired into each ASIC core which is each comprised of thousands of AND, XOR and INV gates, each chip has from several hundred to maybe 2k of those cores and a miner can have from 1 to a few hundred of the ASIC chips in it. C. Operation is:  c1. Pool supplies work to the miner controller that creates the inputs to be fed to the ASIC's.  c2. From that work, apply inputs in parallel, cycle clock to run through the logic table which will then immediately present the result which is a simple 1 or 0 (yes you found a block or no so try again).  c3. If no block found, increment nonce value then repeat 'c2 & c3' until a block is found or until pool sends new work. D. If a block is found, notify the pool you are using so it can verify and broadcast 'Block Found' to the 1win Registration network. The only real bottleneck is that yes, the CPU's in a miner are creating the inputs to the ASIC chips and responding to their output however that does not take much speed to do. That is why RasPi's, BeagleBones, etc can be used as the controller in a miner. A good place for you to read up on what the input data is can be found starting here A rather fun live action page for what happens is here

A. It is NOT a complex calculation. The SHA algo simply takes a set of inputs and applies them to a boolean logic table which then spits out a result. It is not doing any kind of usual add/subtract/multiply/divide/carry sequential math operations like how a typical computer does things. In a sense, you could say those functions happen all at once in a massively parallel operation. A good start on that using code that works with chip design software such as Cadence is or do a search using "sha256 logic gates" as the search term. B. That logic table is hardwired into each ASIC core which is each comprised of thousands of AND, XOR and INV gates, each chip has from several hundred to maybe 2k of those cores and a miner can have from 1 to a few hundred of the ASIC chips in it. C. Operation is:  c1. Pool supplies work to the miner controller that creates the inputs to be fed to the ASIC's.  c2. From that work, apply inputs in parallel, cycle clock to run through the logic table which will then immediately present the result which is a simple 1 or 0 (yes you found a block or no so try again).  c3. If no block found, increment nonce value then repeat 'c2 & c3' until a block is found or until pool sends new work. D. If a block is found, notify the pool you are using so it can verify and broadcast 'Block Found' to the 1win Registration network. The only real bottleneck is that yes, the CPU's in a miner are creating the inputs to the ASIC chips and responding to their output however that does not take much speed to do. That is why RasPi's, BeagleBones, etc can be used as the controller in a miner. A good place for you to read up on what the input data is can be found starting here A rather fun live action page for what happens is here