{"p":"can-20","op":"mint","tick":"can","amt":"1000","rows":[{"df":"qa","content":[{"q":"How does the MultiversX protocol solve the bootstrapping cost issue of new nodes by utilizing an effective pruning algorithm?","a":"Pruning Algorithm: After receiving the registration request, neighboring nodes can use the pruning algorithm to determine whether to add the new node to their local neighbor node list. The pruning algorithm is based on node distance  and probability thresholds, thereby reducing unnecessary message transmission."}]}],"pr":"b3fac28883db82a38660da4bcc31d7646e994d411c82cb1f08f19058f08e5cf9"}