-
Does it not exist in these crates or could I not find it? If it doesn't exist, it would be really nice to have.
Same for modular inverse, and for generating random numbers (and random numbers modul…
-
[CIP-0109](https://cips.cardano.org/cip/CIP-0109) proposes a new modular exponentiation builtin for Plutus Core. This will calculate `a^k mod n` for integers `a` and ` k` and a positive integer `n` (…
kwxm updated
3 months ago
-
Modular exponentiation is used to compute pow(n1,n2)%mod (n1^n2%mod) in log(n2) time!
This algorithm computes pow(n1,n2) in log(n2). The normal algorithm would take O(n2) times. This O(n2) is not f…
-
Once the modular exponentiation function has been fully implemented in Plutus Core and PlutusTx and costed we should add some end-to-end tests for it.
-
I would like to add Modular Exponentiation algortihm as a contribution for the Hacktober Fest 2022, as it is a very useful algo.
Could you assign it to me
-
-
It would be useful if NumPy had a modular exponentiation function. Besides performance improvements over `a**b%m`, it also allows computations where `a**b` would not fit in the datatype.
NumPy als…
-
- Make sure to add a .json file. have a look at the previous contribution in this repo to get a better understanding.
- Add a markdown file explaining what the snippets does and what all is recommend…
-
Introduce modular exponentiation in poly similar to `pow(base, exp, mod)`
-
It would be nice for curbing expression swell if high powers `RootOf` objects were reduced according to their minimal polynomial, like below:
``` python
import sympy
from sympy.abc import y
f = 3*y*…