FIAT MONEY is borrowed into existance, and its borrowed to people that has capital guarranties. Also CRYPTOCURRENCIES (Proof of Work or Proof of Stake) create money and distributes this money proportional to CAPITAL, because you need capital in order to build a miner node or to proof you have a crypto stake. NEW CREATED MONEY has to be distributed proportional to PEOPLE, not to CAPITAL. Distributing created money proportional to capital is not sustainable in time.

There will be a few cryptocurrencies in the future, from wich people and merchants (and then miners) will choose the most convenient.

PEOPLE COIN is a ETHEREUM variation in which we include in every mined block, a coinbase transaction send to a DAO that belongs to THE PEOPLE.

This DAO has as its only purpose to belong to every person in equal parts. People have to subscribe to it using their State oficial ID (Identity Oracle?) including a Ethereum personal address. This DAO will receive a Coinbase tx on every mined block and distribute it in equal parts to all the people. Miners will go along with it if the coin goes mainstream, and it will.

We need a Decentralized (human decentralized), Scalable, Secure, Anonymous and Efficient (micro transactions enabled, quick and cheap) MONEY system, in that order.

Proof of Work consensus protocol is a waste of computational resources, that’s why it will not be scalable and decentralized at the same time. We propose a solution called Proof of Raffle.

The protocol can establish that miners must always fill up the block up to the size limit (today 1 mega), and transactions must be ordered in time stamp and alphabetical order into the block. Then all miners could achieve almost exactly the same transactions in the exact same order into each block.

Nodes that reach the block size limit automatically send their proposed block to the network. Then every node complements their proposed block with the transactions that are included in other proposed blocks. New transactions received at this point go to the mem pool to be considered in the next block. When a node has received the proposed blocks from a minimum of 80% of all other "active nodes" (nodes that first confirmed any of the transactions included in the block) and included all the missing transactions, then this node has its CONFIRMED BLOCK.

Forks can happen if there are more than one confirmed different last block. The confirmed block with the less number of transactions wins.

Also the heavier blockchain, the one that has more different nodes confirming transactions first in every block of the blockchain, wins.

Problem/Solution: The isolated island problem: If we have a little island where lots of heavy transactions are made per second, and they manage to work for one day long without connecting with the rest of the world, and suddenly they connect and make a big blockchain fork… Yes they could manage to confirm a lot of blocks in their blockchain and yes the first block of the fork from the rest of the world would have fewer transactions that the equivalent block from the rest of the world, BUT, they will ever count more node confirmations along the blockchain so they will lose.

Then the miners could obtain the concatenated hash (hash from last block and merkle hash from actual block hashed all together) of the block. From this SHA-256 hash we pull only the numbers and obtain a BIG NUMBER. Also we make a circular list of active nodes (nodes that were the first to validate each transaction in this actual block) and we order them according to their arrival position in the block, in a circular way (the last node is next to the fist node of the list) where any node only have one position on the circular list. Starting from the first node of the list (the node that validated the first transaction included in the block), we use the BIG NUMBER to count around the circular nodes list until we pick the winner. This will be the proponed winner node that will benefit from the coinbase transaction (money created).

Sybil attacks can be avoided by a Proof of Steak in every active node.

Problem/Solution: People owning more active nodes would be a centralization risk on the long run, but, owning a node will be very cheap, so there will be many of them, originating the “lottery ticket” effect for all of the raffle participants.

Different methods can be used to make more than one winner in every raffle cycle, so financial exposure will decrease for miners. For example: Counting N times the BIG NUMBER around the active nodes circular list, where N = Active nodes / 1000. We will have N winner nodes in every raffle cycle.

We need a Decentralized (human decentralized), Scalable, Secure, Anonymous and Efficient (micro transactions enabled, quick and cheap) MONEY system, in that order.

Proof of Work consensus protocol is a waste of computational resources, that’s why it will not be scalable and decentralized at the same time. We propose a solution called Proof of Raffle.

The protocol can establish that miners must always fill up the block up to the size limit (today 1 mega), and transactions must be ordered in time stamp and alphabetical order into the block. Then all miners could achieve almost exactly the same transactions in the exact same order into each block.

Nodes that reach the block size limit automatically send their proposed block to the network. Then every node complements their proposed block with the transactions that are included in other proposed blocks. New transactions received at this point go to the mem pool to be considered in the next block. When a node has received the proposed blocks from a minimum of 80% of all other "active nodes" (nodes that first confirmed any of the transactions included in the block) and included all the missing transactions, then this node has its CONFIRMED BLOCK.

Forks can happen if there are more than one confirmed different last block. The confirmed block with the less number of transactions wins.
Also the heavier blockchain, the one that has more different nodes confirming transactions first in every block of the blockchain, wins.

Problem/Solution: The isolated island problem: If we have a little island where lots of heavy transactions are made per second, and they manage to work for one day long without connecting with the rest of the world, and suddenly they connect and make a big blockchain fork… Yes they could manage to confirm a lot of blocks in their blockchain and yes the first block of the fork from the rest of the world would have fewer transactions that the equivalent block from the rest of the world, BUT, they will ever count more node confirmations along the blockchain so they will lose.

Then the miners could obtain the concatenated hash (hash from last block and merkle hash from actual block hashed all together) of the block. From this SHA-256 hash we pull only the numbers and obtain a BIG NUMBER. Also we make a circular list of active nodes (nodes that were the first to validate each transaction in this actual block) and we order them according to their arrival position in the block, in a circular way (the last node is next to the fist node of the list) where any node only have one position on the circular list. Starting from the first node of the list (the node that validated the first transaction included in the block), we use the BIG NUMBER to count around the circular nodes list until we pick the winner. This will be the proponed winner node that will benefit from the coinbase transaction (money created).

Problem/Solution: People owning more active nodes would be a centralization risk on the long run, but, owning a node will be very cheap, so there will be many of them, originating the “lottery ticket” effect for all of the raffle participants.

Different methods can be used to make more than one winer in every raffle cycle, so financial exposure will decrease for miners.

Proof of Work consensus protocol is a waste of computational resources. This model will not be scalable and decentralized at the same time. We propose a solution that is somewhere between the Ripple and Bitcoin protocols and we include a Raffle, we call it Proof of Raffle.

Bitcoin client can establish that miners must always try to fill up the block size limit (today 1 mega), and transactions must be ordered in alphabetical and time stamp order into the block. Then all miners could achieve almost exactly the same tx’s in the exact order into each block (it doesn’t matter if some miners try to cheat by manipulating tx’s names or timestamps…).

Tx´s propagation statistics show that in 15 seconds more than 99% of tx’s have reached all nodes.

When 15 seconds have passed, miners could obtain the concatenated hash (hash from last block and merkle hash from latest block hashed all together). From this hash then we pull only the numbers and obtain a BIG NUMBER. Also we make a circular list of active nodes (nodes that have validated transactions in this last block) and we order them alphabetically in a circular way (the last node is next to the fist node of the list). Starting from the first node of the list, we use the BIG NUMBER to count around the circular active nodes list until we pick the winner. This will be the proposed winner node.

Every node then send (and receive) their proposed last block (and proposed winner node) to all other nodes. If a node receives any more late transactions that will change their proposed block it can send their new proposed blockchain (and winner node) again to all other nodes. Finally every node can pick the block that is confirmed by most of the nodes as the last block of the blockchain (maybe wait for 80% consensus) and accept it as the last confirmed block, and confirmed winner node.

Folks, try to analyze the concept, don’t hit me in nonsense stuff, and sorry for the bad English.

Nodes could avoid the hard work that represents finding the "nonce" to get a hash with a lot of zeroes in a row. Then anybody could afford a node and Bitcoin would be a lot more decentralized.

Bitcoin client can establish that nodes must always try to reach the block size limit (today 1 mega), and transactions must be ordered in alphabetical and time stamp order into the block, then all nodes could achieve almost exactly the same block, then find the block hash and try to find concensus (on this hash) among all the nodes of the bitcoin network.

From this concensuated hash then we pull only the númbers and obtain a BIG NUMBER.

Also we make a circular list of active nodes (nodes that have validated transactions in this last block) and we order them alphabeticaly in a circular way (the last node is next to the fist node of the list).

Starting from the first node of the list, we use the BIG NUMBER to count around the circular list until we pick the consensuated winner.

This winner node takes the new created bitcoins and the transaction fees...

Miners spend a lot of computing power only to find the nonce in order to pull the hash number with a lot of ceros.
They compete with each other, to win the 25 bitcoin price.

Avoiding nonce calculations will stop bitcoin centralization.

We must use random number of transactions per block as an input to pick a winer miner choosing from the blockchain (the miner that solved each block) and the new miners (first miner that received and distributed every new transaction that is to be confirmed in the new block).

For example:

Number of transactions of the new block = 600

We generate a simple algorithm, maybe 600^3 = 216,000,000

Númber of blocks in the blockchain =  360,000

To pick the winer you put all the blocks from the block chain and the new transactions in a "circle" and start counting 216,000,000 positions around the circle. The miner that you pick, thats the winer for this new block.

Little diferences must be resolved and consensus reached to reply the new block to all miners.