tag:blogger.com,1999:blog-642244788469558745.post5148102814763224022..comments2023-11-29T10:20:51.590+02:00Comments on Garden Path Trajectory: A Hands-On Tutorial for Zero-Knowledge Proofs: Part IIShir Peledhttp://www.blogger.com/profile/09979031232145173473noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-642244788469558745.post-7818117211055641712019-05-27T09:09:41.393+03:002019-05-27T09:09:41.393+03:00You're not wrong. It's a matter of conveni...You're not wrong. It's a matter of convenience. In the way I wrote it here, the caller of the function is free to ignore the inner implementation of the commitment scheme (the fact that it is a Merkle tree).<br />The same function could have been written without the data_size argument, which will then mean that the caller has to specify the id of the leaf within the tree, which means the caller has to be concerned with the internal implementation, which is slightly less convenient in this case.Shir Peledhttps://www.blogger.com/profile/09979031232145173473noreply@blogger.comtag:blogger.com,1999:blog-642244788469558745.post-71507113320129930702019-05-09T04:45:49.458+03:002019-05-09T04:45:49.458+03:00I'm probably wrong, but it appears to me that ...I'm probably wrong, but it appears to me that it's possible to manage without the data_size parameter in verify_merkle_pathmaxinthttps://www.blogger.com/profile/15280471854998182572noreply@blogger.com