Lossy CSS Compression for Fun and Loss (or profit)
summary
Takes CSS, builds a binary selector×declaration matrix (1 when a selector uses a declaration), then performs Boolean matrix decomposition to approximate that matrix with two smaller binary matrices; those factor matrices map back to new CSS rules. Uses a CSS parser called CSS part, a library Matrix LJ, and C++ glue from Baron and from I BM. Proof‑of‑concept compresses the Heart of Clojure homepage (about 100 rules) into fewer, progressively coarser rules and visually similar output.
AI-written summary · about
