GoUncle: A Blockchain Of, By, For Modest Computers

A Blockchain Of, By, For Modest Computers

A Short Description of GoUncle

GoUncle is a blockchain for permissionless participation by modest computers. As in GHOST (Greedy Heaviest Observed SubTree, in successful implementation and use by the Ethereum blockchain’s Proofs-of-Work version), GoUncle blocks also record the public-key identities of some temporary forking blocks finders who are dearly called “uncles” (poorly named “orphans” in Bitcoin). While GHOST uncles are for saving PoW electricity, GoUncle assigns jobs for its uncles to do. In a payload distillation job, uncles choose from block payloads only the data logs complying with the blockchain database (DB) policy to announce and hope surviving the blockchain gossip protocol. With uncles distillations, the blockchain address, aka height, for a no-longer-need-to-trust block, is deterministic right upon the block appending the blockchain. These deterministic addresses can index partition the distributed DB into small files to store in nowadays over provisioned external storage even for a low-cost computer. The index partitioned DB files can be fast operable for input, output, lookup, insert, update, manage, …, etc., as a standard DB management system (DBMS) can. It is this very property of fast operable DBMS even by a modest computer that secures the blockchain DBMS by a hop-by-hop firewall among vast {\em semantics gossipers} who each looks up the local DBMS to judge either writing correct uncles distillations to the DB and forwarding them on, or discarding incorrect ones, both processed quickly. The hop-by-hop firewall works exactly as correctness probability amplification by repeated execution of a randomized probabilistic (RP) algorithm, and the GoUncle work establishes:

$$\mbox{Blockchains} \subset \mbox{RP}.$$

Also to be manifested in the present work are more general blockchain consensus layer computations that uncles can and should execute and disseminate the execution output as No-Spam and No-Single-Point-of-Failure (No-SPOF) set of blockchain servers.

Key Words and Phrases:  Easy Permissionless Blockchain.  Blockchain Uncles as No-Spam and No-SPOF Servers.  Blockchain Addressable Computers for Consensus Computations.  Semantics Gossip as Hop-by-Hop Firewall for Blockchain.  Blockchain as a Randomized Probabilistic (RP) Algorithm.  Permissionless Client-Server Architecture.

Decentralized Clock

Global Clock Cycles (DCC) enables every node in the P2P network to validate/express occurring times of events for block dissemination. DCCs are useful to formulate Consensus of Luck, to greatly ease and hence decentralize Proof-of-Work (PoW) block mining.

Incentive Byzantine Fault Tolerance (I-BFT)

DaoliCloud uses a novel Byzantine Fault Tolerance (BFT) protocol where the BFT group members are incentivized to work in collaboration for ease of reaching a consensus on who the winning miners are. An I-BFT consensus represents the voting of majority miners.

Open Membership for Byzantine Fault Tolerant Trustees Consortium

A blockchain where a Byzantine Fault Tolerance style of secure multiparty computation meets much eased PoW block mining = Permissionless Peer-to-Peer computing with truly decentralized security, scalability and sustainability.