By 51% attack, I'm specifically referringCompetition is a good thing. It compels entities to an attack inwork harder and do a better job. However, cooperation is also a good thing. Competition is adversarial behavior, which an adversarymakes it undesirable at any time and place where entities are better off cooperating. And that's the problem with more than halfcompetitive mining. The benefits gained from competition fall far short of the benefits that can be gained from cooperation, and that's why everybody's mining for pools. If enough hash power of the network is ableconcentrated in a pool, the pool operator gets the opportunity to conduct a successful double spend attack by orphaning blocks. No matter how high the hashrate is, the risk of a 51% attack is always there in competitive mining.

TurnCooperation is preferable to competition in POW. Competitive mining is essentially parallel computing. The opposite of parallel computing is sequential computing, which means taking turns. For turn-based mining eliminatesto work, miners need to know when to mine. They need to follow a schedule. The schedule can take the riskform of a 51% attack because hash power no longer influences asimple list, and the miner's chancesidentities are their payment addresses. Every block contains a copy of mining blocks beyond taking turnsthe list. It introduces competition when necessary to deal with slow or non-responsive minersAddresses are added at the bottom and employs POS to prevent spamare removed from the top. HereWhen an address reaches the top of the list in the last block, it's that miner's turn to mine the idea:next block.

• Every block contains a list of miner payment addresses.
• Addresses are added to the bottom of the list from an address pool, similar to the mempool.
• When a miner's address reaches the top of the list, they get the opportunity to mine a new block.

Miners cannot produce blocks out of turn. For example, if a miner produces a block that competes with the last block, or if they produce a chain of blocks that compete with a bunch of previous blocks, even if it has a higher difficulty, it won't count because their address is not at the top of the lists in the blocks before those blocks. That eliminates the 51% attack. The opportunity to mine is no longer based on hash power, which fully decentralizes mining by eliminating the incentive to mine for pools.
When a node wants to mine, they must stake their address to get it added to the pool. When the next block is mined, the miner modifies the list from the last block by including any new addresses from the pool to the bottom of the list and removing their address, plus any addresses above theirs, from the top of the list.
Addresses are added to the list by lottery. When a node wants to mine, they generate a transaction with a miner flag set in the transaction header for a specific output. All these outputs constitute the "mining pool". This is not a POS scheme so coins are not locked up and can be spent at any time. When a miner spends their output, it indicates they no longer wish to mine and their address is removed from the list when the transaction is confirmed. A minimum balance requirement limits transaction spam.
If a miner takes too long, more than a single block interval, the second address is free to compete with the first address in the next block interval. Each block interval is a turn. If they both fail to produce a block in the second turn, the third address on the list is free to compete in the third turn. The pattern continues until a block is found. When a block is found, the next turn goes to the address after the one who produced the last block. For example, if the second address finds a block in the third turn, the next turn goes to the third address.
Every position on the list represent a future block height. If the first miner on the list in the last block fails to mine a block during his turn, he can continue to mine, but the second miner on the list is free to take his turn, in competition. This prevents DOS attacks and ensures that miners aren't delayed. Before the second miner mines a block, they must first generate a placeholder block to mine on top of. This block substitutes for the missing block and advances the list and the block height and marks the transition between turns. Placeholder blocks contain no transaction data, not even a coinbase transaction, and no POW is applied, so they can be created very fast. If the second miner then fails to mine a block in the second turn, the third miner on the list is free to take his turn, competing with the first two, and he creates a placeholder block on top of the last one. Competition escalates with each turn until someone finds a block. If the first or second miner finds a block in a later turn, it replaces the placeholder block. This doesn't count as orphaning blocks because it takes place while the miners are still mining.
Turn based mining helps decentralize mining
When a miner creates a block, they modify a copy of the list from the previous block by eliminatingremoving their address, plus any who failed to mine a block, and spent miner outputs. They then apply a random selection algorithm to the incentives formining pool to choose an address for each one removed. The algorithm combines the mining pool data with a nonce as inputs and outputs an address. Pool staking will beThe nonce is included in the block header and functions as a thing thoughcounter, increasing demand for the coin. Mining difficultyit's carried from block to block and is still determinedincremented by 1 every time an address is selected, so it can't be gamed. After the block rateis published, but the next miner will double check every element of last block rate is more consistent, including whether the miner included the entire mining pool in their address selections. If not, the block is invalid and the difficultynext miner will normalizeinstead mine on top of the block before it.

The first important property of the random selection algorithm is that it always makes the same choice for any specific set of inputs. This makes it possible to average solo mining speedverify that every address added to the list was chosen by the algorithm, not the miner. It also saves a lotThe second important property is that address selection changes unpredictably as the inputs change. The third important property is that the outcome is weighted by the size and age of energythe miner outputs, thereby creating demand for coins and transforms mining from deplorably inefficient to extremely efficiencydriving the price up. This also helps limit transaction spam.

By 51% attack, I'm specifically referring to an attack in which an adversary with more than half the hash power of the network is able to double spend by orphaning blocks. No matter how high the hashrate is, the risk of a 51% attack is always there in competitive mining.

This turnTurn-based mining eliminates the risk of a 51% attack because hash power no longer influences a miner's chances of mining blocks beyond taking turns. It introduces competition when necessary to deal with slow or non-responsive miners and employs POS to prevent spam. Here's the idea:

• Every block contains a list of miner payment addresses.
• Addresses are added to the bottom of the list from an address pool, similar to the mempool.
• When a miner's address reaches the top of the list, they get the opportunity to mine a new block.

When a node wants to mine, they must stake their address to get it added to the pool. When the next block is mined, the miner modifies the list from the last block by including any new addresses from the pool to the bottom of the list and removing their address, plus any addresses above theirs, from the top of the list.

If a miner takes too long, more than a single block interval, the second address is free to compete with the first address in the next block interval. Each block interval is a turn. If they both fail to produce a block in the second turn, the third address on the list is free to compete in the third turn. The pattern continues until a block is found. When a block is found, the next turn goes to the address after the one who produced the last block. For example, if the second address finds a block in the third turn, the next turn goes to the third address.

Turn based mining helps decentralize mining by eliminating the incentives for pool mining. Pool staking will be a thing though, increasing demand for the coin. Mining difficulty is still determined by the block rate, but the block rate is more consistent, and the difficulty will normalize to average solo mining speed. It also saves a lot of energy and improvestransforms mining from deplorably inefficient to extremely efficiency.

By 51% attack, I'm specifically referring to an attack in which an adversary with more than half the hash power of the network is able to double spend. No matter how high the hashrate is, the risk of a 51% is always there.

This turn-based mining eliminates the risk of a 51% attack because hash power no longer influences a miner's win ratechances of mining blocks beyond taking turns. It introduces competition when necessary to deal with slow or non-responsive miners and employs POS to prevent spam. Here's the idea:

• Every block contains a list of miner payment addresses.
• Addresses are added to the bottom of the list from an address pool, similar to the mempool.
• When a miner's address reaches the top of the list, they get the opportunity to mine a new block.

When a node wants to mine, they must stake their address to get it added to the pool. When the next block is mined, the miner modifies the list from the last block by including any new addresses from the pool to the bottom of the list and removing their address, plus any addresses above theirs, from the top of the list.

If a miner takes too long, more than a single block interval, the second address is free to compete with the first address in the next block interval. Each block interval is a turn. If they both fail to produce a block in the second turn, the third address on the list is free to compete in the third turn. The pattern continues until a block is found. When a block is found, the next turn goes to the address after the one who produced the last block. For example, if the second address finds a block in the third turn, the next turn goes to the third address.

Turn based mining helps decentralize mining by eliminating the incentives for pool mining. Pool staking will be a thing though, increasing demand for the coin. Mining difficulty is still determined by the block rate, but the block rate is more consistent, and the difficulty will normalize to average solo mining speed. It also saves a lot of energy and improves efficiency.

By 51% attack, I'm specifically referring to an attack in which an adversary with more than half the hash power of the network is able to double spend. No matter how high the hashrate is, the risk of a 51% is always there.

This turn-based mining eliminates the risk of a 51% attack because hash power no longer influences a miner's win rate. It introduces competition when necessary to deal with slow or non-responsive miners and employs POS to prevent spam. Here's the idea:

• Every block contains a list of miner payment addresses.
• Addresses are added to the bottom of the list from an address pool, similar to the mempool.
• When a miner's address reaches the top of the list, they get the opportunity to mine a new block.

When a node wants to mine, they must stake their address to get it added to the pool. When the next block is mined, the miner modifies the list from the last block by including any new addresses from the pool to the bottom of the list and removing their address, plus any addresses above theirs, from the top of the list.

If a miner takes too long, more than a single block interval, the second address is free to compete with the first address in the next block interval. Each block interval is a turn. If they both fail to produce a block in the second turn, the third address on the list is free to compete in the third turn. The pattern continues until a block is found. When a block is found, the next turn goes to the address after the one who produced the last block. For example, if the second address finds a block in the third turn, the next turn goes to the third address.

Turn based mining helps decentralize mining by eliminating the incentives for pool mining. Pool staking will be a thing though, increasing demand for the coin. Mining difficulty is still determined by the block rate, but the block rate is more consistent, and the difficulty will normalize to average solo mining speed. It also saves a lot of energy and improves efficiency.