2022-11-17 02:53:35 +00:00
|
|
|
[advisories]
|
2024-06-19 16:39:47 +00:00
|
|
|
version = 2
|
|
|
|
|
|
2022-11-17 02:53:35 +00:00
|
|
|
db-path = "~/.cargo/advisory-db"
|
|
|
|
|
db-urls = ["https://github.com/rustsec/advisory-db"]
|
|
|
|
|
|
|
|
|
|
yanked = "deny"
|
|
|
|
|
|
|
|
|
|
ignore = [
|
2024-06-19 16:39:47 +00:00
|
|
|
"RUSTSEC-2020-0168", # mach is unmaintained
|
2023-01-13 22:44:20 +00:00
|
|
|
"RUSTSEC-2021-0139", # https://github.com/serai-dex/serai/228
|
|
|
|
|
"RUSTSEC-2022-0061", # https://github.com/serai-dex/serai/227
|
2024-09-06 03:31:45 +00:00
|
|
|
"RUSTSEC-2024-0370", # proc-macro-error is unmaintained
|
2022-11-17 02:53:35 +00:00
|
|
|
]
|
|
|
|
|
|
|
|
|
|
[licenses]
|
2024-06-19 16:39:47 +00:00
|
|
|
version = 2
|
2022-11-17 02:53:35 +00:00
|
|
|
|
|
|
|
|
allow = [
|
|
|
|
|
# Effective public domain
|
|
|
|
|
"CC0-1.0",
|
|
|
|
|
"Unlicense",
|
|
|
|
|
|
|
|
|
|
# Attribution required
|
|
|
|
|
"MIT",
|
2023-04-09 06:34:31 +00:00
|
|
|
"MITNFA",
|
2022-11-17 02:53:35 +00:00
|
|
|
"BSD-2-Clause",
|
|
|
|
|
"BSD-3-Clause",
|
|
|
|
|
"ISC",
|
|
|
|
|
"Unicode-DFS-2016",
|
|
|
|
|
"OpenSSL",
|
|
|
|
|
|
|
|
|
|
# Non-invasive copyleft
|
|
|
|
|
"MPL-2.0",
|
|
|
|
|
"Apache-2.0",
|
|
|
|
|
"Apache-2.0 WITH LLVM-exception",
|
|
|
|
|
"GPL-3.0 WITH Classpath-exception-2.0",
|
|
|
|
|
]
|
|
|
|
|
|
|
|
|
|
exceptions = [
|
2023-07-17 04:50:46 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-env" },
|
|
|
|
|
|
2022-11-17 02:53:35 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "ethereum-serai" },
|
2024-05-22 22:50:11 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-ethereum-relayer" },
|
2022-11-17 02:53:35 +00:00
|
|
|
|
2023-07-03 12:09:41 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-message-queue" },
|
2023-07-03 11:09:35 +00:00
|
|
|
|
2023-07-03 12:09:41 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-processor-messages" },
|
2024-08-16 18:51:31 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-processor-key-gen" },
|
2024-08-19 02:43:13 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-processor-frost-attempt-manager" },
|
2024-08-30 23:51:53 +00:00
|
|
|
|
|
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-processor-transaction-chaining-scheduler" },
|
|
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-processor-scanner" },
|
2023-07-03 12:09:41 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-processor" },
|
2023-01-05 03:52:41 +00:00
|
|
|
|
2023-04-11 14:18:31 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "tributary-chain" },
|
2023-07-03 12:09:41 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-coordinator" },
|
2023-04-11 13:21:35 +00:00
|
|
|
|
2023-10-19 10:22:21 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-coins-pallet" },
|
2023-11-05 17:02:34 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-dex-pallet" },
|
2023-01-28 06:47:13 +00:00
|
|
|
|
2024-07-18 23:30:19 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-genesis-liquidity-pallet" },
|
2024-08-15 03:12:04 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-emissions-pallet" },
|
2024-07-18 23:30:19 +00:00
|
|
|
|
2024-08-31 22:55:42 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-economic-security-pallet" },
|
|
|
|
|
|
2023-07-03 12:09:41 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-in-instructions-pallet" },
|
2023-01-20 16:00:18 +00:00
|
|
|
|
2023-07-03 12:09:41 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-validator-sets-pallet" },
|
2022-11-17 02:53:35 +00:00
|
|
|
|
2023-10-22 00:06:53 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-signals-pallet" },
|
|
|
|
|
|
2022-11-17 02:53:35 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-runtime" },
|
|
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-node" },
|
2023-01-20 16:00:18 +00:00
|
|
|
|
2024-02-09 07:48:44 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-orchestrator" },
|
|
|
|
|
|
Add support for multiple multisigs to the processor (#377)
* Design and document a multisig rotation flow
* Make Scanner::eventualities a HashMap so it's per-key
* Don't drop eventualities, always follow through on them
Technical improvements made along the way.
* Start creating an isolate object to manage multisigs, which doesn't require being a signer
Removes key from SubstrateBlock.
* Move Scanner/Scheduler under multisigs
* Move Batch construction into MultisigManager
* Clarify "should" in Multisig Rotation docs
* Add block_number to MultisigManager, as it controls the scanner
* Move sign_plans into MultisigManager
Removes ThresholdKeys from prepare_send.
* Make SubstrateMutable an alias for MultisigManager
* Rewrite Multisig Rotation
The prior scheme had an exploit possible where funds were sent to the old
multisig, then burnt on Serai to send from the new multisig, locking liquidity
for 6 hours. While a fee could be applied to stragglers, to make this attack
unprofitable, the newly described scheme avoids all this.
* Add mini
mini is a miniature version of Serai, emphasizing Serai's nature as a
collection of independent clocks. The intended use is to identify race
conditions and prove protocols are comprehensive regarding when certain clocks
tick.
This uses loom, a prior candidate for evaluating the processor/coordinator as
free of race conditions (#361).
* Use mini to prove a race condition in the current multisig rotation docs, and prove safety of alternatives
Technically, the prior commit had mini prove the race condition.
The docs currently say the activation block of the new multisig is the block
after the next Batch's. If the two next Batches had already entered the
mempool, prior to set_keys being called, the second next Batch would be
expected to contain the new key's data yet fail to as the key wasn't public
when the Batch was actually created.
The naive solution is to create a Batch, publish it, wait until it's included,
and only then scan the next block. This sets a bound of
`Batch publication time < block time`. Optimistically, we can publish a Batch
in 24s while our shortest block time is 2m. Accordingly, we should be fine with
the naive solution which doesn't take advantage of throughput. #333 may
significantly change latency however and require an algorithm whose throughput
exceeds the rate of blocks created.
In order to re-introduce parallelization, enabling throughput, we need to
define a safe range of blocks to scan without Serai ordering the first one.
mini demonstrates safety of scanning n blocks Serai hasn't acknowledged, so
long as the first is scanned before block n+1 is (shifting the n-block window).
The docs will be updated next, to reflect this.
* Fix Multisig Rotation
I believe this is finally good enough to be final.
1) Fixes the race condition present in the prior document, as demonstrated by
mini.
`Batch`s for block `n` and `n+1`, may have been in the mempool when a
multisig's activation block was set to `n`. This would cause a potentially
distinct `Batch` for `n+1`, despite `n+1` already having a signed `Batch`.
2) Tightens when UIs should use the new multisig to prevent eclipse attacks,
and protection against `Batch` publication delays.
3) Removes liquidity fragmentation by tightening flow/handling of latency.
4) Several clarifications and documentation of reasoning.
5) Correction of "prior multisig" to "all prior multisigs" regarding historical
verification, with explanation why.
* Clarify terminology in mini
Synchronizes it from my original thoughts on potential schema to the design
actually created.
* Remove most of processor's README for a reference to docs/processor
This does drop some misc commentary, though none too beneficial. The section on
scanning, deemed sufficiently beneficial, has been moved to a document and
expanded on.
* Update scanner TODOs in line with new docs
* Correct documentation on Bitcoin::Block::time, and Block::time
* Make the scanner in MultisigManager no longer public
* Always send ConfirmKeyPair, regardless of if in-set
* Cargo.lock changes from a prior commit
* Add a policy document on defining a Canonical Chain
I accidentally committed a version of this with a few headers earlier, and this
is a proper version.
* Competent MultisigManager::new
* Update processor's comments
* Add mini to copied files
* Re-organize Scanner per multisig rotation document
* Add RUST_LOG trace targets to e2e tests
* Have the scanner wait once it gets too far ahead
Also bug fixes.
* Add activation blocks to the scanner
* Split received outputs into existing/new in MultisigManager
* Select the proper scheduler
* Schedule multisig activation as detailed in documentation
* Have the Coordinator assert if multiple `Batch`s occur within a block
While the processor used to have ack_up_to_block, enabling skips in the block
acked, support for this was removed while reworking it for multiple multisigs.
It should happen extremely infrequently.
While it would still be beneficial to have, if multiple `Batch`s could occur
within a block (with the complexity here not being worth adding that ban as a
policy), multiple `Batch`s were blocked for DoS reasons.
* Schedule payments to the proper multisig
* Correct >= to <
* Use the new multisig's key for change on schedule
* Don't report External TXs to prior multisig once deprecated
* Forward from the old multisig to the new one at all opportunities
* Move unfulfilled payments in queue from prior to new multisig
* Create MultisigsDb, splitting it out of MainDb
Drops the call to finish_signing from the Signer. While this will cause endless
re-attempts, the Signer will still consider them completed and drop them,
making this an O(n) cost at boot even if we did nothing from here.
The MultisigManager should call finish_signing once the Scanner completes the
Eventuality.
* Don't check Scanner-emitted completions, trust they are completions
Prevents needing to use async code to mark the completion and creates a
fault-free model. The current model, on fault, would cause a lack of marked
completion in the signer.
* Fix a possible panic in the processor
A shorter-chain reorg could cause this assert to trip. It's fixed by
de-duplicating the data, as the assertion checked consistency. Without the
potential for inconsistency, it's unnecessary.
* Document why an existing TODO isn't valid
* Change when we drop payments for being to the change address
The earlier timing prevents creating Plans solely to the branch address,
causing the payments to be dropped, and the TX to become an effective
aggregation TX.
* Extensively document solutions to Eventualities being potentially created after having already scanned their resolutions
* When closing, drop External/Branch outputs which don't cause progress
* Properly decide if Change outputs should be forward or not when closing
This completes all code needed to make the old multisig have a finite lifetime.
* Commentary on forwarding schemes
* Provide a 1 block window, with liquidity fragmentation risks, due to latency
On Bitcoin, this will be 10 minutes for the relevant Batch to be confirmed. On
Monero, 2 minutes. On Ethereum, ~6 minutes.
Also updates the Multisig Rotation document with the new forwarding plan.
* Implement transaction forwarding from old multisig to new multisig
Identifies a fault where Branch outputs which shouldn't be dropped may be, if
another output fulfills their next step. Locking Branch fulfillment down to
only Branch outputs is not done in this commit, but will be in the next.
* Only let Branch outputs fulfill branches
* Update TODOs
* Move the location of handling signer events to avoid a race condition
* Avoid a deadlock by using a RwLock on a single txn instead of two txns
* Move Batch ID out of the Scanner
* Increase from one block of latency on new keys activation to two
For Monero, this offered just two minutes when our latency to publish a Batch
is around a minute already. This does increase the time our liquidity can be
fragmented by up to 20 minutes (Bitcoin), yet it's a stupid attack only
possible once a week (when we rotate). Prioritizing normal users' transactions
not being subject to forwarding is more important here.
Ideally, we'd not do +2 blocks yet plus `time`, such as +10 minutes, making
this agnostic of the underlying network's block scheduling. This is a
complexity not worth it.
* Split MultisigManager::substrate_block into multiple functions
* Further tweaks to substrate_block
* Acquire a lock on all Scanner operations after calling ack_block
Gives time to call register_eventuality and initiate signing.
* Merge sign_plans into substrate_block
Also ensure the Scanner's lock isn't prematurely released.
* Use a HashMap to pass to-be-forwarded instructions, not the DB
* Successfully determine in ClosingExisting
* Move from 2 blocks of latency when rotating to 10 minutes
Superior as noted in 6d07af92ce10cfd74c17eb3400368b0150eb36d7, now trivial to
implement thanks to prior commit.
* Add note justifying measuring time in blocks when rotating
* Implement delaying of outputs received early to the new multisig per specification
* Documentation on why Branch outputs don't have the race condition concerns Change do
Also ensures 6 hours is at least N::CONFIRMATIONS, for sanity purposes.
* Remove TODO re: sanity checking Eventualities
We sanity check the Plan the Eventuality is derived from, and the Eventuality
is handled moments later (in the same file, with a clear call path). There's no
reason to add such APIs to Eventualities for a sanity check given that.
* Add TODO(now) for TODOs which must be done in this branch
Also deprecates a pair of TODOs to TODO2, and accepts the flow of the Signer
having the Eventuality.
* Correct errors in potential/future flow descriptions
* Accept having a single Plan Vec
Per the following code consuming it, there's no benefit to bifurcating it by
key.
* Only issue sign_transaction on boot for the proper signer
* Only set keys when participating in their construction
* Misc progress
Only send SubstrateBlockAck when we have a signer, as it's only used to tell
the Tributary of what Plans are being signed in response to this block.
Only immediately sets substrate_signer if session is 0.
On boot, doesn't panic if we don't have an active key (as we wouldn't if only
joining the next multisig). Continues.
* Correctly detect and set retirement block
Modifies the retirement block from first block meeting requirements to block
CONFIRMATIONS after.
Adds an ack flow to the Scanner's Confirmed event and Block event to accomplish
this, which may deadlock at this time (will be fixed shortly).
Removes an invalid await (after a point declared unsafe to use await) from
MultisigsManager::next_event.
* Remove deadlock in multisig_completed and document alternative
The alternative is simpler, albeit less efficient. There's no reason to adopt
it now, yet perhaps if it benefits modeling?
* Handle the final step of retirement, dropping the old key and setting new to existing
* Remove TODO about emitting a Block on every step
If we emit on NewAsChange, we lose the purpose of the NewAsChange period.
The only concern is if we reach ClosingExisting, and nothing has happened, then
all coins will still be in the old multisig until something finally does. This
isn't a problem worth solving, as it's latency under exceptional dead time.
* Add TODO about potentially not emitting a Block event for the reitrement block
* Restore accidentally deleted CI file
* Pair of slight tweaks
* Add missing if statement
* Disable an assertion when testing
One of the test flows currently abuses the Scanner in a way triggering it.
2023-09-25 13:48:15 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "mini-serai" },
|
|
|
|
|
|
2023-07-21 18:01:58 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-docker-tests" },
|
2023-07-20 23:34:10 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-message-queue-tests" },
|
2023-07-21 18:01:58 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-processor-tests" },
|
2023-08-01 23:00:48 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-coordinator-tests" },
|
2023-08-27 22:37:12 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-full-stack-tests" },
|
2023-07-28 02:09:04 +00:00
|
|
|
{ allow = ["AGPL-3.0"], name = "serai-reproducible-runtime-tests" },
|
2022-11-17 02:53:35 +00:00
|
|
|
]
|
|
|
|
|
|
|
|
|
|
[[licenses.clarify]]
|
|
|
|
|
name = "ring"
|
|
|
|
|
version = "*"
|
|
|
|
|
expression = "MIT AND ISC AND OpenSSL"
|
|
|
|
|
license-files = [
|
|
|
|
|
{ path = "LICENSE", hash = 0xbd0eed23 }
|
|
|
|
|
]
|
|
|
|
|
|
|
|
|
|
[bans]
|
|
|
|
|
multiple-versions = "warn"
|
|
|
|
|
wildcards = "warn"
|
|
|
|
|
highlight = "all"
|
2023-08-21 04:57:22 +00:00
|
|
|
deny = [ { name = "serde_derive", version = ">=1.0.172, <1.0.185" } ]
|
2022-11-17 02:53:35 +00:00
|
|
|
|
|
|
|
|
[sources]
|
|
|
|
|
unknown-registry = "deny"
|
|
|
|
|
unknown-git = "deny"
|
|
|
|
|
allow-registry = ["https://github.com/rust-lang/crates.io-index"]
|
|
|
|
|
allow-git = [
|
2023-10-16 05:39:15 +00:00
|
|
|
"https://github.com/rust-lang-nursery/lazy-static.rs",
|
2023-04-09 06:34:31 +00:00
|
|
|
"https://github.com/serai-dex/substrate-bip39",
|
2022-11-17 02:53:35 +00:00
|
|
|
"https://github.com/serai-dex/substrate",
|
One Round DKG (#589)
* Upstream GBP, divisor, circuit abstraction, and EC gadgets from FCMP++
* Initial eVRF implementation
Not quite done yet. It needs to communicate the resulting points and proofs to
extract them from the Pedersen Commitments in order to return those, and then
be tested.
* Add the openings of the PCs to the eVRF as necessary
* Add implementation of secq256k1
* Make DKG Encryption a bit more flexible
No longer requires the use of an EncryptionKeyMessage, and allows pre-defined
keys for encryption.
* Make NUM_BITS an argument for the field macro
* Have the eVRF take a Zeroizing private key
* Initial eVRF-based DKG
* Add embedwards25519 curve
* Inline the eVRF into the DKG library
Due to how we're handling share encryption, we'd either need two circuits or to
dedicate this circuit to the DKG. The latter makes sense at this time.
* Add documentation to the eVRF-based DKG
* Add paragraph claiming robustness
* Update to the new eVRF proof
* Finish routing the eVRF functionality
Still needs errors and serialization, along with a few other TODOs.
* Add initial eVRF DKG test
* Improve eVRF DKG
Updates how we calculcate verification shares, improves performance when
extracting multiple sets of keys, and adds more to the test for it.
* Start using a proper error for the eVRF DKG
* Resolve various TODOs
Supports recovering multiple key shares from the eVRF DKG.
Inlines two loops to save 2**16 iterations.
Adds support for creating a constant time representation of scalars < NUM_BITS.
* Ban zero ECDH keys, document non-zero requirements
* Implement eVRF traits, all the way up to the DKG, for secp256k1/ed25519
* Add Ristretto eVRF trait impls
* Support participating multiple times in the eVRF DKG
* Only participate once per key, not once per key share
* Rewrite processor key-gen around the eVRF DKG
Still a WIP.
* Finish routing the new key gen in the processor
Doesn't touch the tests, coordinator, nor Substrate yet.
`cargo +nightly fmt && cargo +nightly-2024-07-01 clippy --all-features -p serai-processor`
does pass.
* Deduplicate and better document in processor key_gen
* Update serai-processor tests to the new key gen
* Correct amount of yx coefficients, get processor key gen test to pass
* Add embedded elliptic curve keys to Substrate
* Update processor key gen tests to the eVRF DKG
* Have set_keys take signature_participants, not removed_participants
Now no one is removed from the DKG. Only `t` people publish the key however.
Uses a BitVec for an efficient encoding of the participants.
* Update the coordinator binary for the new DKG
This does not yet update any tests.
* Add sensible Debug to key_gen::[Processor, Coordinator]Message
* Have the DKG explicitly declare how to interpolate its shares
Removes the hack for MuSig where we multiply keys by the inverse of their
lagrange interpolation factor.
* Replace Interpolation::None with Interpolation::Constant
Allows the MuSig DKG to keep the secret share as the original private key,
enabling deriving FROST nonces consistently regardless of the MuSig context.
* Get coordinator tests to pass
* Update spec to the new DKG
* Get clippy to pass across the repo
* cargo machete
* Add an extra sleep to ensure expected ordering of `Participation`s
* Update orchestration
* Remove bad panic in coordinator
It expected ConfirmationShare to be n-of-n, not t-of-n.
* Improve documentation on functions
* Update TX size limit
We now no longer have to support the ridiculous case of having 49 DKG
participations within a 101-of-150 DKG. It does remain quite high due to
needing to _sign_ so many times. It'd may be optimal for parties with multiple
key shares to independently send their preprocesses/shares (despite the
overhead that'll cause with signatures and the transaction structure).
* Correct error in the Processor spec document
* Update a few comments in the validator-sets pallet
* Send/Recv Participation one at a time
Sending all, then attempting to receive all in an expected order, wasn't working
even with notable delays between sending messages. This points to the mempool
not working as expected...
* Correct ThresholdKeys serialization in modular-frost test
* Updating existing TX size limit test for the new DKG parameters
* Increase time allowed for the DKG on the GH CI
* Correct construction of signature_participants in serai-client tests
Fault identified by akil.
* Further contextualize DkgConfirmer by ValidatorSet
Caught by a safety check we wouldn't reuse preprocesses across messages. That
raises the question of we were prior reusing preprocesses (reusing keys)?
Except that'd have caused a variety of signing failures (suggesting we had some
staggered timing avoiding it in practice but yes, this was possible in theory).
* Add necessary calls to set_embedded_elliptic_curve_key in coordinator set rotation tests
* Correct shimmed setting of a secq256k1 key
* cargo fmt
* Don't use `[0; 32]` for the embedded keys in the coordinator rotation test
The key_gen function expects the random values already decided.
* Big-endian secq256k1 scalars
Also restores the prior, safer, Encryption::register function.
2024-08-16 18:26:07 +00:00
|
|
|
"https://github.com/kayabaNerve/pasta_curves",
|
2024-09-06 03:31:45 +00:00
|
|
|
"https://github.com/alloy-rs/core",
|
2022-11-17 02:53:35 +00:00
|
|
|
]
|
