Polkadot

• Polkadot: Overview
• NPoS
  • Intro to Nominated Proof-of-Stake
    • Validators and nominators
    • The NPoS scheme
    • The election process
  • 1. Overview of results for the NPoS election problem
    • Problem statement and notation
    • Operational concerns
      • Efficient algorithms
      • Who elects the committee?
      • Committee-finding algorithm (off-chain)
      • Committee-comparing algorithm (on-chain)
    • Objectives
      • Balance
      • Support
      • Fair representation
    • Overview of our results
      • Committee finding
      • Committee-comparing
  • 2. The min-norm max-flow problem
    • 1. Notation
    • 2. The min-norm max-flow problem (MNMF)
    • 3. Overview of algorithms for MNMF
    • 4. Technique using parametric flow algorithms
    • 5. The star balancing heuristic
  • 3. The maximin support problem
    • 1. Definitions and notation
    • 2. The algorithm
      • Analysis of approximation factor
      • Analysis of running time
    • 3. Properties of the maximin support objective
  • 4. Sequential Phragmén’s method.
    • 1. Notation
    • 2. Algorithm
    • 3. Axiomatic properties
  • 5. A Phragmén-like Heuristic
    • Notation
    • The basic heuristic
    • (Parameterised) Proportional Justified Representation.
    • Local Search for provable PJR
    • Factor 3.15 approximation algorithm
      • Analysis
• BABE
  • SASSY/BADASS BABE
    • Layman overview
    • Plan
    • Parameters
    • Keys
    • Phases
      • 1) Setup
      • 2) VRF generation Phase
        • Randomness
        • VRF production
      • 3) Publishing Phase
      • 4) Verification
      • 5) Sorting
      • 6) Claiming the slots
    • Probabilities and parameters.
  • BABE
    • 1. Overview
    • 2. BABE
      • BABE with GRANDPA Validators \(\approx\) Ouroboros Praos
        • 1. Genesis Phase
        • 2. Normal Phase
        • 3. Epoch Update
    • 3. Best Chain Selection
    • 4. Clock Adjustment (Relative Time Algorithm)
      • Temporarily Clock Adjustment
    • 5. Security Analysis
      • Definitions
      • Security Proof of BABE
        • Overall Results:
    • 6. Practical Results
      • BABE with the NTP
      • BABE with the Median Algorithm
    • References
• GRANDPA
  • GRANDPA Abstract paper
  • GRANDPA Full paper
• Availability and Validity
• XCMP - Relay chain light client design
  • Motivation
  • Problem
  • Goals
  • Assumptions
  • Solution Overview
    • Data Structure: Merkle Tree and Bitfield
    • Implementation details about Relay-chain egress data
    • Which Data is Stored Where?
    • Producing a PoV block
    • Validating a PoV block
    • SPREE integration
    • How much data is this?
• Token Economics
  • Introduction
  • Organization
  • NPoS payments and inflation
    • Inflation model
    • Payment details
    • Distribution of payment within a validator slot
  • Relay-chain transaction fees and per-block transaction limits
    • Limits on resource usage
    • Setting transaction fees
    • Adjustment of fees over time
      • 1. Fast adjusting mechanism
      • 2. Slow adjusting mechanism
  • Treasury
• Keys
  • Polkadot’s cryptography
    • Account keys
    • Session keys
    • old
  • Account signatures and keys
    • Ristretto
    • Additional signature types
  • Account signatures and keys in Polkadot
    • Schnorr signatures
    • Curves
      • How much secp256k1 support?
      • Is secp256k1 risky?
      • Is Ed25519 risky? Aka use Ristretto
      • Zero-knowledge proofs in the dalek ecosystem
  • Nomination
    • Stash account keys
    • Stake controller account keys
    • Certificate location
    • Certificate size
    • Implementation
  • Session keys
  • Transport layer authentication - libp2p’s SECIO
  • Account key creation ideas for Polkadot
• Networking
  • Networking for Polkadot
    • Overview
    • Message types
    • Message keys and sizes
    • Peer Discovery
    • Bounded Gossip Protocols
    • Main subprotocols
  • Parachain networking
  • Block production broadcast
    • Attestation Gossip: gossiping parachain blocks
    • Direct Routing: sending/ receiving erasure coded pieces
  • Availability and Validity (A&V) networking
    • TODO
    • Background
      • High-level requirements
      • Timing model
    • Design considerations
      • General aims
      • Special considerations
    • Protocol overview
    • Protocol phase 1: initial distribution
    • Protocol phase 2: approval checking
    • Design explanation
    • Analysis of bandwidth usage
    • Implementation notes
      • Possible layers
      • Erasure coding
    • Extensions
      • Sentry node proxies
        • Proxy protocol
  • XCMP
    • Inter-chain Message Passing: Egress Queue Data Fetching
    • Simple Gossip for ICMP queue routing: Topics based on relay-chain block where messages are issued
    • XCMP Routing Overview
    • Future Improvements (roughly, from sooner to later)
  • Consensus broadcast
    • Expiration
    • Validation
    • Requirements
    • Dealing with DoS
  • Authentication
    • General
      • Proposal: fresh authentication signals
      • Proposal: bandwidth resource allocation
    • As applied to Polkadot
      • Unauthenticated operation
      • Authenticated roles
  • Discovery
    • Overview
    • Kademlia topics
      • Multipath routing
      • Routing table drop policy
      • Routing table authentication
        • Proposal: authenticated stratified k-buckets
    • Implementation topics
      • Real-world network addresses
        • Proposal: multiple addresses
      • Using stream-based sockets
        • Proposal: multiple addresses, with QUIC
• Slashing
  • Slashing mechanisms
    • General principles
    • Network Protocol
      • Unresponsiveness
    • Grandpa
      • Unjustified vote
      • Rejecting set of votes
      • Equivocation / concurrent cases of unjustified vote
      • Invalid vote
    • Babe
      • Babe Equivocation
      • Invalid Block
    • Parachain validity-availability protocol
      • Invalid validity statement
  • Slashing across eras with NPoS
    • Reduced rewards
    • Slashing within one era
    • Slashing in past eras
    • Slashing spans
    • Actions
    • Accounting
    • Monotonicity
    • Suppressed nominators in Phragmen
    • Rewards for slashable offense reports
      • Rewards based on slashing nominators
      • Rewards based on slashing only validators
• Parachain Allocation
  • Introduction
  • Auctioning Parachain Slots
  • Analysis
    • Fairness
    • Bidding Strategy for Smart Contracts
    • Chance of Winning
    • Utility for any winning bidder
• State Transition Properties
  • 1 Utility
  • 2 Validity
  • 3 Finality
  • 4 Availability
  • 5 Messaging reliability
  • 6 Size
    • Light client
  • 7 Bandwidth
• Polkadot Runtime Environment Specification