Skip to content

Tracking: Parallel Sparse Trie Optimisations #19058

@yongkangc

Description

@yongkangc

Motivation

Parallel sparse trie (PST) still underperforms the serial trie path on large blocks. State-root task execution spends a large fraction of time coordinating subtrie shards, sending data back and forth through channels, and processing redundant proof updates produced by the prewarming/multiproof pipeline.

Impact

  • Speeding up PST for large blocks
  • Reduces redundant proof work feeding PST.
  • Lowers peak CPU and memory usage during state-root calculation by removing per-update spawns and channel churn.

Sub-issues

Metadata

Metadata

Assignees

Labels

A-trieRelated to Merkle Patricia Trie implementationC-perfA change motivated by improving speed, memory usage or disk footprintS-needs-benchmarkThis set of changes needs performance benchmarking to double-check that they help

Type

No type

Projects

Status

In Progress

Milestone

No milestone

Relationships

None yet

Development

No branches or pull requests

Issue actions