THE ARCADE
ArcadePathsBuildPrep
  1. Home
  2. /Hashing
Cryptography

Hashing

Integrity, not secrecy.

← Back to all areas
  • 01·150 XP
    What Is a Hash?
    One-way, deterministic, avalanche.
    •
  • 02·150 XP
    Collision Resistance
    The birthday paradox, and why N bits only buys N/2 security.
    •
  • 03·150 XP
    The SHA Family
    SHA-1 (broken), SHA-2, SHA-3.
    •
  • 04·150 XP
    HMAC
    Integrity + authenticity with a shared key.
    •
  • 05·200 XP
    Merkle Trees
    Prove one leaf in O(log N) without shipping the whole set.
    •
  • 06·200 XP
    BLAKE2 & BLAKE3
    Why modern hashes are faster than SHA-256 — and just as safe.
    •
  • 07·200 XP
    Content Addressing
    Git, IPFS, and the 'address by content not name' mental model.
    •
  • 08·220 XP
    Sponge Construction (SHA-3)
    Absorb, squeeze, and why SHA-3 doesn't have SHA-2's length-extension flaw.
    •
  • 09·200 XP
    Bloom Filters
    Probabilistic membership — tunable false positives, never false negatives.
    •
arcade.