Blockchain at a Glance

Section I: Introduction

Army Cyber Institute

April 9, 2026

The Big Picture

• Our Goal Today: Before we dive into the deep technical concepts of this course, we need to establish a high-level frame of reference.
• The Analogy: Think of this lesson like looking at a fully assembled car.
  • Before we take the engine apart to learn how the pistons work, it helps to see the whole vehicle drive down the road.
• Setting Expectations: We aren’t going to build the engine today. We just want to identify the major components, learn what they are called, and see how they fit together.

Overall Slide Concept This opening slide establishes the lesson’s purpose as a high-level orientation rather than a deep technical dive. It matters here because students need a conceptual frame for the whole blockchain stack before later lessons unpack each component in detail. Emphasize that today is about vocabulary, system shape, and relationships among parts.

Key Points - Use the car analogy to show that students are looking at an assembled system before studying its individual parts. - Set expectations that cryptographic math and protocol mechanics will come later in the course. - The immediate goal is to identify the major components and how they fit together.

Walkthrough None

Sources - [1]

What is a Blockchain?

• A Shared Reality: At its core, a blockchain is a system that allows multiple distributed participants to agree on a single, shared history of events without needing a central referee.
• An Append-Only Ledger: It is a database that can only be added to. You cannot edit or delete past entries.
• A State Machine: It moves from one agreed-upon “state” (e.g., Alice has 5 tokens) to the next (e.g., Alice has 2, Bob has 3) based on strict, universally enforced rules.

Permissionless vs. Permissioned Ledgers Public blockchains (like Bitcoin) assume participants are anonymous and untrusted. However, private/permissioned blockchains are used by known entities (like a consortium of banks) who share a ledger and want mathematical guarantees of accuracy.

Overall Slide Concept This slide establishes the course’s baseline definition of blockchain as shared state coordination without a central referee. It matters here because every later technical topic in the course supports this one core function: maintaining an agreed history among distributed participants. Emphasize that append-only behavior, state transitions, and distributed agreement are the important ideas to carry forward.

Key Points - A blockchain is fundamentally a way for distributed parties to agree on one shared record of events. - Append-only means past entries are added to, not silently edited or deleted. - A state machine is a system that moves from one valid state to the next according to rules; permissionless and permissioned describe who is allowed to participate.

Walkthrough None

Sources - [1] - [2]

The “Block” in Blockchain

• The Analogy: Think of a single block as a page in a ledger book or a shipping container.
• The Purpose: Instead of processing transactions one by one, the network bundles them together into a single, organized package.
• The Heartbeat: New blocks are sealed and added to the network at regular intervals.
• The Contents: At a high level, a block contains a batch of approved script operations (commonly referred to as “transactions”) and a mathematical link to the past.

Overall Slide Concept This slide establishes what a block contributes to the larger chain: batching activity into discrete, linked packages. It matters here because students must understand that blockchain time is organized into blocks before they can follow validation, consensus, and chaining. Emphasize that a block is not just storage; it is a structured checkpoint in the ledger’s ongoing history.

Key Points - A block is a batch of approved operations grouped together rather than processed one by one. - Each block carries a cryptographic link to the prior block, which is what makes the history chain together. - Heartbeat refers to the repeated cadence at which new blocks are proposed and added.

Walkthrough 1. Start at the leftmost block and identify it as one packaged set of transactions. 2. Move across the diagram to show that each new block includes the fingerprint of the one before it. 3. Conclude that changing an earlier block would break the later links in the chain.

Sources - [3] - [4]

The Three Pillars

A blockchain is not one single invention. It is the clever synthesis of three distinct technologies.

1. Cryptography: Secures the data and proves identity. (Encryption, Hashes, and Digital Signatures).
2. Peer-to-Peer (P2P) Networks: Distributes the data so everyone has a copy and there is no central server to attack.
3. Consensus Mechanisms: The rules by which the network agrees on what data is valid and what should be rejected.

Overall Slide Concept This slide establishes blockchain as a synthesis of three separate technologies rather than a single invention. It matters here because the rest of the module and the next course sections are organized around these pillars. Emphasize that cryptography, peer-to-peer networking, and consensus each solve a different part of the coordination problem.

Key Points - Cryptography secures data and authorization, peer-to-peer networking distributes information, and consensus determines what becomes official history. - The course is structured to study each pillar separately after this overview. - Synthesis means blockchain works because these technologies are combined, not because any one of them is new by itself.

Walkthrough None

Sources - [1] - [2]

Pillar 1: Cryptography

• Encryption (Symmetric & Asymmetric): The math used to scramble data for confidentiality. While blockchains generally do not encrypt the ledger itself, these concepts are the fundamental building blocks for digital signatures and advanced privacy features.
• Digital Signatures (Public/Private Keys): A way to mathematically prove that you authorized an action without revealing your secret password.
• Cryptographic Hashes: Think of this as a digital fingerprint. Any piece of data can be crushed down into a unique string of letters and numbers. If the data changes even slightly, the fingerprint changes completely.
• The Role: Cryptography doesn’t hide the data (most blockchains are entirely public). Instead, it makes the data tamper-evident and unforgeable.

Overall Slide Concept This slide establishes what cryptography contributes to blockchain: integrity, authorization, and tamper evidence rather than secrecy by default. It matters here because students often wrongly assume blockchain is mainly about encrypted hidden data. Emphasize that most public blockchains are transparent, but cryptography still makes unauthorized changes and forgeries visible and difficult.

Key Points - Digital signatures use public and private keys to prove authorization without exposing the secret key. - Cryptographic hashes act like fingerprints: small input changes produce radically different outputs. - Tamper-evident means unauthorized changes can be detected; asymmetric means one key signs while another verifies.

Walkthrough None

Sources - [1] - [4] - [5]

Pillar 2: Peer-to-Peer Networks

• No Central Server: There is no “blockchain.com” server running the network.
• Nodes: Thousands of individual computers (nodes) run the blockchain software.
• Gossip Protocol: When one node hears about a new transaction, it shouts it to its neighbors, who shout it to their neighbors, until the whole world knows.

Overall Slide Concept This slide establishes how blockchain networks move information without relying on a central server. It matters here because later transaction lifecycle slides assume students understand that many independent nodes receive and relay the same data. Emphasize that peer-to-peer design removes the single point of failure but introduces coordination and propagation challenges.

Key Points - Nodes are individual computers running the protocol and holding or relaying network data. - A gossip protocol spreads information by having each node forward valid messages to peers. - Peer-to-peer, or P2P, means there is no single authoritative server in the middle of every exchange.

Walkthrough 1. Point to one node learning about a transaction first. 2. Show that it forwards the message to neighboring nodes. 3. Explain that repeated forwarding propagates the same information across the global network.

Sources - [3] - [4]

Pillar 3: Consensus

• The Problem of Errors and Conflicts: In a P2P network, some participants will broadcast invalid or conflicting information (e.g., spending money they don’t have).
• The Mechanism: Consensus is the algorithmic process the nodes use to agree on what is valid and reject incorrect state changes.
• Examples: Proof of Work (Miners) or Proof of Stake (Validators).
• The Result: The network achieves the same synchronized state, defeating the problem of untrusted participants.

Overall Slide Concept This slide establishes consensus as the rule system that resolves conflicts and prevents invalid state changes from becoming official. It matters here because students have now seen how data is signed and spread, but still need to know how the network decides which version of events counts. Emphasize that consensus is the referee built into the protocol rather than a human authority.

Key Points - Consensus decides what counts as valid when participants disagree or try to submit conflicting information. - Proof of Work and Proof of Stake are examples of different ways to enforce those rules. - Validators and miners are participants responsible for helping produce or confirm the next accepted block.

Walkthrough None

Sources - [2] - [3]

Putting it Together: The Lifecycle of a Transaction

• To see how these three pillars interact, we will trace a single transaction from start to finish.
• The Scenario: Alice wants to send Bob a digital asset over a blockchain network.

1

Sign

2

Broadcast

…

Mempool

6

Chain

Overall Slide Concept This slide establishes the transaction lifecycle as the story that ties the three pillars together. It matters here because the following slides are easiest to understand as one continuous process rather than six unrelated technical steps. Emphasize that students should track how cryptography, networking, and consensus each appear in sequence.

Key Points - The transaction story shows how a user action becomes accepted shared state on the network. - Alice and Bob are placeholders used to make the process concrete. - The numbered flow is a preview of the six-step sequence students are about to walk through.

Walkthrough None

Sources - [4] - [6]

Step 1: Creation and Signing

• Intent: Alice opens her wallet software and creates a message: “Send 5 coins from Alice to Bob.”
• Signing (Cryptography): Alice uses her Private Key to mathematically sign this message.
• Security: This signature proves Alice authorized it, and ensures no one can change the “5” to a “50” while the message is in transit.

🔏 Alice’s Private Key Applied

Overall Slide Concept This slide establishes that every blockchain transaction begins as an authorized message created by a user. It matters here because the chain cannot reason about intent unless that intent is expressed and signed in a verifiable way first. Emphasize that signing proves authorization and protects the transaction from undetected modification in transit.

Key Points - Alice creates a transaction message and signs it with her private key before it enters the network. - A digital signature proves authorization and helps detect tampering. - Private key means the secret credential used to authorize actions; wallet software is the tool that manages this process for the user.

Walkthrough 1. Alice creates a message stating the intended transfer. 2. Her wallet applies the private key to sign that message. 3. The signed transaction becomes a portable proof that can be verified by the network.

Sources - [4] - [6]

Step 2: The Broadcast

• Transmission: Alice’s wallet sends this signed message to a single node on the network.
• The Gossip (P2P Network): That node checks the math. If it’s valid, it passes it to its peers. Within moments, the transaction has spread across the network into other nodes’ “waiting rooms.”

Overall Slide Concept This slide establishes how a locally created transaction becomes network-visible through peer-to-peer propagation. It matters here because students need to see that no single node keeps the transaction private or authoritative once broadcast begins. Emphasize that validation starts immediately and that the network learns about new activity by relaying it outward.

Key Points - Alice’s wallet sends the signed transaction to one node, which checks basic validity before forwarding it. - Broadcast means distributing the transaction outward across many peers. - The network’s copy of the transaction spreads quickly through repeated peer relay rather than through a central dispatcher.

Walkthrough 1. The wallet sends the signed transaction to an initial node. 2. That node checks the message and forwards it if it passes basic validation. 3. Neighboring nodes repeat the process until the transaction is widely known.

Sources - [4] - [3]

Step 3: The Mempool

• Pending State: Transactions don’t happen instantly. They sit in a holding area called the Memory Pool (Mempool).
• Unconfirmed: At this stage, the network knows about Alice’s intent, but it is not yet officially part of the blockchain’s history. It is “unconfirmed.”

Tx: Alice->Bob

Tx: Charlie->Dave

Tx: Eve->Alice

Tx: Bob->Frank

Overall Slide Concept This slide establishes the mempool as the waiting area between transaction propagation and final inclusion in a block. It matters here because students often imagine transactions as instantaneous, when in fact they usually spend time in a pending queue first. Emphasize that awareness by the network is not the same thing as confirmed inclusion in the ledger.

Key Points - The mempool, or memory pool, holds valid but unconfirmed transactions waiting for selection. - Unconfirmed means the network has seen the transaction, but it is not yet part of accepted history. - Pending state is operationally important because later consensus and inclusion decisions happen from this queue.

Walkthrough None

Sources - [4]

Step 4: Block Assembly

• The Miner/Validator: Special nodes on the network pull pending transactions out of the mempool.
• Packing the Box: They verify that Alice actually has the 5 coins to spend, and then pack her transaction into a “Block” alongside hundreds of others.
• The Competition: Multiple nodes are trying to pack blocks at the same time. Who gets to add theirs to the official chain?

Alice

Overall Slide Concept This slide establishes the moment when specialized participants select transactions from the mempool and package them into candidate blocks. It matters here because students now need to see how pending transactions move toward formal inclusion. Emphasize that miners or validators both verify and assemble, but they may compete to have their block accepted.

Key Points - Miners or validators pull transactions from the mempool and verify them before inclusion. - Block assembly is the packaging stage where many pending transactions become one candidate block. - The network may have multiple competing candidate blocks at once, which is why consensus is needed next.

Walkthrough 1. A miner or validator selects pending transactions from the mempool. 2. It verifies that those transactions satisfy protocol rules, such as available funds or valid signatures. 3. It packs them together into a candidate block for the network to evaluate.

Sources - [4] - [6]

Step 5: Achieving Consensus

• The Rules: The network uses its Consensus Mechanism (e.g., Proof of Work) to select one node’s block to be the official next block.
• Winning the Right: A node proves it followed the rules (expended energy, staked assets) and broadcasts its newly minted block to the network.

Node A (Hashing…)

Node B (Hashing…)

WINNER! Block Mined

Node C (Hashing…)

Overall Slide Concept This slide establishes how the network chooses one proposed block to become the next official block in the chain. It matters here because students have now seen many candidate blocks could exist at once, and consensus is what turns competition into one accepted outcome. Emphasize that the mechanism differs across systems, but the goal is the same: one agreed next state.

Key Points - Consensus selects one block proposal as the accepted next block according to protocol rules. - Proof of Work and Proof of Stake are different ways to prove eligibility to add the next block. - Validators stake assets while miners expend computational work; both are examples of rule-following proofs rather than human approval.

Walkthrough 1. Multiple participants propose or compete to publish a valid next block. 2. The protocol applies its consensus rules to determine which proposal is accepted. 3. The accepted block is broadcast as the next official addition to the shared ledger.

Sources - [3] - [2]

Step 6: Chaining the Block

• The Hash Link: This is where the “chain” in blockchain comes in. The new block contains the “fingerprint” (cryptographic hash) of the previous block.

• Immutability: Because Block 102 contains the fingerprint of Block 101, you cannot change a transaction in Block 101 without breaking Block 102, Block 103, and so on.

• Alice’s Transaction is Finalized: Alice’s transaction is now a part of that shared chain, recorded for all to see.

Overall Slide Concept This slide establishes why accepted blocks become difficult to alter after the fact. It matters here because students need to connect the idea of chaining with the stronger claim of immutability. Emphasize that the new block’s hash link to prior blocks makes retrospective tampering visible and costly.

Key Points - Each block includes the hash, or fingerprint, of the previous block. - Changing an earlier block would cascade forward and break the later links. - Immutability here means practical resistance to unnoticed revision, not magical impossibility.

Walkthrough 1. Identify the previous block’s hash as data embedded in the new block. 2. Explain that changing the earlier block changes its fingerprint. 3. Show that the later blocks would no longer match unless the chain were recomputed under the protocol’s rules.

Sources - [3] - [4]

The Result: A Shared Truth

• Every honest node on the network updates their local copy of the ledger.
• Alice’s balance decreases by 5; Bob’s balance increases by 5.
• No central bank processed it. No administrator approved it.
• Cryptography, P2P networking, and consensus rules orchestrated a secure state change in a mutually suspicious environment.

Node A Ledger

Alice	-5
Bob	+5

Node B Ledger

Alice	-5
Bob	+5

Node C Ledger

Alice	-5
Bob	+5

Overall Slide Concept This slide establishes the outcome the whole system is trying to achieve: many independent nodes converging on the same updated state. It matters here because the transaction story only makes sense if every honest participant ends up recognizing the same result. Emphasize that the shared truth comes from coordinated protocol behavior, not from a central administrator.

Key Points - Honest nodes update their local ledgers to reflect the same accepted state change. - The final result is synchronized state across the network rather than a private update on one server. - This is the payoff of combining cryptography, peer-to-peer networking, and consensus in one system.

Walkthrough None

Sources - [1] - [2] - [7]

The Spectrum of Decentralization

• Not all blockchains are designed like Bitcoin. They exist on a spectrum based on who can participate.
• Permissionless (Public):
  • Anyone can read, write, or participate in consensus.
  • High censorship resistance, lower performance.
  • Examples: Bitcoin, Ethereum.
• Permissioned (Private/Consortium):
  • Only authorized entities can read, write, or validate.
  • Higher performance, better privacy, but requires trusting the gatekeepers.
  • Examples: Hyperledger Fabric, Corda.

Overall Slide Concept This slide establishes that blockchain design is not binary but exists along a participation spectrum. It matters here because students should not leave the lesson thinking every blockchain works like Bitcoin. Emphasize that permission rules shape performance, privacy, censorship resistance, and institutional trust.

Key Points - Permissionless systems allow broad participation, while permissioned systems restrict participation to approved entities. - Censorship resistance is the ability to make it hard for gatekeepers to block valid transactions. - Hyperledger Fabric and Corda are permissioned examples; Bitcoin and Ethereum are permissionless examples.

Walkthrough None

Sources - [1] - [4]

Common Misconceptions: What a Blockchain is NOT

• It is NOT a cloud storage drive:
  • You do not store PDFs or large files on a blockchain. Space is incredibly expensive. It stores state and receipts, not massive data.
• It is NOT inherently anonymous:
  • Most public blockchains are pseudonymous. Your name isn’t on it, but your entire financial history is permanently public. If your address is ever linked to your identity, you have zero privacy.
• It is NOT an impenetrable fortress:
  • While the cryptography is extremely strong, the endpoints (wallets, exchanges, smart contracts) are highly vulnerable to hacking and human error.

Overall Slide Concept This slide establishes guardrails against the most common beginner misconceptions about blockchain systems. It matters here because students need to leave the lesson with a more accurate mental model before the course adds more detail. Emphasize that real vulnerabilities often live in endpoints, metadata, privacy assumptions, and surrounding infrastructure rather than in the core hash function itself.

Key Points - Blockchains typically store state and receipts, not large files like a cloud drive. - Public blockchains are usually pseudonymous rather than truly anonymous; pseudonymous means addresses are visible even if names are not. - Attackers often target wallets, exchanges, and smart contracts rather than breaking the underlying cryptography.

Walkthrough None

Sources - [1]

Looking Ahead: Next Steps

• You have now seen the assembled vehicle and watched it drive from Point A to Point B.
• Historical Context: Before we dismantle the engine, the rest of this Introduction module will explore the history of how and why this technology was built.
• The Primitives: After the introduction, we will take the car into the garage to dismantle the engine. We will dive deep into:
  • Cryptographic Primitives: The math that makes hashes and signatures unforgeable.
  • Distributed Systems in Practice: How P2P networks actually route data.
  • Consensus Deep-Dive: How algorithms like Proof of Work and Proof of Stake enforce the rules against adversaries.

Overall Slide Concept This slide establishes the bridge from this conceptual overview into the rest of the introduction and the technical modules that follow. It matters here because students should understand that the current lesson is a frame of reference, not the end of the explanation. Emphasize that future lessons will unpack the historical context and then dissect each pillar in depth.

Key Points - This lesson is the assembled-system view that prepares students for deeper historical and technical study. - The next lessons move from conceptual overview into history and then into the primitives one by one. - Consensus, cryptography, and distributed systems will each be revisited at much greater depth later in the course.

Walkthrough None

Sources - [6]

Bitcoin Video (Optional)

Overall Slide Concept This slide establishes an optional supplemental resource for students who want another introductory explanation of Bitcoin. It matters here because some learners benefit from a second presentation of the ideas before the course moves forward. Emphasize that the video is optional and should reinforce, not replace, the lesson’s core concepts.

Key Points - The video is an optional reinforcement resource tied to the foundational material of the course. - Encourage students to use it for review if they want a different explanation style. - Keep expectations clear that optional media supplements the course but does not define it.

Walkthrough None

Sources None

References

[1]

A. Narayanan, J. Bonneau, E. Felten, A. Miller, and S. Goldfeder, Bitcoin and Cryptocurrency Technologies. Princeton University Press, 2016.

[2]

S. Bano et al., “Consensus in the Age of Blockchains.” 2017. Available: https://arxiv.org/abs/1711.03936

[3]

S. Nakamoto, “Bitcoin: A Peer-to-Peer Electronic Cash System.” Satoshi Nakamoto Institute, Oct. 31, 2008. Accessed: Sep. 12, 2025. [Online]. Available: https://cdn.nakamotoinstitute.org/docs/bitcoin.pdf

[4]

A. M. Antonopoulos, Mastering Bitcoin: Programming the open blockchain, Second edition. Sebastopol, CA: O’Reilly, 2017.

[5]

R3, “Corda enterprise 4.12.” Accessed: Mar. 28, 2026. [Online]. Available: https://docs.r3.com/en/platform/corda/4.12/enterprise.html

[6]

3Blue1Brown, Dir., But how does bitcoin actually work?, (Jul. 07, 2017). Accessed: Oct. 21, 2025. [Online Video]. Available: https://www.youtube.com/watch?v=bBC-nXj3Ng4&t=4s

[7]

E. Androulaki et al., “Hyperledger fabric: A distributed operating system for permissioned blockchains,” in Proceedings of the Thirteenth EuroSys Conference, Porto Portugal: ACM, Apr. 2018, pp. 1–15. doi: 10.1145/3190508.3190538.