The home for Hyperlane core contracts, sdk packages, and other infrastructure
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
hyperlane-monorepo/solidity/optics-core/contracts/Home.sol

184 lines
5.9 KiB

// SPDX-License-Identifier: MIT OR Apache-2.0
pragma solidity >=0.6.11;
import "./Common.sol";
import "./Merkle.sol";
import "./Queue.sol";
import "../interfaces/SortitionI.sol";
/**
* @title Home
* @author Celo Labs Inc.
* @notice Contract responsible for managing production of the message tree and
* holding custody of the updater bond.
**/
contract Home is MerkleTreeManager, QueueManager, Common {
using QueueLib for QueueLib.Queue;
using MerkleLib for MerkleLib.Tree;
/// @notice Mapping of sequence numbers for each destination
mapping(uint32 => uint32) public sequences;
// TODO: removing sortition?
SortitionI internal sortition;
4 years ago
/**
* @notice Event emitted when new message is enqueued
* @param leafIndex Index of message's leaf in merkle tree
* @param destinationAndSequence Destination and destination-specific
* sequence combined in single field ((destination << 32) & sequence)
* @param leaf Hash of formatted message
* @param message Raw bytes of enqueued message
**/
event Dispatch(
feature: adds untested ProverSync struct to optics-core (#78) * feature: basic ProverSync setup * prog: basic setup for linking enqueuings to roots * refactor: modifies Dispatch event to contain treeSize field and condenses destination and sequence into single field * feature: adds leaf_by_tree_size methods to Home abi and logic for updating local tree in prover_sync * format: runs cargo fmt * prog: comments out unused code from previous design * fix: replaces slip44 references with domain * refactor: moves interval to parameter instead of ProverSync struct field * fix: deletes commented out code from NewLeaf design * refactor: modifies ProverSync error handling to bubble up ProverSyncError type * fix: removes slip44 reference * refactor: adds incremental merkle tree to ProverSync and batch updates prover on successful incremental update * fmt: runs cargo fmt * fix: fixes raw_message_by_sequence filtering after destination and sequence event fields were combined to single field in Home * fix: simplifies error handling, adds retry counter for failed api calls, and clones incremental merkle * fix: renames leaves_by_tree_size to leaves_by_tree_index * fix/docs: fixes Home Dispatch event to use leafIndex instead of treeSize and fixes docs to reflect change * fix: changes num_retries to u32 * refactor: cleans up error handling * docs: adds comment about why leafIndex is count() - 1 * fix: deletes old NewLeaf event from Home * fmt: runs cargo fmt * fix: removes num_retries field * refactor: simplifies destination_and_sequence util * fix: fixes typo in warning message * refactor: derives transparent errors * docs: improves comments for prover-sync/incremental merkle behavior * fix: restarts poll_updates loop if prover root was updated while we were building leaf vector from incremental merkle * feature: adds ProverSync::new function * fix: ProverSync stops polling updates on invalid local_root * fmt: runs cargo fmt
4 years ago
uint256 indexed leafIndex,
uint64 indexed destinationAndSequence,
bytes32 indexed leaf,
bytes message
);
/// @notice Event emitted when improper update detected
event ImproperUpdate();
// solhint-disable-next-line no-empty-blocks
constructor(uint32 _originDomain) payable Common(_originDomain) {}
function initialize(address _sortition) public override {
require(state == States.UNINITIALIZED, "already initialized");
sortition = SortitionI(_sortition);
updater = SortitionI(_sortition).current();
queue.initialize();
state = States.ACTIVE;
}
/// @notice Sets contract state to FAILED and slashes updater
function fail() internal override {
_setFailed();
sortition.slash(msg.sender);
}
/**
* @notice Internal utility function that combines provided `_destination`
* and `_sequence`.
* @dev Both destination and sequence should be < 2^32 - 1
* @param _destination Domain of destination chain
* @param _sequence Current sequence for given destination chain
* @return Returns (`_destination` << 32) & `_sequence`
**/
function destinationAndSequence(uint32 _destination, uint32 _sequence)
internal
pure
returns (uint64)
{
return (uint64(_destination) << 32) | _sequence;
feature: adds untested ProverSync struct to optics-core (#78) * feature: basic ProverSync setup * prog: basic setup for linking enqueuings to roots * refactor: modifies Dispatch event to contain treeSize field and condenses destination and sequence into single field * feature: adds leaf_by_tree_size methods to Home abi and logic for updating local tree in prover_sync * format: runs cargo fmt * prog: comments out unused code from previous design * fix: replaces slip44 references with domain * refactor: moves interval to parameter instead of ProverSync struct field * fix: deletes commented out code from NewLeaf design * refactor: modifies ProverSync error handling to bubble up ProverSyncError type * fix: removes slip44 reference * refactor: adds incremental merkle tree to ProverSync and batch updates prover on successful incremental update * fmt: runs cargo fmt * fix: fixes raw_message_by_sequence filtering after destination and sequence event fields were combined to single field in Home * fix: simplifies error handling, adds retry counter for failed api calls, and clones incremental merkle * fix: renames leaves_by_tree_size to leaves_by_tree_index * fix/docs: fixes Home Dispatch event to use leafIndex instead of treeSize and fixes docs to reflect change * fix: changes num_retries to u32 * refactor: cleans up error handling * docs: adds comment about why leafIndex is count() - 1 * fix: deletes old NewLeaf event from Home * fmt: runs cargo fmt * fix: removes num_retries field * refactor: simplifies destination_and_sequence util * fix: fixes typo in warning message * refactor: derives transparent errors * docs: improves comments for prover-sync/incremental merkle behavior * fix: restarts poll_updates loop if prover root was updated while we were building leaf vector from incremental merkle * feature: adds ProverSync::new function * fix: ProverSync stops polling updates on invalid local_root * fmt: runs cargo fmt
4 years ago
}
/**
* @notice Formats message, adds its leaf into merkle tree, enqueues new
* merkle root, and emits `Dispatch` event with data regarding message.
* @param destination Domain of destination chain
* @param recipient Address or recipient on destination chain
* @param body Raw bytes of message
**/
function enqueue(
uint32 destination,
bytes32 recipient,
bytes memory body
) external notFailed {
uint32 sequence = sequences[destination] + 1;
sequences[destination] = sequence;
bytes memory _message =
Message.formatMessage(
originDomain,
bytes32(uint256(uint160(msg.sender))),
sequence,
destination,
recipient,
body
);
bytes32 _leaf = keccak256(_message);
tree.insert(_leaf);
queue.enqueue(root());
feature: adds untested ProverSync struct to optics-core (#78) * feature: basic ProverSync setup * prog: basic setup for linking enqueuings to roots * refactor: modifies Dispatch event to contain treeSize field and condenses destination and sequence into single field * feature: adds leaf_by_tree_size methods to Home abi and logic for updating local tree in prover_sync * format: runs cargo fmt * prog: comments out unused code from previous design * fix: replaces slip44 references with domain * refactor: moves interval to parameter instead of ProverSync struct field * fix: deletes commented out code from NewLeaf design * refactor: modifies ProverSync error handling to bubble up ProverSyncError type * fix: removes slip44 reference * refactor: adds incremental merkle tree to ProverSync and batch updates prover on successful incremental update * fmt: runs cargo fmt * fix: fixes raw_message_by_sequence filtering after destination and sequence event fields were combined to single field in Home * fix: simplifies error handling, adds retry counter for failed api calls, and clones incremental merkle * fix: renames leaves_by_tree_size to leaves_by_tree_index * fix/docs: fixes Home Dispatch event to use leafIndex instead of treeSize and fixes docs to reflect change * fix: changes num_retries to u32 * refactor: cleans up error handling * docs: adds comment about why leafIndex is count() - 1 * fix: deletes old NewLeaf event from Home * fmt: runs cargo fmt * fix: removes num_retries field * refactor: simplifies destination_and_sequence util * fix: fixes typo in warning message * refactor: derives transparent errors * docs: improves comments for prover-sync/incremental merkle behavior * fix: restarts poll_updates loop if prover root was updated while we were building leaf vector from incremental merkle * feature: adds ProverSync::new function * fix: ProverSync stops polling updates on invalid local_root * fmt: runs cargo fmt
4 years ago
// leafIndex is count() - 1 since new leaf has already been inserted
emit Dispatch(
count() - 1,
destinationAndSequence(destination, sequence),
_leaf,
_message
);
}
/**
* @notice Called by updater. Updates home's `current` root from `_oldRoot`
* to `_newRoot` and emits `Update` event. If fraudulent update
* detected in `improperUpdate`, updater is slashed and home is
* failed.
* @param _oldRoot Old merkle root (should equal home's current root)
* @param _newRoot New merkle root
* @param _signature Updater's signature on `_oldRoot` and `_newRoot`
**/
function update(
bytes32 _oldRoot,
bytes32 _newRoot,
bytes memory _signature
) external notFailed {
if (improperUpdate(_oldRoot, _newRoot, _signature)) return;
while (true) {
bytes32 next = queue.dequeue();
if (next == _newRoot) break;
}
current = _newRoot;
emit Update(originDomain, _oldRoot, _newRoot, _signature);
}
/**
* @notice Checks that `_newRoot` in update currently exists in queue. If
* `_newRoot` doesn't exist in queue, update is fraudulent, causing
* updater to be slashed and home to be failed.
* @dev Reverts (and doesn't slash updater) if signature is invalid or
* update not current
* @param _oldRoot Old merkle tree root (should equal home's current root)
* @param _newRoot New merkle tree root
* @param _signature Updater's signature on `_oldRoot` and `_newRoot`
* @return Returns true if update was fraudulent
**/
function improperUpdate(
bytes32 _oldRoot,
bytes32 _newRoot,
bytes memory _signature
) public notFailed returns (bool) {
require(Common.checkSig(_oldRoot, _newRoot, _signature), "bad sig");
require(_oldRoot == current, "not a current update");
if (!queue.contains(_newRoot)) {
fail();
emit ImproperUpdate();
return true;
}
return false;
}
/**
* @notice Suggests an update to caller. If queue is non-empty, returns the
* home's current root as `_current` and the queue's latest root as
* `_new`. Null bytes returned if queue is empty.
* @return _current Current root
* @return _new New root
**/
function suggestUpdate()
external
view
returns (bytes32 _current, bytes32 _new)
{
if (queue.length() != 0) {
_current = current;
_new = queue.lastItem();
}
}
}