Autonomi
LearnBuildWho we ArePublicationsGet ANTStart a Node
  • Learn
  • Node
  • ANT Token
  • Developers
  • Autonomi Docs
  • Introduction
    • What is Autonomi?
      • The Internet's Crowd Storage Layer
      • Everything's Encrypted
      • Lifetime Storage; One Time Fee
      • Built From Everyday Devices
      • Private by Design
      • Blockchainless Data
      • Secure & Efficient
    • Background
    • A Self-Organizing System
    • Fundamental Principles
    • Key Features
  • How It Works
    • Overview
    • Fully Autonomous Data Network
      • A Serverless Web
      • Nodes
      • Clients
    • Network Architecture
      • Building on Kademlia
      • libp2p
      • Content-Addressable Storage
    • Encryption and Authentication
      • Self-Encryption
      • Multilayered encryption
      • Self-Authentication
      • Multisig Credentials
    • Network Economics
      • Key Properties
      • Token Supply
      • Gas Fee
      • Quote Calculations
    • Consensus Not Required
      • Stigmergy
      • Conflict-free Replicated Data Types
    • Data types
      • Chunks
      • Registers
    • Defence Against Cyberattacks
      • Beating Common Threats
  • Learn More
    • Team
    • Autonomi Foundation
    • FAQs
    • Glossary
    • References
Powered by GitBook

Get Involved

  • Start a Node
  • Discord
  • Forum

Follow Us

  • X
  • Reddit
  • LinkedIn
On this page
  • A Hard Problem
  • Decentralized conflict resolution
Export as PDF
  1. How It Works

Consensus Not Required

PreviousQuote CalculationsNextStigmergy

Last updated 1 year ago

A Hard Problem

Truly decentralized networks can have no master node or oracle to judge what is true or valid and what is not. Instead, the nodes that make up the Network must come to an agreement among themselves about which of many possible versions of “the truth” they will accept and the order in which events occur. This is challenging because each node has a different view of events. They must find a way to converge.

Decentralized conflict resolution

The bitcoin blockchain uses Proof of Work (PoW) to solve these problems of achieving decentralized consensus over the ordering of events to prevent the problem of double-spend – being able to spend the same coin twice – and Byzantine behaviour. Miners battle to verify a block of transactions. If there are two simultaneous winners the chain will split and for a time there are two versions of the truth, i.e. two chains emanating from the disputed block. Ultimately, though, after a few blocks have been added one chain will be longer than the other, and it is this chain that will be accepted as the true state.

PoW has proved largely effective against the Sybil attack, also known as the 51-percent attack, where one entity owns more than half of the mining power, but it is slow, massively energy-intensive and it doesn’t scale. Also, the consensus is probabilistic rather than deterministic: after some time, you might be 99.9 percent sure that all nodes agree on network state, but never 100 percent.

Other blockchains such as ethereum use Proof of Stake (PoS). While much more environmentally friendly, there is a tradeoff in terms of equability in that larger holders of the currency have more power.

Autonomi is naturally secure, meaning that it doesn't need any artificial slowing down or behavioural assumptions to keep data safe. It does not use PoW or PoS for consensus.

Instead it uses a system similar to that utilized by ants, , plus a combination of lightweight mechanisms including and constant tests that nodes are reliable.

Stigmergy
Conflict-free Data Types (CRDTs)