mirror of
https://github.com/mruby/mruby
synced 2026-06-08 16:11:16 +00:00
0beaf72b82
Extends algorithm selection hierarchy with blocked multiplication for operands in the 32-128 limb range, providing cache optimization with controlled memory overhead (1.05x-1.25x). Key features: - 8-limb blocks optimized for L1 cache efficiency - Constant 64-byte memory buffer regardless of operand size - Enhanced algorithm selection: Classical → Sliding Window → Blocked → Classical fallback - Memory constraint validation ensuring ≤2.0x overhead for all cases - Full backward compatibility with existing optimizations Performance characteristics: - Target range: 32-128 limbs (1024-4096 bits) - Memory overhead: 1.05x-1.25x (well within embedded constraints) - Cache-friendly block processing for superior memory bandwidth utilization - All 1700 tests pass with correctness verification This completes the memory-first optimization approach, demonstrating that significant performance improvements are achievable within strict memory constraints through cache optimization techniques. Co-authored-by: Claude <noreply@anthropic.com>