Michael Sproul 84e6d71950 Tree hash caching and optimisations for Altair (#2459) ... ## Proposed Changes Remove the remaining Altair `FIXME`s from consensus land. 1. Implement tree hash caching for the participation lists. This required some light type manipulation, including removing the `TreeHash` bound from `CachedTreeHash` which was purely descriptive. 2. Plumb the proposer index through Altair attestation processing, to avoid calculating it for _every_ attestation (potentially 128ms on large networks). This duplicates some work from #2431, but with the aim of getting it in sooner, particularly for the Altair devnets. 3. Removes two FIXMEs related to `superstruct` and cloning, which are unlikely to be particularly detrimental and will be tracked here instead: https://github.com/sigp/superstruct/issues/5		2021-07-23 00:23:53 +00:00
..
attester_duties.rs	Allow for a clock disparity on the duties endpoints (#2283)	2021-03-29 23:42:35 +00:00
block_id.rs	Use the forwards iterator more often (#2376)	2021-05-31 04:18:20 +00:00
lib.rs	Tree hash caching and optimisations for Altair (#2459)	2021-07-23 00:23:53 +00:00
metrics.rs	Use advanced state for block production (#2241)	2021-03-04 04:43:31 +00:00
proposer_duties.rs	Altair consensus changes and refactors (#2279)	2021-07-09 06:15:32 +00:00
state_id.rs	Altair consensus changes and refactors (#2279)	2021-07-09 06:15:32 +00:00
validator_inclusion.rs	Altair consensus changes and refactors (#2279)	2021-07-09 06:15:32 +00:00