use a pool for polynomial allocations

[gballet]

In the new version of LeafNodes, an array of values needs to be allocated each time a new last-level node is created.

values:     make([][]byte, n.treeConfig.nodeWidth),

In the case of InsertOrdered, a performance gain could be realized by reusing a pool of nodes. This also works for children in InternalNode.

[muddlebee]

@gballet hello 👋 I am participating in Ethereum's Core Developer Apprenticeship Program which runs through February 2022.

wanted to pick this issue and work on understanding the go-implementation of verkle trees. Do you have any specific timeline for this issue? So I can pick it up and work accordingly? If this is fine by you?

[muddlebee]

So according to my proposal for Developer Apprenticeship Program I wanted to pick a few issues from the go-verkle implementation and make an attempt to fix it by understanding the code. I believe go-verkle will soon be merged into the go-ethereum codebase. Any specific timelines?

So that I can make an attempt to contribute something meaningful to this project.

[gballet]

Sure, you can pick this issue if you want.

[gballet]

no longer needed, closing