Game Theory and Distributed Systems

By: Geeq

View the slides from Geeq Founder and Chief Economist John P. Conley’s talk “Game Theory for Distributed Systems”, which introduced Geeq’s Proof of Honesty (PoH) to a packed ballroom of attendees of the CryptoEconomics Security Conference held during San Francisco Blockchain Week, October 2019.

Or, if you like, watch the entire presentation 30 minute presentation HERE. John explains the combination of ideas from distributed systems, non-cooperative game theory, and mechanism design that led, eventually, to the development of Proof of Honesty.

John founded Geeq, in part, because he realized that when it comes to blockchain security, the protocols designed to provide the best security are the ones that assume the worst. Proof of Honesty is the result of asking the question: what if the 2/3 honesty assumption (frequently made to address the Byzantine Fault Tolerance dimension of security in distributed systems) is an unreasonable assumption for blockchains?

John is a systematic, rigorous, and determined guy. As he began to think about attack vectors for blockchains, he also began to combine his axiomatic training in game theory with his knowledge of mathematics, computer science, ICT (information and communications technology), and mechanism design. One way he describes Proof of honesty is that it “brings blockchain security to a new level because it implements a unique, coalition-proof equilibrium rather than allowing the network of validators to settle on some (potentially malicious) Nash equilibrium strategy”.

Another way to describe it is to use Geeq’s security comparison table below.

Security Characteristics of Geeq and Other Protocols

For explainers with a lighter touch, please follow GeeqOfficial on Medium. To head straight for the theory, please read Geeq’s Technical Paper.

Telegram ~ Join us for a chat ~ t.me/GeeqOfficial

Twitter ~ Keep up to date ~ https://twitter.com/GeeqOfficial

Medium ~ Grab a coffee ~ https://medium.com/GeeqOfficial