| 1 Jun 2025 |
 edef | we cache them at most briefly, but this isn't the point | 17:45:30 |
| edef | every derivation you build that isn't cached doesn't start building until it has been confirmed it 404s | 17:45:47 |
| edef | approximately 100% of all nix derivations aren't in the cache | 17:46:02 |
| edef | the caching is in the wrong direction | 17:46:29 |
| edef | caching absences buys you essentially nothing | 17:46:42 |
| edef | there are 1461501637330902918203684832716283019655932542976 (2^160) store paths, most of which are absent from the cache | 17:47:04 |
| edef | we only have 2^28 or so present store paths | 17:47:31 |
| edef | your 404 cache cannot fit 2^160 items | 17:47:41 |
 Arian | Bloom Filter? | 17:48:01 |
| Arian | Anyhow I digress. My idea definitely seems too simplistic | 17:48:12 |
| edef | yes, a bloom filter works | 17:48:18 |
 Vladimír Čunát | It's normal to cache even over larger spaces than 2^160. | 17:48:20 |
| Vladimír Čunát | (I do that at work.) | 17:48:37 |
| edef | but a bloom filter only kicks the can down the road, it only answers "probably present", etc | 17:49:30 |
