Hello,

We noticed you're browsing in private or incognito mode.

To continue reading this article, please exit incognito mode or log in.

Not a subscriber? Subscribe now for unlimited access to online articles.

Connectivity

How to fix one of Bitcoin’s biggest problems

MIT professor Silvio Micali says his new system allows blockchains to operate efficiently at a large scale.

Bitcoin and similar blockchain systems have a problem, and renowned MIT cryptographer Silvio Micali says he has a solution. 

To make blockchains scale, says Micali, the networks will need to adopt a new approach to establishing agreement that the information in the ledger is true. Agreements in current blockchains like Bitcoin and Ethereum require a resource-intensive process called proof of work, by which computers on the network, called “miners,” prove that they are not malicious actors trying to corrupt the ledger (see “What is a blockchain?”). Miners must spend lots of energy to win a chance to add new entries, or blocks, to the chain, earning cryptocurrency as a reward. Though an effective way for a network to come to agreement that the information in the ledger is valid, this consumes large amounts of energy and is relatively slow.

Micali—who won the Turing Award in 2012 for his pioneering work in cryptography, including a number of techniques that are used to secure blockchain systems—shared his vision for a new system, called Algorand, on stage at MIT Technology Review’s Business of Blockchain conference. The system uses a novel approach called proof of stake, in which responsibility for validating new transactions is allocated to users according to how much money they have in the system. 

Algorand doesn’t use miners, and the computation required to secure the ledger is “trivial,” which makes the system very fast, says Micali. It uses complicated math (sort of like “magic,” he says) to first select a random user to propose, digitally sign, and add new blocks to the chain. The algorithm then randomly selects 1,000 more users, who check that block and sign it. In each phase, the public keys—the strings of characters that represent these users on the blockchain—are revealed to the rest of the network. The probability that a user will be selected is proportional to the amount of money that user has in the system. 

Micali’s approach can also be used to propose and vote on protocol changes, he says, which means that this system will never “fork,” or split, the way the Bitcoin network did recently when the community could not agree on whether to change the protocol to increase its transaction volume. So-called “flexible self-governance” is very important, says Micali, because the community should be able to vote on things like changes to monetary policy. “This splitting of the community is not something that can scale,” he says.

Proof-of-stake systems are still nascent in their development and could create potential unintended consequences, such as centralization or inequality.

Keep up with the latest in Bitcoin at Business of Blockchain 2019.

May 2, 2019
Cambridge, MA

Register now
More from Connectivity

What it means to be constantly connected with each other and vast sources of information.

Want more award-winning journalism? Subscribe to Print + All Access Digital.
  • Print + All Access Digital {! insider.prices.print_digital !}*

    {! insider.display.menuOptionsLabel !}

    The best of MIT Technology Review in print and online, plus unlimited access to our online archive, an ad-free web experience, discounts to MIT Technology Review events, and The Download delivered to your email in-box each weekday.

    See details+

    12-month subscription

    Unlimited access to all our daily online news and feature stories

    6 bi-monthly issues of print + digital magazine

    10% discount to MIT Technology Review events

    Access to entire PDF magazine archive dating back to 1899

    Ad-free website experience

    The Download: newsletter delivered daily

/3
You've read of three free articles this month. for unlimited online access. You've read of three free articles this month. for unlimited online access. This is your last free article this month. for unlimited online access. You've read all your free articles this month. for unlimited online access. You've read of three free articles this month. for more, or for unlimited online access. for two more free articles, or for unlimited online access.