PinnedInITNEXTbyHéla Ben Khalfallah·May 17Beyond the Heap: Memory as a Computation GraphHow tensor compilers turn program regions into graphs, schedules, buffers, and executable workA response icon1A response icon1
PinnedInITNEXTbyHéla Ben Khalfallah·May 5Four Ways the Browser Renders Graphics, Four CostsDOM, SVG, Canvas, and the GPU. Same pixels, very different machinery.A response icon3A response icon3
PinnedInITNEXTbyHéla Ben Khalfallah·Apr 21Can Math.random() Be Random in a Deterministic Machine?Xorshift128+, a 64-value pool, and the CVSS 9.4 CVE that proved how thin the illusion really isA response icon5A response icon5
PinnedInITNEXTbyHéla Ben Khalfallah·Mar 30Engine Inside Engine: How JavaScript Really Executes Regular ExpressionsNFA theory, V8 Irregexp internals, and what makes regex fast or fatalA response icon2A response icon2
PinnedInITNEXTbyHéla Ben Khalfallah·Dec 9, 2025Rewiring Everything: Graph Theory as the Template for Universe, Biology, and MindThis is the story of how the universe evolves through connection and continual rewiring, from cosmic expansion to neural learningA response icon1A response icon1
InITNEXTbyHéla Ben Khalfallah·May 27Can JavaScript Become a Planned Runtime?A study of AOT compilation, computation graphs, memory planning, and concurrency schedulingA response icon4A response icon4
InITNEXTbyHéla Ben Khalfallah·Mar 26The Hash Function Field Guide Part 3: Data StructuresProbabilistic data structures: Bloom filters, Count-Min Sketch, HyperLogLog, and the Kirsch-Mitzenmacher optimization
InITNEXTbyHéla Ben Khalfallah·Mar 26The Hash Function Field Guide Part 2: AlgorithmsFrom classic algorithms to modern designs: seven hash functions traced at the bit level
InITNEXTbyHéla Ben Khalfallah·Mar 24The Hash Function Field Guide Part 1: FoundationsProperties, trade-offs, and the bit-mixing toolkit
InITNEXTbyHéla Ben Khalfallah·Dec 17, 2025From Static Relations to Dynamic Co-Activation: Hypergraphs as Event Models (3/3)Modeling Runtime Co-Activation and Higher-Order Structure in Software
