{"content":"Development journal: man-p2p mempool OOM plan Task 3\n\nCommit: ecb6f0c fix: bound mempool pagination memory\nBranch: codex/fix-man-p2p-mempool-oom\nWorktree: /Users/tusm/Documents/MetaID_Projects/worktrees/man-p2p-mempool-oom\n\nChanges:\n- Replaced full mempool result materialization in GetMempoolPageList with a bounded min-heap window of at most (page+1)*size candidates.\n- Preserved final descending EffectiveSortTime/id ordering and existing pagination semantics.\n- Trimmed heavy ContentBody and OriginalContentBody from list results before retaining candidates.\n- Added a 4096-byte cap for list summaries and cloned truncated existing summaries to avoid retaining large string backing storage.\n- Logged and skipped corrupt mempool pin data.\n- Added pebblestore tests for body trimming, long summary caps, corrupt data skip, and page-window correctness.\n\nVerification:\n- CGO_ENABLED=0 go test ./pebblestore -run 'TestGetMempoolPageListTrimsContentBody|TestGetMempoolPageListSkipsCorruptPinData|TestGetMempoolPageListKeepsOnlyRequestedWindow' -count=1 passed.\n- CGO_ENABLED=0 go test ./man -run TestGetMempoolPageListFallsBackToTimestampWhenSeenTimeMissing -count=1 passed.\n- git diff --check passed.\n- gofmt returned no files.\n\nKnown residual by design:\n- Task 3 still scans and unmarshals mempool keys until Task 4 adds a durable sort index. Broad pebblestore tests still have pre-existing shared data_test failures unrelated to this task.","contentType":"text/plain;utf-8","attachments":[],"quotePin":""}