-
Notifications
You must be signed in to change notification settings - Fork 997
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Custody game checklist #864
Comments
I don't agree with this. I feel like the shard block data size is a more "fundamental" constant; it's closer to what users care about. The fact that there's a 2x overhead is more of a protocol-specific detail.
Also don't think there's value to this. We still have to reveal each of the individual subkeys and verify them individually so there are no real savings. Already started on some of the others (see open PRs). |
10 and 12 in the TODO seem outdated? |
May be worth starting a new checklist and closing this one :) |
TODO
remove()
andappend()
.MAX_CUSTODY_KEY_REVEALS
andEPOCHS_PER_CUSTODY_PERIOD
to deal with worst-case key reveal bandwidth.MAX_CUSTODY_CHUNK_CHALLENGES
andMAX_CUSTODY_MIX_CHALLENGES
.responder.withdrawable_epoch = FAR_FUTURE_EPOCH
.max_reveal_lateness
: Find cleaner alternative.BYTES_PER_SHARD_BLOCK
: Replace byBYTES_PER_SHARD_BLOCK = 2 * BYTES_PER_SHARD_BLOCK_BODY
.BYTES_PER_CUSTODY_CHUNK
: There are pros and cons to increasing/decreasing.MIN_ACTIVATION_EXIT_DELAY
for chunk responses. (To avoid proposers responding to their own challenges.)Ideas to consider
Batched reveals: Batch reveals in case of lateness.chunk_bits
: Consider storing a Merkle root ofchunk_bits
intead ofchunk_bits
directly.The text was updated successfully, but these errors were encountered: