Yukihiro "Matz" Matsumoto ef64ca32a1 mruby-bigint: optimize multiplication for power-of-2 numbers ...

Add fast path for multiplying by powers of 2 (2^n). Uses left shift
instead of Karatsuba multiplication: x * 2^n = x << n.

This optimizes "mostly-zero" patterns common in fuzzing tests, where
numbers like 2^2097150 (single bit set) would otherwise trigger slow
Karatsuba multiplication.

Co-authored-by: Claude <noreply@anthropic.com>

2026-01-09 12:29:50 +09:00

..

bigint.c

mruby-bigint: optimize multiplication for power-of-2 numbers

2026-01-09 12:29:50 +09:00

bigint.h

misc: fix spelling

2025-05-14 02:01:02 +10:00