-Simple Random

This paper describes Simple Random (blockchain) technology.

It has been hashed onto Bitcoin Network.

A Bitcoin documenting process. Basically you hash a file to a unique private key.  This proves basically that the file existed.  I use Convert_Photo_2_Public_Address.py and then send a payment to the public key to time-stamp it. (Keep your file and maybe your private key.) 

To give feedback use info át k0in dt com.


-Introduction

To begin with, I am not sure how similar or different this is from existing blockchain technology. 

The purpose of hash power is confirm the reality of computer presence.  When we can confirm real-world identity, another type of blockchain is possible.  This system may be more secure and more democratic than current ideas out there.

I was sure this idea was possible, and now I am more confident.  This brief attempt needs proving. 


-Limited Consensus and Consensus

First, multiple miners/nodes hash a block. A random sampling of miners send their blocks (called mini-blocks) to each other and confirm legitimacy.  Once they agree on a good block, they send it and the network accepts it. Based on new block's hash, everyone knows who the next collection of hashers is.  (Certified or verified miners are sent across the blockchain so a list of all miners is kept on every node.) 

A mini-block is like this

13000 hash1 sig  98%
13500 hash2 ...  98%
13520 hash3    98%
13525 hash4    98%
13526 hash5    98%
...
13534 hash13    98%
13535 hash14    60% << use 
13536 hash15    30%


Every chosen node sends something like this to each other, and when any of them have 60% of the messages with a hash that matches, then the node pulls from its own list of transactions, and creates a block matching the hash.  

Chosen nodes send mini-blocks at designated times or as a set number of transactions is reached.

Each number represents an ordered list of transactions, and the hash guarantees that a node's first 13000 ordered transactions, are the same as any others.  Once hashes don't agree it means some transactions floating around the network have not arrived to other parts.  But chances are, after so much time, every node will have the same list minus a few last-second transactions.  So it moves down or up until it has the newest list with 60% agreement.  

Nodes basically send on transactions to the network (possibly in groups larger than 1), so the entire network is dealing with the same transactions, except the last few, over time.  So transactions are being passed over the network continuously.

Once a group or collection of chosen nodes agree on a block, it is sent out with the signatures and perhaps hash history attached.  (Signatures accompany mini blocks)  Actually, any node should be able to reconstruct the final block using the miniblock.  Three last hashes with the last two transactions would give triple verification.  Within a few seconds the entire network accepts the new block.  This block hashed, produces the new random code for selecting next group.