You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Our current circuits do A LOT of token transfers, which uses a lot of constraints. We may want to create circuit permutations that do not do this many. If needed, Orders/Rings can contain an identifier in which circuit permutation they can be used.
For example, for an Exchange that does everything itself (wallet + ring-matcher + operator) we only need to pay a fee from the order to a single wallet. All payments to the ring-matcher and payment from the ring-matcher to the operator can be removed, greatly increasing the number of constraints used by the circuits (and thus greatly increasing the achievable throughput).
The text was updated successfully, but these errors were encountered:
Brechtpd
changed the title
[Protocol3] Create circuit permutations with less fee payments
[Protocol3] Create circuit permutations with fewer fee payments
Apr 1, 2019
As you can see, lots of different accounts (tree depth of accounts is 20, so expensive to update). Much cheaper to do a lot of payments to/from a single account (tree depth of balances is only 8).
A
The absolute minimum amount of token transfers we can do (with a fee payment):
The way we currently enforce the burn rate not possible (because the margin is used) though solutions for this could found (e.g. the fee is a percentage of amountS).
@dong77 Yes, let's close this one. I think we should still think about how to reduce payments somehow if possible, but not in the way described in this issue.
Our current circuits do A LOT of token transfers, which uses a lot of constraints. We may want to create circuit permutations that do not do this many. If needed, Orders/Rings can contain an identifier in which circuit permutation they can be used.
For example, for an Exchange that does everything itself (wallet + ring-matcher + operator) we only need to pay a fee from the order to a single wallet. All payments to the ring-matcher and payment from the ring-matcher to the operator can be removed, greatly increasing the number of constraints used by the circuits (and thus greatly increasing the achievable throughput).
The text was updated successfully, but these errors were encountered: