Skip to content

Add familiar bounded reductions - #9

Merged
PraneethMerugu merged 5 commits into
mainfrom
codex/bounded-reductions
Sep 7, 2026
Merged

Add familiar bounded reductions#9
PraneethMerugu merged 5 commits into
mainfrom
codex/bounded-reductions

Conversation

@PraneethMerugu

Copy link
Copy Markdown
Owner

Adds deterministic bounded-view sum, extrema, mean, and geometric mean on the existing BoundedFold authority. Preserves duplicate and absence semantics, explicit primitive result types, transaction rejection, and the sole CPU/Metal KernelAbstractions path. Updates the package to 0.2.0-rc2 with release notes and documentation.\n\nValidation: focused CPU reductions 157/157; LocalMath documentation and doctests pass; focused real-Metal authoring 31/31 on Julia 1.12.6.

@PraneethMerugu
PraneethMerugu changed the base branch from codex/data-first-fold to main September 7, 2026 00:10
@PraneethMerugu
PraneethMerugu merged commit 3ec009f into main Sep 7, 2026
6 checks passed
@PraneethMerugu
PraneethMerugu deleted the codex/bounded-reductions branch September 7, 2026 02:16
@PraneethMerugu

Copy link
Copy Markdown
Owner Author

Post-merge engineering evidence for the bounded-reduction cutover is recorded alongside the shared fold authority: #8 (comment) . On the documented two-item Float32 witness, bounded sum infers a concrete isbits evaluator (234 optimized typed-IR statements), uses the existing direct Unique path (2 complete provider launches), has 1,536 warm host-allocated bytes, and records zero warm Julia compilation/recompilation. The generic rejecting fold remains 5 launches as required by its failure semantics. These are focused observations, not a general throughput or GPU-latency claim.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant