The idea behind this payout scheme is that it removes all luck and only pays members based on their contribution to actual revenue earned by the pool. This scheme also incentivizes members to continue mining on in the pool even as the profitability of mining different coins rises comparatively. This is because disconnecting from the pool before a block is found will pay you nothing.
As can be seen in the table, none of the ASICs turn a profit at prices of $0.20 per KWh. The relative performance is mostly the same for each of the new-generation ASICs, while older models can be an attractive proposition if electricity is cheap.

Antpool mined its first block in March 2014, meaning that it emerged roughly four years after the first mining pool; Slushpool.
80ad90d403581fa3bf46086a91b2d9d4125db6c188ac00000000 merkle_branch["ea9da84d55ebf07f47def6b9b35ab30fc18b6e980fc618f262724388f2e9c591", ...] version00000002 nbits19015f53 ntime53058b41 clean_jobsfalse The job_id is used to identify this mining task if the miner reports back success. Most of the fields are used in the block header. The prevhash is the hash of the previous block. Apparently mixing big-ending and little-endian isn't confusing enough so this hash value also has every block of 4 bytes reversed. The version is the block protocol version. The nbits indicates the difficulty[3] of the block. The timestamp ntime is not necessarily accurate. The coinb1 and coinb2 fields allow the miner to build the coinbase transaction for the block. This transaction is formed by concatenating coinb1, the extranonce1 value obtained at the start, the extranonce2 that the miner has generated, and coinb2. The result is a transaction in Bitcoin protocol. The merkle_branch hash list lets the miner efficiently recompute the Merkle hash with the new coinbase transaction. After receiving this data, the miner can start generating coinbase transactions and mining blocks. Creating a block for a pool Once the miner has received the information from the pool, it is straightforward to form the coinbase transaction by joining the coinb1, extranonce1, extranonce2, and coinb2 to form a coinbase transaction. The diagram below shows how the combination of these four values forms a complete transaction, with the nonces in the middle of the coinbase script. (The block below is slightly different from the one described earlier.) Once the coinbase transaction is created, the hash for this coinbase transaction is combined with the merkle_branch data from the pool to generate the Merkle hash[4] for the entire set of transactions. Because of the structure of the Merkle hash (explained below), this allows the hash for the entire set of transactions to be recomputed easily. Finally, the block header is built from the new Merkle hash and the data provided by the pool, and the hash algorithm can iterate over the nonce values in the header, just like the Python program earlier. Once all the nonce values have been tried, the miner increments the extranonce2, generates a new coinbase transaction and continues.