-
_Please note that this is work in progress, and that more details will be added as soon as possible._
### Problems & Concerns
This proposal wishes to explore ways in which the UTXO could be simpli…
-
With the merging of #130, It is possible to prove 25 key-value pairs for 430-530k gas. This is much more efficient than using union membership proofs, to the point that we can consider removing union …
-
Currently, the Merkle tree used for the AVK is balanced which implies that signatures produced by any two parties will have the same length. Since parties with high stake are expected to produce signa…
-
Expense Report Automation
- Pay attention to an individual’s Org membership
- Keep track of all addresses/contracts associated with each Org (Gnosis safe, etc.)
- Lookup each expense within each O…
-
### Aim: permit accountability for publishers and relays.
follows the discussion [in this issue](https://github.com/nostr-protocol/nostr/issues/148)
### Publisher's weight using key-longevity
…
-
**User story:**
An exchange has been a good privacy citizen, receiving all incoming deposits to shielded addresses. How can they prove their reserves without compromising the privacy of users?
-…
-
## Context
The current invitations system works fine but has three main limitations :
* it does not support the historization of what happened to the invitation
* it does not support extensibilit…
-
Our current approach to committing on list of neighbors is something like this:
- if A called B and C, compute c_A = g^r.h^A.h_1^B.h_2^C.
If we need to prove that A called B at some point, we will…
-
- Determine data and policy formats
- Implement Besu-specific components: driver, interoperation module, SDK
- Create sample application contracts
- Run end-to-end tests
- Create RFCs for specificatio…
-
Using a command of the type `benchmark --chain dummy --raw --wasm-execution compiled --execution wasm --pallet pallet_grandpa --extrinsic "*" --steps 50 --repeat 2 --output` would generate a file simi…