Proof of stake

Cryptography

Cryptocurrency

Bitcoin

Wallets

Consensus protocols

State Machine Replication (SMR)

Dynamic availability

Nakamoto consensus

Sybil resistance

Finality

Accountable safety

Ethereum

Decentralized Apps

Ethereum Virtual Machine (EVM)

Solidity

Stablecoins

Synthetics

Non-fungible token (NFT)

Decentralized Exchanges (DEX)

Automated Market Makers (AMM)

Constant Function Market Makers (CFMM)

DeFi Lending Systems

Decentralized Autonomous Organization (DAO)

Crypto Regulation and Policy

Privacy on the Blockchain

zk-SNARK

Payment Channels

State Channels

Recursive SNARKs

Rollups

Miner Extractable Value (MEV)

Blockchain interoperability (Bridging)

CS 251 Cryptocurrencies and Blockchain Technologies Stanford University Fall 2022 Stanford's course covers a wide spectrum of blockchain and cryptocurrency concepts, focusing on technical aspects and engineering secure software. Bitcoin and Ethereum are the main case studies, and the course delves into numerous applications, including DeFi, NFTs, and privacy on the blockchain. The course covers all aspects of blockchains and cryptocurrencies, including distributed consensus, smart contracts, economics, scalability, and applications. We will focus on Bitcoin and Ethereum as case studies. The potential applications for blockchains and cryptocurrencies are enormous. The course will cover the technical aspects of cryptocurrencies, blockchain technologies, and distributed consensus. Students will learn how these systems work and how to engineer secure software that interacts with a blockchain system like Bitcoin and Ethereum. This course is intended for advanced undergraduates and graduate students. The course assumes a familiarity with computer programming. CS107 (Computer Organization) or equivalent is required. CS111 (Principles of Computer Systems) or equivalent is strongly recommended. To the extent possible, the projects will be done in Python and Solidity. CS255 (Introduction to Cryptography) is helpful but not required; we will introduce concepts from cryptography as needed during class. We will list external reading sources on the [course syllabus page](https://cs251.stanford.edu/syllabus.html). These readings will often serve to expand on what we will discuss in class. They are not a replacement for the lectures. They are also not necessary to be read before coming to lecture, but pre-reading can help in following the lectures.

CS 251 Cryptocurrencies and Blockchain Technologies

Blockchain

Cryptographic primitives

P2P Network

Bitcoin system

Bitcoin safety

Bitcoin liveness

Scaling throughput

Scaling latency

Sharding

Side Blockchains

Streamlet and Hotstuff

Algorand

BFT protocols

Longest Chain Protocols

Bootstrapping blockchains

Zcash architecture

Privacy bridge

Fair transaction ordering

MEV and PBS architecture

Principles of Blockchains Princeton University Fall 2022 This course by Princeton University provides a full-stack design overview of blockchains, focusing on Bitcoin's design, scaling strategies, and additional considerations such as privacy and finality. It features a practical approach, with students implementing a Bitcoin client in Rust by the end of the course. Blockchains are decentralized digital trust engines and are a potential replacement to “digital platforms” that we encounter in today’s world. Digital platform companies occupy 7 of the largest companies in the world based on market capitalization (eg: Apple, Google, Microsoft, Amazon, Alibaba, Tencent). Blockchains came into prominence through Bitcoin, a cryptocurrency, introduced in 2009. In the decade since its inception, blockchain designs have evolved significantly, although the corresponding evolution of applications (beyond cryptocurrencies) have not caught up yet. In this course, we study a full-stack design of blockchains: we view the blockchains as a whole integrated system involving networking, incentives, consensus, application layer support. The course covers the foundations of blockchains, and is divided into 3 parts: in the first part we study the Bitcoin design in detail. Although very secure and remarkably incentive compatible in the real world, Bitcoin has very poor performance in many ways: throughput, latency, energy, compute, storage and communication. In the second part we study the various efforts to scale the performance of Bitcoin in all the different dimensions, while maintaining the incentive compatibility and security of Bitcoin. In the final part, we study aspects of blockchain design that were simply not considered in Bitcoin (e.g., privacy, finality). In the spirit of Nakamoto (who implemented and tested the Bitcoin client before writing the white paper), this course will be implementation-heavy. We will use the Rust programming language for our assignments and projects for the foundation component of the course. By the end of the course, you will implement a Bitcoin client in Rust.   The basic technical prerequisites are a background in probability and algorithms. Decent amount of software programming background is essential.  Supplemental reading:
- Bitcoin and Cryptocurrency Technologies, A. Narayanan, J. Bonneau, E. Felten, A. Miller and S. Goldfeder, Princeton University Press. Henceforth termed as PUP (Princeton university press).
- [Introduction to Cryptocurrencies](https://nakamoto.com/introduction-to-cryptocurrency/), a basic online course by Haseeb Qureshi.

Principles of Blockchains

Proof of stake

2 courses cover this concept

CS 251 Cryptocurrencies and Blockchain Technologies

Principles of Blockchains