This explainer introduces zero-knowledge proofs as a cryptographic domain that enables proving knowledge of data without fully revealing it, using the analogy of a dimmer switch to illustrate how ZK protocols control information visibility. The piece demonstrates the concept through the Alice-and-Bob probability example, showing how repeated correct guesses establish proof of knowledge while keeping the underlying information hidden from the verifier.
This paper explains cryptographic hashing as a fundamental building block of digital infrastructure, defining hash functions as one-way operations that deterministically map arbitrary-sized inputs to fixed-sized outputs while revealing no information about the input. The authors emphasize key properties including collision resistance and the practical irreversibility of hashing, distinguishing it from encryption.
Mario Havel, Tim Beiko
This paper explains how hashes and hash-based data structures, particularly hash tables and Merkle trees, enable efficient data integrity verification and lookup in large-scale information systems. The authors build on foundational cryptographic concepts to demonstrate how these structures form the basis for secure data proofs in modern digital infrastructure.
Mario Havel, Tim Beiko
This paper examines addressing schemes in computing systems, from physical memory addresses to hierarchical file organization and internet URLs, establishing how different protocols and structures require distinct addressing mechanisms to navigate data storage and retrieval. The authors argue that computers must support multiple addressing paradigms that work seamlessly together, drawing analogies between digital addressing and physical-world location systems.
Tim Beiko, Mario Havel