Giulio rebuffo 4e83ef0ef5 Optimized beacon state retrieval (#8963) ... * Reconstruct previous epoch without looking at DB: no hindrance to performance -> removed 15GB * Store inactivity scores and slashings in MDBX and do not store diffs for them(they are tiny 700/400 bytes) * Reduced dumps from every 2048 to 1024 -> Added 5 GB (maybe we should down it to 768) * Parallel processing of shuffled sets, 2x performance boost in reading participation. * Store balances diffs in a Btree diff matter, see: https://github.com/ledgerwatch/erigon-documents/blob/master/caplin/design/data-model.md#uint64listuint64vector		2023-12-13 15:23:27 +01:00
..
statechange	Caplin: Parallel historical states reconstruction (#8817)	2023-12-06 10:48:36 +01:00
block_processing_test.go	Better caplin logging and logic (#7992)	2023-08-10 22:34:58 +02:00
impl.go	[caplin] abstract transition (#7661)	2023-06-11 23:50:02 +02:00
operations.go	Optimized beacon state retrieval (#8963)	2023-12-13 15:23:27 +01:00
utils.go	Adds flags to enable/disable backfilling and enable full historical beacon node (#8813)	2023-11-22 13:24:35 +01:00
validation.go	Caplin: Parallel historical states reconstruction (#8817)	2023-12-06 10:48:36 +01:00