SciPy Proceedings
article
Jul 13, 2026
Hash all the things: Caching for fast notebook restarts
A content-addressed cache for cells in a reactive Python notebook. Hash recurrence over a dataflow DAG with parent-hash substitution at unhashable boundaries; lazy stub loading for typed blobs; and an empirical characterization of where caching wins and where it loses (cheap-body cells with large refs).
Dylan Madisetti, Myles Scolnick, Akshay Agrawal
doi
none
For Editors
submission
Build Status
COMPLETED
Submission Status
DRAFT
Timestamp
Aug 13, 2026 17:28:40
Submission
scipy-2026-marimo_caching
Source
command line
github.com/scipy-conference/scipy_proceedings
HEAD
53d7939
papers/marimo_caching
Storage
019ffc2b-30b7-71e2-9eb5-ce48cb9e7e99
https://tmp.curvenote.com/
temporary CDN, 30-day retention policy
Checks

56 checks passed

16 checks failed (3 required)

Links Resolve
Check that "https://dmadisetti.github.io/scipy_proceedings/demo/" is correct
DOI Exists (optional)
No DOI available for vanderplas2020pluto (skipped)
No DOI available for bostock2017observable (skipped)
No DOI available for valim2020livebook (skipped)
No DOI available for victor2012inventing (skipped)
No DOI available for koop2017dataflow (skipped)
No DOI available for ipyflow (skipped)
No DOI available for dolstra2004nix (skipped)
No DOI available for dolstra2006purely (skipped)
No DOI available for jupytercache (skipped)
No DOI available for streamlit2023caching (skipped)
No DOI available for diskcache (skipped)
No DOI available for joblib (skipped)
No DOI available for manz2026beyond (skipped)
Word Count
Shorten your document to less than 6000 words