-
Add sum, subtraction, multiplication, integer division, modulo and parenthesis
```
void mult(x,y) {
iterate(x*(y+1)) {
putbeeper();
}
}
```
-
We should prove the fundamental theorem of arithmetic for `nat` and `IsPrime`. The basic statement says that any given `nat` has a factorisation and any two factorisations are unique up to a permutati…
-
### Proposal Details
I have a simple expression optimization suggestion that I noticed in some of my code. The minimal snippet that produces the offending code is this:
```
func calc(a uint64) ui…
-
Reproduction:
```
git fetch
git checkout sp-offset-overflow-or-underflow
pnpm i
cd contracts
pnpm fuzz-repro issues/sp-offset-overflow-or-underflow.json -- -vvv
```
-
The best way to do bulk few-limb arithmetic on real numbers seems to be to convert to fixed-point form for things like matrix multiplication, FFT and polynomial multiplication. This generally means us…
-
-
When converting from a signed integer to unsigned integer the value should be 2^(bits)-value
Ex:
signed 32 bit: -1
unsigned 32 bit casted: 2^32 - 1
-
I'm interested in performing cryptographic arithmetic involving negative (signed) integers. As is made evident in #1, this crate does not yet provide support for this.
I'm exploring what writing t…
-
# Summary
Provide limited instructions for 128-bit integer arithmetic.
# Motivation
Two use cases of 128-bit arithmetic known are:
- Arbitrary-precision integer arithmetic with 64-bit lim…
-
**Why**: Sub of #949 . In order to create a realistic manifest file for the GSF website
**What**: We need the ability to carry out simple arithmetic between the different elements
**Context**
Let's s…