blockchain-basics

name	blockchain-basics
description	Master blockchain fundamentals including consensus, cryptography, and distributed systems
sasmp_version	1.3.0
version	2.0.0
updated	2025-01
bonded_agent	01-blockchain-fundamentals
bond_type	PRIMARY_BOND
atomic	true
single_responsibility	blockchain_education
parameters	{"topic":{"type":"string","required":true,"enum":["consensus","cryptography","networks","transactions","blocks"]},"depth":{"type":"string","default":"intermediate","enum":["basic","intermediate","advanced","expert"]}}
retry_config	{"max_attempts":3,"backoff":"exponential","initial_delay_ms":1000}
logging	{"level":"info","include_timestamps":true,"track_usage":true}

Blockchain Basics Skill

Master blockchain fundamentals including consensus mechanisms, cryptographic primitives, and distributed systems architecture.

Quick Start

# Invoke this skill for blockchain fundamentals
Skill("blockchain-basics", topic="consensus", depth="intermediate")

Topics Covered

1. Consensus Mechanisms

Learn how distributed networks achieve agreement:

• Proof of Work: Mining, hashrate, difficulty adjustment
• Proof of Stake: Validators, slashing, finality
• Byzantine Fault Tolerance: Leader election, view changes

2. Cryptographic Foundations

Understand the security primitives:

• Hash Functions: SHA-256, Keccak-256, properties
• Digital Signatures: ECDSA, Ed25519, verification
• Merkle Trees: Proof construction, verification

3. Network Architecture

Explore distributed systems:

• P2P Networks: Gossip protocols, peer discovery
• Node Types: Full nodes, light clients, archives
• Block Propagation: Compact blocks, relay networks

4. Transaction Lifecycle

Follow data through the chain:

• Transaction Structure: Inputs, outputs, signatures
• Mempool: Fee markets, ordering, priority
• Confirmation: Finality, reorganization

Code Examples

Verify Merkle Proof

import hashlib

def verify_merkle_proof(leaf: bytes, proof: list, root: bytes) -> bool:
    """Verify a Merkle proof for inclusion"""
    current = leaf
    for sibling, is_left in proof:
        if is_left:
            current = hashlib.sha256(sibling + current).digest()
        :
            current = hashlib.sha256(current + sibling).digest()
     current == root