Merge pull request #204 from burnburn/references

Add References section
This commit is contained in:
Danny Ryan 2018-11-30 12:54:17 -06:00 committed by GitHub
commit 1757c2ad26
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 11 additions and 0 deletions

View File

@ -56,6 +56,9 @@
* [Finally...](#finally) * [Finally...](#finally)
* [Appendix](#appendix) * [Appendix](#appendix)
* [Appendix A - Hash function](#appendix-a---hash-function) * [Appendix A - Hash function](#appendix-a---hash-function)
* [References](#references)
* [Normative](#normative)
* [Informative](#informative)
* [Copyright](#copyright) * [Copyright](#copyright)
## Introduction ## Introduction
@ -1463,5 +1466,13 @@ while len(state.persistent_committee_reassignments) > 0 and state.persistent_com
We aim to have a STARK-friendly hash function `hash(x)` for the production launch of the beacon chain. While the standardisation process for a STARK-friendly hash function takes place—led by STARKware, who will produce a detailed report with recommendations—we use `BLAKE2b-512` as a placeholder. Specifically, we set `hash(x) := BLAKE2b-512(x)[0:32]` where the `BLAKE2b-512` algorithm is defined in [RFC 7693](https://tools.ietf.org/html/rfc7693) and the input `x` is of type `bytes`. We aim to have a STARK-friendly hash function `hash(x)` for the production launch of the beacon chain. While the standardisation process for a STARK-friendly hash function takes place—led by STARKware, who will produce a detailed report with recommendations—we use `BLAKE2b-512` as a placeholder. Specifically, we set `hash(x) := BLAKE2b-512(x)[0:32]` where the `BLAKE2b-512` algorithm is defined in [RFC 7693](https://tools.ietf.org/html/rfc7693) and the input `x` is of type `bytes`.
# References
This section is divided into Normative and Informative references. Normative references are those that must be read in order to implement this specification, while Informative references are merely that, information. An example of the former might be the details of a required consensus algorithm, and an example of the latter might be a pointer to research that demonstrates why a particular consensus algorithm might be better suited for inclusion in the standard than another.
## Normative
## Informative
# Copyright # Copyright
Copyright and related rights waived via [CC0](https://creativecommons.org/publicdomain/zero/1.0/). Copyright and related rights waived via [CC0](https://creativecommons.org/publicdomain/zero/1.0/).