twoeths

Archive state optimization

2

### Problem description Right now we archive state using `BeaconState.serialize()` which is not optimized, see https://github.com/ChainSafe/lodestar/blob/unstable/packages/state-transition/test/perf/util/serializeState.test.ts#L20 ### Solution description - always serialize state using `state.serializeToBytes()` api - use preallocated buffer...

fix: avoid ssz toHexString

2

**Motivation** since switching to `toRootHex()` it reduced `gc` time a lot (from ~2.9% to

feat: separate lodestar utils to node and browser

2

**Motivation** - for `@lodestar/utils` we want to have specific apis for browser. In the future we can also enhance to have switchable implementation https://github.com/ChainSafe/ssz/issues/283 - right now we have `toHex()`...

feat: cache pubkeys using base64

4

**Motivation** - Less memory allocation similar to #7016 **Description** - Use a single Buffer for toMemoryEfficientHexStr() function - switch to store pubkey as `base64` instead of `hex`, this saves ~70MB...

ethpanda images vs lodestar images

2

### Describe the bug Investigate why ethpanda images are usually have lower gc than lodestar images with the same commit, on the mainnet node: - ethpanda image (https://hub.docker.com/r/ethpandaops/lodestar/tags) - while...

v1.21.0-rc.0: unstable peers

6

### Describe the bug Peer count is unstable on the beta mainnet node, I used to see it dropped to 35 while inbound peer is 0 or 1 it's likely...

feat: snapshot apis for EIP-4881

1

**Motivation** Implement snapshot apis for eip-4881 **Description** - persistent-merkle-tree: implement toSnapshot/fromSnapshot apis - ssz: - define new `PartialListCompositeType` type along with ViewDU (and no View since we lacks a lot...

**Motivation** Reduce `prepareNextEpoch` time for lodestar **Description** - use hashtree for batch hash implemented in ssz - copy the implementation of ListValidatorTreeViewDU from the ssz branch, the main thing is...

Merge forkchoice getAllAncestorNodes and getAllNonAncestorNodes

1

### Describe the bug This is from `archiveBlocks.ts`, it involves both `getAllAncestorNodes` and `getAllNonAncestorNodes` api, each has to do its own forkchoice loop which is not efficient ```typescript const finalizedCanonicalBlocks...

forkchoice: only store descendant of finalized node

1

@tuyennhv please research the following: - when changing finalized create a new nodes vector that includes only descendant of finalized - keep a mapping of the node index changes and...