Date: Wed, 14 Jan 2026 13:59:42 -0800
On Wednesday, 14 January 2026 10:24:05 Pacific Standard Time Hans Åberg via
Std-Proposals wrote:
> They discussed alignment here before. Also, padding to the nearest 2^(2^k)
> would be needed for the recursive templates.
All _BitInt of a power of 2 have exactly that size, with no padding bits.
Therefore, _BitInt(256) or _BitInt(65536) *can* be as efficient as your code.
_BitInt(4096) has exactly 4096 bits. Are you claiming that to get the best
performance, it should be padded up to 65536 bits, the next power of 2 raised
to a power of 2 (k = 4)?
Std-Proposals wrote:
> They discussed alignment here before. Also, padding to the nearest 2^(2^k)
> would be needed for the recursive templates.
All _BitInt of a power of 2 have exactly that size, with no padding bits.
Therefore, _BitInt(256) or _BitInt(65536) *can* be as efficient as your code.
_BitInt(4096) has exactly 4096 bits. Are you claiming that to get the best
performance, it should be padded up to 65536 bits, the next power of 2 raised
to a power of 2 (k = 4)?
-- Thiago Macieira - thiago (AT) macieira.info - thiago (AT) kde.org Principal Engineer - Intel Data Center - Platform & Sys. Eng.
Received on 2026-01-14 21:59:51