summaryrefslogtreecommitdiffstats
path: root/docs/playlists.md
diff options
context:
space:
mode:
authorChristophe Besson <cbesson@gmail.com>2026-10-08 01:27:58 +0200
committerChristophe Besson <cbesson@gmail.com>2026-10-08 01:27:58 +0200
commitc27e04c88557716bbe8e42b9174ba9b07f90facf (patch)
treea1a56edbede2bba9bb0cc99b81b98570b8313915 /docs/playlists.md
parentcdd5fd52e981c4c59643e7dee705b6c55acae68e (diff)
downloadmeshbay-c82e6b73295b8fc647f6103c55b8e410b90d3d58.tar.gz
perf(node): sample 9 MB with the size above 9 MB, keep known ids0.19
hash_version 3: size + first 4 MB + last 4 MB + 1 MB at the middle, 5.5x faster cold on a USB disk than the 45 MB sample. The cache now serves a hit under whatever version it holds, so no existing id moves. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Diffstat (limited to 'docs/playlists.md')
-rw-r--r--docs/playlists.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/docs/playlists.md b/docs/playlists.md
index f1f6b67..05e6776 100644
--- a/docs/playlists.md
+++ b/docs/playlists.md
@@ -447,7 +447,7 @@ Each field prevents a specific failure:
playlist is a column of hex strings. A display problem, solved by copying four
small strings.
- **`hv`** — the index already has two hashing schemes (`protocol.py:297`:
- 1 = whole file, 2 = 45 MB sample). A re-hash would orphan every entry in every
+ 1 = whole file, 2 = 45 MB sample, 3 = size + 9 MB sample). A re-hash would orphan every entry in every
playlist, silently and all at once.
- **`p`** — content addressing survives a move; a path survives a re-encode.
Keeping both means either can repair the other: on a sight of the live index,