Michael F. Gilbourne
BITCOIN TAROT - 10 of CUPS
HAPPY HOME, SHARED LOVE, BLESSINGS, PEACE, FAMILY
WHAT THE INITIATE,
Satoshi might be dwelling on in his childhood memories in The 10 of Cups card:
I remember my childhood memories. I was already playing with the forces of nature, building under the sun. Now reflecting on life, there is no surprises on all that I did. I followed my dreams surrounded by many influential groups that I lead and became popular. I am surrounded by love and admiration for the Bitcoin creation.
Early influences shaping the creation of Bitcoin,
Statements from prominent and Nobel Prize-winning economists, F. A. Hayek indicate that there has been a need for a government-independent monetary system (1974)
The Cypherpunk’s Manifesto’ published on March 9, 1993 laid out the cypherpunk movement’s goals, which included the creation of an electronic money system that would support anonymous transactions.
The 2008 financial crisis likely represented one of the reasons for the launch of Bitcoin
Cryptography community, Cyber punks worked on how to keep personal privacy online.
How to create digital cash
Creation of the Blockchain concept
Proof of work used on the Bitcoin blockchain. (There are many other concepts like proof of time, stakes...)
What is Byzantine Fault Tolerance?
Satoshi Proof of work algorithm is the solution to the Byzantine Fault Tolerance (BFT). BFT is the feature of a distributed network to reach consensus(agreement on the same value) even when some of the nodes in the network fail to respond or respond with incorrect information. The objective of a BFT mechanism is to safeguard against the system failures by employing collective decision making(both – correct and faulty nodes) which aims to reduce to influence of the faulty nodes (double spending). BFT is derived from Byzantine Generals’ Problem.
Byzantine Generals’ Problem had been explained, but never solve before.
Satoshi's White Papers solved it.
The problem was explained aptly in a paper by LESLIE LAMPORT, ROBERT SHOSTAK, and MARSHALL PEASE at Microsoft Research in 1982:
Imagine that several divisions of the Byzantine army are camped outside an enemy city, each division commanded by its own general. The generals can communicate with one another only by messenger. After observing the enemy, they must decide upon a common plan of action. However, some of the generals may be traitors, trying to prevent the loyal generals from reaching an agreement. The generals must decide on when to attack the city, but they need a strong majority of their army to attack at the same time. The generals must have an algorithm to guarantee that (a) all loyal generals decide upon the same plan of action, and (b) a small number of traitors cannot cause the loyal generals to adopt a bad plan. The loyal generals will all do what the algorithm says they should, but the traitors may do anything they wish. The algorithm must guarantee condition (a) regardless of what the traitors do. The loyal generals should not only reach agreement, but should agree upon a reasonable plan.