June 15, 2026
The Bernoulli Model
Random approximate computation in one model: the Bernoulli model, its preprints, the monograph that unifies them, and the prior work it builds on.
Bernoulli Model
Browse posts by tag
June 10, 2024
maph: Maps Based on Perfect Hashing for Sub-Microsecond Key-Value Storage
A key-value store built on memory-mapped I/O, approximate perfect hashing, and lock-free atomics. Sub-100ns median latency, 10M ops/sec single-threaded.
February 18, 2024
Entropy Maps
Entropy maps use prefix-free hash codes to approximate functions without storing the domain, achieving information-theoretic space bounds with controllable error.
February 1, 2024
Perfect Hashing: Space Bounds, Entropy, and Cryptographic Security
Space bounds, entropy requirements, and cryptographic security properties of perfect hash functions.
June 17, 2023
A Boolean Algebra Over Trapdoors
A Boolean algebra framework over trapdoors for cryptographic operations. Introduces a homomorphism from powerset Boolean algebra to n-bit strings via cryptographic hash functions, enabling secure computations with one-way properties.
June 17, 2023
Noisy Turing Machines: Noisy Logic Gates
Analyzing how Bernoulli Boolean types propagate through logic circuits, with correctness probabilities for noisy AND gates and interval arithmetic for composed circuits.
June 17, 2023
The Bernoulli Model: A Probabilistic Framework for Data Structures and Types
The Bernoulli Model is a framework for reasoning about probabilistic data structures by treating noisy outputs as Bernoulli-distributed approximations of latent values, from Booleans to set-indicator functions.
June 17, 2021
Rank-Ordered Encrypted Search
Rank-ordered search over encrypted documents using entropy maps built over trapdoors, enabling relevance scoring without revealing document contents.
March 15, 2015
Bloom Filters
Bloom filters trade perfect recall for extraordinary space efficiency. How they work and why they matter.