Chris Tate ff70c33e38 Divide one-limb BigInt quotients in one pass and chain limb carries ...

Dividing BigInts of the same limb count, where the quotient is one limb,
takes Knuth's quotient estimate from the top limbs as they read
normalized and settles it with one pass of a - q * b over the operands,
instead of copying both operands shifted and running algorithm D. The
remainder, when wanted, is that pass's result.

The limb loops for add, subtract, multiply by a limb, and multiply-add
and multiply-subtract by a limb process four limbs a pass, with the
carries in add-with-carry chains (__builtin_addcll and __builtin_subcll
where the compiler has them).

2026-10-24 11:59:33 -05:00

..

src

Divide one-limb BigInt quotients in one pass and chain limb carries

2026-10-24 11:59:33 -05:00

test

Bound Brotli parameter names in error messages

2026-10-23 22:57:22 -05:00

vendor

zlib: Brotli compression and decompression over the vendored brotli 1.2.0

2026-10-23 18:11:49 -05:00

LICENSE

init

2026-07-22 18:08:04 -05:00

package.json

Prepare v0.4.4 release

2026-10-23 20:51:00 -05:00