Date: Tue, 13 Jan 2026 14:41:44 +0100
On 13/01/2026 14:34, Hans Åberg via Std-Proposals wrote:
> There might be support for modular integers int_mod<m> ≔ ℤ/mℤ for a modulus m that fits into a fixed-sized word, say 4096 bits for use in cryptology, m ≤ 2⁴⁰⁹⁶. With recursive templates, like those I have written, for fixed-size unsigned integral types up to uint4096_t, it should not be difficult to implement.
>
"unsigned _BitInt(4096)" will give you that. That is already part of
C23, and I believe it is coming to C++, though I don't know the current
status off-hand.
> There might be support for modular integers int_mod<m> ≔ ℤ/mℤ for a modulus m that fits into a fixed-sized word, say 4096 bits for use in cryptology, m ≤ 2⁴⁰⁹⁶. With recursive templates, like those I have written, for fixed-size unsigned integral types up to uint4096_t, it should not be difficult to implement.
>
"unsigned _BitInt(4096)" will give you that. That is already part of
C23, and I believe it is coming to C++, though I don't know the current
status off-hand.
Received on 2026-01-13 13:41:52