-
Hello,
I need to compute a multiplication of two integers a, b modulo a big prime P. Those integers and the prime fit in a UINT256, but to compute the result of ``a*b mod P`` I need to compute ``a*…
-
- `SUB_REDUCED_A_AND_REDUCED_B`
- `UINT384_SPLIT_128`
- `ADD_NO_UINT384_CHECK`
- `INV_MOD_P_UINT512`
-
At the moment, we only simulate biggroup batch muls in the case when `Fr` is a `field_t` (in fact this restriction is imposed in a way the relies on loose coupling, since we single out the `field_t` c…
-
## Description
[Since there's no modular multiplication implemented](https://github.com/RustCrypto/crypto-bigint/issues/1) in the `crypto-bigint` library yet , we initially used `mul_wide` when multi…
-
BPO | [19905](https://bugs.python.org/issue19905)
--- | :---
Nosy | @meadori
Dependencies | bpo-19904: Add 128-bit integer support to struct
*Note: these values reflect the state of the issue at the …
-
Following comments about improving performance in #5:
If using GNU MP turns out to be a bottleneck, here are some alternatives to consider
- https://github.com/bluescarni/mppp
- https://github.c…
-
Cloak and PeerCoin etc use a variable called bnChainTrust (member of block index) to ascertain the current chain trust at the particular block height associated with the block index. Seeing as the co…
-
_Перенос предложения:_ голоса +7, -3
_Автор идеи:_ **dix75**
Добавить новый proposal и/или дополнить существующий proposal стандартными функциями
Существует[ proposal wide_int Template Class](…
-
https://github.com/lambdaclass/cairo-vm/blob/db7fff18c9c1312024ebf4119fcdfeba23657b12/cairo_programs/inv_mod_p_uint512.cairo#L20
https://github.com/starkware-libs/cairo-lang/blob/0e4dab8a6065d80d1c…
-
@rwarmstr got another question if you have time: I profiled the `wide_vadd` tutorial with some small
modification to add float instead of integers. I also used 4 concurrent kernels.
Environment: …