mirror of
https://github.com/status-im/dagger-contracts.git
synced 2025-01-09 13:55:57 +00:00
33010bd20c
* feat(slot-reservations): Allow slots to be reserved Closes #175. Allows reservation of slots, without an implementation of the expanding window. - Add a function called `reserveSlot(address, SlotId)`, that allows three unique addresses per slot to be reserved, that returns bool if successful. - Use `mapping(SlotId => EnumerableSet.AddressSet)` - Return false if the address could not be added to the set (if `EnumerableSet.add` returns false) - Add `canReserveSlot(address, SlotId)` - Return `true` if set of reservations is less than 3 and the set doesn't already contain the address - Return `true` otherwise (for now, later add in logic for checking the address is inside the expanding window) - Call `canReserveSlot` from `reserveSlot` as a `require` or invariant - Add `SlotReservations` configuration struct to the network-level config, with `maxReservations`
38 lines
1.5 KiB
Solidity
38 lines
1.5 KiB
Solidity
// SPDX-License-Identifier: MIT
|
|
pragma solidity 0.8.23;
|
|
|
|
import "@openzeppelin/contracts/token/ERC20/IERC20.sol";
|
|
|
|
struct MarketplaceConfig {
|
|
CollateralConfig collateral;
|
|
ProofConfig proofs;
|
|
SlotReservationsConfig reservations;
|
|
}
|
|
|
|
struct CollateralConfig {
|
|
/// @dev percentage of remaining collateral slot after it has been freed
|
|
/// (equivalent to `collateral - (collateral*maxNumberOfSlashes*slashPercentage)/100`)
|
|
/// TODO: to be aligned more closely with actual cost of repair once bandwidth incentives are known,
|
|
/// see https://github.com/codex-storage/codex-contracts-eth/pull/47#issuecomment-1465511949.
|
|
uint8 repairRewardPercentage;
|
|
uint8 maxNumberOfSlashes; // frees slot when the number of slashing reaches this value
|
|
uint16 slashCriterion; // amount of proofs missed that lead to slashing
|
|
uint8 slashPercentage; // percentage of the collateral that is slashed
|
|
}
|
|
|
|
struct ProofConfig {
|
|
uint256 period; // proofs requirements are calculated per period (in seconds)
|
|
uint256 timeout; // mark proofs as missing before the timeout (in seconds)
|
|
uint8 downtime; // ignore this much recent blocks for proof requirements
|
|
string zkeyHash; // hash of the zkey file which is linked to the verifier
|
|
// Ensures the pointer does not remain in downtime for many consecutive
|
|
// periods. For each period increase, move the pointer `pointerProduct`
|
|
// blocks. Should be a prime number to ensure there are no cycles.
|
|
uint8 downtimeProduct;
|
|
}
|
|
|
|
struct SlotReservationsConfig {
|
|
// Number of allowed reservations per slot
|
|
uint8 maxReservations;
|
|
}
|