The Consequences of Scalable Blockchains

  1. Describe some thing a scalable blockchain could do.
  2. Prove that thing is NP-Complete.
  3. Show how, if you have such a blockchain, you can right now break hash functions and public-key cryptography and constructively prove P=NP.

The Thing

The Proof

An Example

There is no way to get anything into both c1 and c2. So we can never get two things into g.

The Implication

How to Break Hash Functions, RSA etc

What Does This Mean?

Minimal 3-variable non-satisfiable example. That’s why it’s at the end.




Prior blog:

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

What are the differences between Android and iOS?

Spark Architecture and Components

Elasticsearch and Lucene

Putting up a Rancher Kubernetes Cluster on Bare Metal

bare metal

Kubeflow and Local Deployment of Kubeflow

Simple Guide on IP Restrictions

Day 13- A code a day keeps Covid 19 away!

Metauce IDO Whitelist Campaign

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store


Prior blog:

More from Medium

Sharding Is Also NP-Complete

FELToken, Privacy-Preserving AI on Blockchain, Explained in Simple Way

FELToken explaned in simple way ilustration image of website

Equitable P&C process improvements

Your Next Teacher Will be a Machine: Why the Future of Education is Automation