Randomness

• Kolmogorov Complexity and Algorithmic Information Theory: The Deepest Measure of Information · 2025-07-30

  Dive into algorithmic information theory: Kolmogorov complexity as the ultimate measure of information content, its relationship to randomness (Martin-Löf tests), the incompressibility method for proving lower bounds, and the philosophical implications for science and mathematics.

• Verifiable Delay Functions: Wesolowski, Pietrzak, and the Sequentiality Assumption · 2023-01-21

  An exploration of VDFs from their cryptographic foundations through practical constructions, with emphasis on randomness beacons, blockchain consensus, and the sequential computation lower bounds.