An article examining the mathematical equivalence between compression and prediction in information theory. The author argues that while the correspondence is valid, compression involves decisions about object representation, probability models, and decoder capabilities that exist outside the prediction-compression equivalence.
A web page demonstrates browser fingerprinting techniques by collecting data about visitors' browsers, screens, storage, devices, and performance characteristics. The page analyzes 48 fields across 55 checks to generate identifying signals, explaining which data points are most and least identifying using entropy measurements from prior research of 118,934 browsers.
A method for detecting secrets in code using Byte-Pair Encoding (BPE) tokenization as a more effective alternative to entropy-based filtering. BPE measures how rare or non-natural a string is by tokenizing it—common words become single tokens while random strings fragment into many small tokens, better identifying actual secrets than traditional randomness metrics.
Spanda is a Rust-based tool that detects LLM hallucinations and quantifies epistemic uncertainty in sub-microsecond time without requiring expensive neural cross-encoders. It uses Exact-Match Normalized Entropy to match or exceed traditional Semantic Entropy methods while operating ~90,000× faster, making it practical for high-throughput production serving.