Merkle Proofs
Picoin uses Merkle trees to efficiently verify finite computation segments.
Each computed segment generates:
leaves containing computed values;
a Merkle root;
sample proofs.
Validators can verify that revealed samples belong to the original committed result without requiring access to the entire segment.
This significantly reduces verification overhead.
Last updated
