docs(rfc): RFC 0005 §3.6 amendment — blooms on trace-context ids, with measured evidence - #491
Conversation
…h the measured evidence Co-Authored-By: Claude Fable 5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y
|
Warning Review limit reached
Next review available in: 41 minutes Enable usage-based reviews in Billing to review now. Otherwise, wait until the next included review is available. How can I continue?After more reviews become available, a review can be triggered using the To avoid repeated limits, reduce automatic review volume by pausing incremental auto-reviews earlier, using label-based review opt-in, excluding WIP or generated PR titles, or requesting reviews manually when the PR is ready. If your team needs uninterrupted high-volume reviews, an organization admin can enable usage-based reviews. How do review limits work?CodeRabbit enforces per-developer PR review limits for each organization. Most developers receive the normal plan review availability. For paid Pro and Pro+ PR reviews, CodeRabbit uses adaptive limits for sustained high-volume activity. When a developer's recent PR review activity reaches the 95th percentile or higher among CodeRabbit users, additional reviews become available more gradually as earlier reviews age out of the rolling window. Please refer docs for additional details. Review details⚙️ Run configurationConfiguration used: defaults Review profile: CHILL Plan: Pro Plus Run ID: 📒 Files selected for processing (1)
📝 WalkthroughWalkthroughThe Parquet storage RFC now enables bloom filters for ChangesParquet encoding policy
Estimated code review effort: 1 (Trivial) | ~3 minutes 🚥 Pre-merge checks | ✅ 5✅ Passed checks (5 passed)
✨ Finishing Touches🧪 Generate unit tests (beta)
Thanks for using CodeRabbit! It's free for OSS, and your support helps us grow. If you like it, consider giving us a shout-out. Comment |
There was a problem hiding this comment.
Pull request overview
Updates RFC 0005’s Parquet encoding policy rationale to reflect measured evidence that bloom filters materially improve exact trace_id/span_id lookups, and records the benchmarking results that motivated the change.
Changes:
- Mark
trace_idandspan_idas bloom-filtered in the §3.6 encoding policy table. - Add a dated amendment block explaining why blooms help near-random IDs and citing comparative run measurements.
💡 Add Copilot custom instructions for smarter, more guided reviews. Learn how to get started.
There was a problem hiding this comment.
Actionable comments posted: 1
🤖 Prompt for all review comments with AI agents
Verify each finding against current code. Fix only still-valid issues, skip the
rest with a brief reason, keep changes minimal, and validate.
Inline comments:
In `@docs/rfcs/0005-parquet-storage.md`:
- Around line 556-571: The amendment’s bloom-filter reduction figure is
arithmetically inconsistent: 72.4 MB divided by 4.8 MB rounds to 15.1×. Update
the “With blooms (run `#14`)” sentence to say 15.1×, unless authoritative
unrounded measurements are available and should be cited instead.
🪄 Autofix (Beta)
Fix all unresolved CodeRabbit comments on this PR:
- Push a commit to this branch (recommended)
- Create a new PR with the fixes
ℹ️ Review info
⚙️ Run configuration
Configuration used: defaults
Review profile: CHILL
Plan: Pro Plus
Run ID: 0000f871-140f-4005-ab62-1080f55c6d7d
📒 Files selected for processing (1)
docs/rfcs/0005-parquet-storage.md
…ted directly Co-Authored-By: Claude Fable 5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y
…set index, not min/max) Co-Authored-By: Claude Fable 5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y
Co-Authored-By: Claude Fable 5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y
What
The RFC 0005 §3.6 amendment recording #489's bloom filters on
trace_id/span_id— the evidence-first sequencing agreed with the maintainer: code + pre-merge measurement first (runs #12/#14), the RFC text now carrying the measured numbers.The amendment also corrects the original table's reasoning on the record: "dict and bloom both lose" conflated two different costs. Dictionaries lose on near-random ids (true); the bloom is the only pruning mechanism an exact-id lookup has, precisely because those same ids defeat min/max statistics. Measured cost of the original decision: 72.4 MB to find 9 rows (run #12); with blooms: 4.8 MB (run #14) and the RFC 0031 L3 must-win passes at 21.9× / 514.6×.
Invariants / hazards
Docs-only. §3.5 unaffected (blooms are optional column metadata; both compat directions unaffected, stated in the amendment).
Checks run
mdbook build(clean),cargo fmt --all --check(trivially — no code).🤖 Generated with Claude Code
https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y
Summary by CodeRabbit