-
Something that we might want to follow up on is that for G2 there exists an even more efficient decomposition relying on the GLS endomorphism (https://eprint.iacr.org/2008/194)
_Originally …
jules updated
2 years ago
-
## 🚀 Feature
As discussed with Pranav on the dev hour call, the function should work similar to the normal ChaCha rand function, but take three arguments:
1. The address of the caller
2. The addr…
-
## 🐛 Bug Report
This bug does not affect mainnet. It is a bug in a test function
that may cause false positives or negatives from the tests that use it.
However, there are other more complete te…
-
## 🐛 Bug Report
## Steps to Reproduce
Run this function:
```
program test_output.aleo {
transition double_output() -> (u64, u64) {
return (0u64, 0u64);
}
}
```
Find t…
d0cd updated
9 months ago
-
Running 3 client nodes, they are rarely at the same height (or lagging by 1-2 blocks). Also, periodically nodes just stop syncing and then rapidly catch up by 10-20-30 blocks in a short time.
In th…
-
### Summary
This might be wontfix territory, but here is an interesting case derived from https://github.com/AleoHQ/snarkVM/blob/71e39319b6fb5bcaddd48c95d32e2f80ac103954/algorithms/src/msm/variable_b…
-
## 🚀 Feature
The goal is to have the ability to define a function definition into the language without a body.
(Write your description here)
## Motivation
In the STDLIB, we often have func…
gluax updated
2 years ago
-
As described in https://github.com/AleoHQ/snarkOS/pull/219:
> https://github.com/scipr-lab/zexe/ uses the Zero and One traits from the num_traits crate. Due to a trait resolution problem in Rust, t…
-
## 🐛 Bug Report
The two Pedersen variants of the `commit` instruction take up-to 64 and 128 bit inputs respectively.
However, using `Value::to_bits_le` (it's because of `Plaintext::to_bits_le`) intr…
-
## 💥 Proposal
I think there are some FFTs in the Marlin prover that can be removed (almost) for free. Namely:
- In the sumcheck inside the third round of the Marlin prover, we need to [compute](…