Skip to content
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

Weekly release of dev into master #683

Merged
merged 62 commits into from
Feb 25, 2019
Merged

Weekly release of dev into master #683

merged 62 commits into from
Feb 25, 2019

Conversation

djrtwo
Copy link
Contributor

@djrtwo djrtwo commented Feb 25, 2019

Detailed changelog coming in release notes.

JustinDrake and others added 30 commits February 15, 2019 00:23
There is an implicit assert in `int_to_bytes4`, however I think it's rather hidden.
Ensures it does not try to shuffle out of range of the `active_validator_indices` list.
docs: fix typo in 0_beacon-chain.md
If this is accepted, then we can replace all uses of signing in the protocol, which are currently done in a relatively inconsistent way (see proposer signatures, attester signatures, shard proposer signatures, exit message signatures.....) could be unified.
This function is used to get the merkle root of some block roots which are themselves hashes, so the leaves do not need to be rehashed.
Unfortunately, it's easy to assume that a merkle_root function would hash its leaves, so it should be clarified.
Add explicit assert to get_permutated_index
Fix out-of-bounds in `get_shuffling`
* Updated phase 1: branch challenges

* Removed unnecessary line

* Added early subkey reveal slashing

* Revealing during the active period is still revealing early

* Added....

* Machinery for publishing old subkeys
* Inability to withdraw until you published all subkeys
* After a validator exits the queue there's still a minimum 1-day delay before they can withdraw (in the future this delay will be used as an opportunity to start a PoC challenge game)

* Update 1_shard-data-chains.md

* formatting

* minor edits

* Added masking scheme for reveals

Secure under the aggregate extraction infeasibility assumption described on pages 11-12 of https://crypto.stanford.edu/~dabo/pubs/papers/aggreg.pdf

* Added rewards going to challengers

* Add ToC and reorg the constant tables

* Remove tags

* fix constant formatting

* normalize domain constants in phase 1

* Update 1_shard-data-chains.md

* Update 1_shard-data-chains.md

* Update 1_shard-data-chains.md

* Added transition logic

* Fix ToC

* Fix ToC

* Adjusted for #615

* Added more helpers

* epoch -> slot

* fix some type hints

* clean up `get_attestation_merkle_depth`
* updated SSZ implementation list

Signed-off-by: sigmoid <alphabet@hotmail.co.kr>

* Update specs/simple-serialize.md

Co-Authored-By: NAKsir-melody <alphabet@hotmail.co.kr>
* Address the slot/epoch underflow problem, even for Java implementers! 🎉
* Squash a bug with `get_previous_epoch`
* Fix #642
* Address #626 (Vitalik, Danny, myself agree that avoiding signed integers is probably best)
Cuts validator record size from 120 to 106 bytes, and arguably is a simplification
@JustinDrake
Copy link
Collaborator

This still has the botched "[TODO: add logic to ensure that deposits from 1.0 chain are processed in order]"

@djrtwo
Copy link
Contributor Author

djrtwo commented Feb 25, 2019

Made a separate PR for removing the todo @JustinDrake

@djrtwo djrtwo merged commit bed8888 into master Feb 25, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet