MTREE_VERIFY(3)

💅 MTREE_VERIFY — bestie's guide to validating a merkle tree

okay so picture this: you're in the Librecast ecosystem, you got a merkle tree, and you need to know if it's actually valid or if it's lying to you. that's literally what mtree_verify is for. iconic behavior fr fr.

🌸 LIBRARY 🌸

it lives in the Librecast library — that's liblibrecast, and you link it with -llibrecast. yes bestie, the flag has a double-l. it's giving lib + librecast. just trust. 🫶

✨ SYNOPSIS ✨

#include <librecast/mtree.h>

int mtree_verify(mtree_t *tree);

and when you build, you compile and link with -llibrecast. don't forget that part or the compiler will simply not know her. 😭

🦋 DESCRIPTION 🦋

so mtree_verify takes your tree and re-hashes the nodes from the base all the way up to the root. like, bottom-to-top, no skips, no shortcuts.

if everything checks out and the tree is valid, she returns zero. that's it. that's the whole vibe. 🎀

the way that a merkle tree works is every node's hash depends on the ones below it, so re-hashing from the base upward is the whole verification moment. if any node got messed with, the hashes stop matching and you find out. main character energy, honestly. ✨

👑 RETURN VALUE 👑

• zero — the tree is valid, slay, everything is fine, go touch grass 💖
• -1 — the tree is not valid. something's off. not great, bestie. 💀

🌈 ERRORS 🌈

None.

literally none. no errno drama, no surprise failures hiding in the docs. she returns zero or -1 and that's the entire story. periodt. 💅

🍓 SEE ALSO 🍓

• mtree_init(3)
• mtree_free(3)
• q_init(3)
• q_pool_create(3)
• q_job_seek(3)

go read those too, iykyk. 📚✨

and that's the whole page, bestie 💜 this one's from the LIBRECAST manual, dated 2023-06-20. go verify a tree, you got this. 🧚‍♀️🌸