mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2024-12-25 12:57:18 +00:00
81c53c26fb
* Update seed domains (#3872) * Remove Transfers (#3870) * Remove active index roots and compact committee roots (#3869) * Update inclusion reward (#3886) * Alter proposer selection logic (#3884) * Fix early committee bias (#3888) * Remove shards and committees (#3896) * Epoch spec tests v0.9 (#3907) * Block spec test v0.9 (#3905) * rm'ed in protobuf * build proto * build proto * build proto * fix core package * Gazelle * Fixed all the tests * Fixed static test * Comment out spec test for now * One more skip * fix-roundRobinSync (#3862) * Starting but need new seed function * Revert initial sync * Updated Proposer Slashing * Fixed all tests * Lint * Update inclusion reward * Fill randao mixes with eth1 data hash * Test * Fixing test part1 * All tests passing * One last test * Updated config * Build proto * Proper skip message * Conflict and fmt * Removed crosslinks and shards. Built * Format and gazelle * Fixed all the block package tests * Fixed all the helper tests * All epoch package tests pass * All core package tests pass * Fixed operation tests * Started fixing rpc test * RPC tests passed! * Fixed all init sync tests * All tests pass * Fixed blockchain tests * Lint * Lint * Preston's feedback * Starting * Remove container * Fixed block spec tests * All passing except for block_processing test * Failing block processing test * Starting * Add AggregateAndProof * All mainnet test passes * Update deposit contract (#3906) * Proto spec tests v0.9 (#3908) * Starting * Add AggregateAndProof * Unskip block util tests (#3910) * rm'ed in protobuf * build proto * build proto * build proto * fix core package * Gazelle * Fixed all the tests * Fixed static test * Comment out spec test for now * One more skip * fix-roundRobinSync (#3862) * Starting but need new seed function * Revert initial sync * Updated Proposer Slashing * Fixed all tests * Lint * Update inclusion reward * Fill randao mixes with eth1 data hash * Test * Fixing test part1 * All tests passing * One last test * Updated config * Build proto * Proper skip message * Conflict and fmt * Removed crosslinks and shards. Built * Format and gazelle * Fixed all the block package tests * Fixed all the helper tests * All epoch package tests pass * All core package tests pass * Fixed operation tests * Started fixing rpc test * RPC tests passed! * Fixed all init sync tests * All tests pass * Fixed blockchain tests * Lint * Lint * Preston's feedback * Starting * Remove container * Fixed block spec tests * All passing except for block_processing test * Failing block processing test * Starting * Add AggregateAndProof * All mainnet test passes * Unskip block util tests * Slot processing spec test V0.9 (#3912) * Starting * Add AggregateAndProof * Unskip slot processing mainnet test * Unskip minimal spec test for finalization (#3920) * Remove outdated interop tests (#3922) * Rm outdated interop tests * Rm test runner * Gazelle * Update validator to use proposer slot (#3919) * Fix committee assignment (#3931) * Replace shard with committee index (#3930) * Conflict * Clean up (#3933) * Remove shard filter in db (#3936) * Remove lightouse compatibility test (#3939) * Update Committee Cache for v0.9 (#3948) * Updated committee cache * Removed shuffled indices cache * Started testing run time * Lint * Fixed test * Safeguard against nil head state * address edge case * add test * Fixed TestRoundRobinSync by doubling the epochs * Unskip TestProtoCompatability (#3958) * Unskip TestProtoCompatability * Update WORKSPACE * Fix minimal config (#3959) * fix minimal configs * fix hardcoded value in test * Simplify verify att time (#3961) * update readme for deposit contract, regen bindings for vyper 0.1.0b12 (#3963) * update readme for deposit contract, regen bindings * medium * Check nil base state (#3964) * Copy Block When Receiving it From Sync (#3966) * copy block * clone for other service methods too * Change logging of Bitfield (#3956) * change logging of bits * preston's review * Unskip Beacon Server Test (#3962) * run test till the end * fix up proto message types * fmt * resolve broken tests * better error handling * fixing new logic to use archived proposer info * fix up logic * clip using the max effective balance * broken build fix with num arg mismatch * amend archive * archival logic changed * rename test * archive both proposer and attester seeds * page size 100 * further experiments * further experimentation, archivedProposerIndex seems wrong * test passes * rem log * fix broken test * fix test * gaz * fix imports * ethapis
118 lines
4.5 KiB
Python
118 lines
4.5 KiB
Python
# Vyper target 0.1.0b12
|
|
MIN_DEPOSIT_AMOUNT: constant(uint256) = 1000000000 # Gwei
|
|
DEPOSIT_CONTRACT_TREE_DEPTH: constant(uint256) = 32
|
|
MAX_DEPOSIT_COUNT: constant(uint256) = 4294967295 # 2**DEPOSIT_CONTRACT_TREE_DEPTH - 1
|
|
PUBKEY_LENGTH: constant(uint256) = 48 # bytes
|
|
WITHDRAWAL_CREDENTIALS_LENGTH: constant(uint256) = 32 # bytes
|
|
SIGNATURE_LENGTH: constant(uint256) = 96 # bytes
|
|
AMOUNT_LENGTH: constant(uint256) = 8 # bytes
|
|
|
|
DepositEvent: event({
|
|
pubkey: bytes[48],
|
|
withdrawal_credentials: bytes[32],
|
|
amount: bytes[8],
|
|
signature: bytes[96],
|
|
index: bytes[8],
|
|
})
|
|
|
|
branch: bytes32[DEPOSIT_CONTRACT_TREE_DEPTH]
|
|
deposit_count: uint256
|
|
drain_address: public(address)
|
|
|
|
# Compute hashes in empty sparse Merkle tree
|
|
zero_hashes: bytes32[DEPOSIT_CONTRACT_TREE_DEPTH]
|
|
@public
|
|
def __init__(_drain_address: address):
|
|
self.drain_address = _drain_address
|
|
for i in range(DEPOSIT_CONTRACT_TREE_DEPTH - 1):
|
|
self.zero_hashes[i + 1] = sha256(concat(self.zero_hashes[i], self.zero_hashes[i]))
|
|
|
|
@private
|
|
@constant
|
|
def to_little_endian_64(value: uint256) -> bytes[8]:
|
|
# Reversing bytes using bitwise uint256 manipulations
|
|
# Note: array accesses of bytes[] are not currently supported in Vyper
|
|
# Note: this function is only called when `value < 2**64`
|
|
y: uint256 = 0
|
|
x: uint256 = value
|
|
for _ in range(8):
|
|
y = shift(y, 8)
|
|
y = y + bitwise_and(x, 255)
|
|
x = shift(x, -8)
|
|
return slice(convert(y, bytes32), start=24, len=8)
|
|
|
|
|
|
@public
|
|
@constant
|
|
def get_deposit_root() -> bytes32:
|
|
zero_bytes32: bytes32 = 0x0000000000000000000000000000000000000000000000000000000000000000
|
|
node: bytes32 = zero_bytes32
|
|
size: uint256 = self.deposit_count
|
|
for height in range(DEPOSIT_CONTRACT_TREE_DEPTH):
|
|
if bitwise_and(size, 1) == 1: # More gas efficient than `size % 2 == 1`
|
|
node = sha256(concat(self.branch[height], node))
|
|
else:
|
|
node = sha256(concat(node, self.zero_hashes[height]))
|
|
size /= 2
|
|
return sha256(concat(node, self.to_little_endian_64(self.deposit_count), slice(zero_bytes32, start=0, len=24)))
|
|
|
|
|
|
@public
|
|
@constant
|
|
def get_deposit_count() -> bytes[8]:
|
|
return self.to_little_endian_64(self.deposit_count)
|
|
|
|
|
|
@payable
|
|
@public
|
|
def deposit(pubkey: bytes[PUBKEY_LENGTH],
|
|
withdrawal_credentials: bytes[WITHDRAWAL_CREDENTIALS_LENGTH],
|
|
signature: bytes[SIGNATURE_LENGTH],
|
|
deposit_data_root: bytes32):
|
|
# Avoid overflowing the Merkle tree (and prevent edge case in computing `self.branch`)
|
|
assert self.deposit_count < MAX_DEPOSIT_COUNT
|
|
|
|
# Check deposit amount
|
|
deposit_amount: uint256 = msg.value / as_wei_value(1, "gwei")
|
|
assert deposit_amount >= MIN_DEPOSIT_AMOUNT
|
|
|
|
# Length checks to facilitate formal verification (see https://github.com/ethereum/eth2.0-specs/pull/1362/files#r320361859)
|
|
assert len(pubkey) == PUBKEY_LENGTH
|
|
assert len(withdrawal_credentials) == WITHDRAWAL_CREDENTIALS_LENGTH
|
|
assert len(signature) == SIGNATURE_LENGTH
|
|
|
|
# Emit `DepositEvent` log
|
|
amount: bytes[8] = self.to_little_endian_64(deposit_amount)
|
|
log.DepositEvent(pubkey, withdrawal_credentials, amount, signature, self.to_little_endian_64(self.deposit_count))
|
|
|
|
# Compute deposit data root (`DepositData` hash tree root)
|
|
zero_bytes32: bytes32 = 0x0000000000000000000000000000000000000000000000000000000000000000
|
|
pubkey_root: bytes32 = sha256(concat(pubkey, slice(zero_bytes32, start=0, len=64 - PUBKEY_LENGTH)))
|
|
signature_root: bytes32 = sha256(concat(
|
|
sha256(slice(signature, start=0, len=64)),
|
|
sha256(concat(slice(signature, start=64, len=SIGNATURE_LENGTH - 64), zero_bytes32)),
|
|
))
|
|
node: bytes32 = sha256(concat(
|
|
sha256(concat(pubkey_root, withdrawal_credentials)),
|
|
sha256(concat(amount, slice(zero_bytes32, start=0, len=32 - AMOUNT_LENGTH), signature_root)),
|
|
))
|
|
# Verify computed and expected deposit data roots match
|
|
assert node == deposit_data_root
|
|
|
|
# Add deposit data root to Merkle tree (update a single `branch` node)
|
|
self.deposit_count += 1
|
|
size: uint256 = self.deposit_count
|
|
for height in range(DEPOSIT_CONTRACT_TREE_DEPTH):
|
|
if bitwise_and(size, 1) == 1: # More gas efficient than `size % 2 == 1`
|
|
self.branch[height] = node
|
|
break
|
|
node = sha256(concat(self.branch[height], node))
|
|
size /= 2
|
|
|
|
# !!! DEBUG ONLY !!!
|
|
# This method is NOT part of the final ETH2.0 deposit contract, but we use it
|
|
# to recover test funds.
|
|
@public
|
|
def drain():
|
|
send(self.drain_address, self.balance)
|