From 436361290538dd01c50562754056f12d2824b288 Mon Sep 17 00:00:00 2001
From: alan <652732310@qq.com>
Date: Fri, 20 Sep 2024 09:44:47 +0800
Subject: [PATCH] make InternalNode.children a const-sized array

---
 encoding.go | 1 -
 tree.go     | 7 ++-----
 2 files changed, 2 insertions(+), 6 deletions(-)

diff --git a/encoding.go b/encoding.go
index d5e27d17..0852e06b 100644
--- a/encoding.go
+++ b/encoding.go
@@ -204,7 +204,6 @@ func CreateInternalNode(bitlist []byte, raw []byte, depth byte) (*InternalNode,
 
 	// Create a HashNode placeholder for all values
 	// corresponding to a set bit.
-	node.children = make([]VerkleNode, NodeWidth)
 	for i, b := range bitlist {
 		for j := 0; j < 8; j++ {
 			if b&mask[j] != 0 {
diff --git a/tree.go b/tree.go
index e3a20f22..b4c948a5 100644
--- a/tree.go
+++ b/tree.go
@@ -176,7 +176,7 @@ type (
 	// Represents an internal node at any level
 	InternalNode struct {
 		// List of child nodes of this internal node.
-		children []VerkleNode
+		children [NodeWidth]VerkleNode
 
 		// node depth in the tree, in bits
 		depth byte
@@ -239,7 +239,6 @@ func (n *InternalNode) ToJSON() ([]byte, error) {
 
 func newInternalNode(depth byte) VerkleNode {
 	node := new(InternalNode)
-	node.children = make([]VerkleNode, NodeWidth)
 	for idx := range node.children {
 		node.children[idx] = Empty(struct{}{})
 	}
@@ -255,7 +254,6 @@ func New() VerkleNode {
 
 func NewStatelessInternal(depth byte, comm *Point) VerkleNode {
 	node := &InternalNode{
-		children:   make([]VerkleNode, NodeWidth),
 		depth:      depth,
 		commitment: comm,
 	}
@@ -334,7 +332,7 @@ func NewLeafNodeWithNoComms(stem Stem, values [][]byte) *LeafNode {
 
 // Children return the children of the node. The returned slice is
 // internal to the tree, so callers *must* consider it readonly.
-func (n *InternalNode) Children() []VerkleNode {
+func (n *InternalNode) Children() [NodeWidth]VerkleNode {
 	return n.children
 }
 
@@ -1073,7 +1071,6 @@ func (n *InternalNode) Serialize() ([]byte, error) {
 
 func (n *InternalNode) Copy() VerkleNode {
 	ret := &InternalNode{
-		children:   make([]VerkleNode, len(n.children)),
 		commitment: new(Point),
 		depth:      n.depth,
 	}