Michael Sproul ceeab02e3a Lazy hashing for SignedBeaconBlock in sync (#2916) ... ## Proposed Changes Allocate less memory in sync by hashing the `SignedBeaconBlock`s in a batch directly, rather than going via SSZ bytes. Credit to @paulhauner for finding this source of temporary allocations.		2022-01-14 07:20:54 +00:00
..
cached_tree_hash	1.57.0 lints (#2850)	2021-12-03 04:44:30 +00:00
fork_choice	Update to superstruct v0.4.1 (#2886)	2022-01-06 03:14:58 +00:00
int_to_bytes	Update to tokio 1.1 (#2172)	2021-02-10 23:29:49 +00:00
merkle_proof	Get arbitrary check passing (2.0) (#2710)	2021-10-14 02:58:11 +00:00
proto_array	v1.1.6 Fork Choice changes (#2822)	2021-12-13 20:43:22 +00:00
safe_arith	Remove saturating arith from state_processing (#1644)	2020-09-25 05:18:21 +00:00
serde_utils	Kintsugi review comments (#2831)	2021-12-02 14:29:59 +11:00
ssz	1.57.0 lints (#2850)	2021-12-03 04:44:30 +00:00
ssz_derive	Implement SSZ union type (#2579)	2021-09-25 05:58:36 +00:00
ssz_types	Lazy hashing for SignedBeaconBlock in sync (#2916)	2022-01-14 07:20:54 +00:00
state_processing	Update to superstruct v0.4.1 (#2886)	2022-01-06 03:14:58 +00:00
swap_or_not_shuffle	Get arbitrary check passing (2.0) (#2710)	2021-10-14 02:58:11 +00:00
tree_hash	Bump crate versions (#2829)	2021-12-02 14:29:57 +11:00
tree_hash_derive	Implement SSZ union type (#2579)	2021-09-25 05:58:36 +00:00
types	Lazy hashing for SignedBeaconBlock in sync (#2916)	2022-01-14 07:20:54 +00:00