MDEX_TREE_HASH(3)

💖 MDEX_TREE_HASH 💖

okay bestie, gather round, we're doing a Librecast Programmer's Manual moment — this is mdex_tree_hash(3), and it's giving "let me get a hash of your merkle tree root real quick" energy. 🎀

✨ NAME ✨

mdex_tree_hash — create hash of merkle tree root 🌳

📚 LIBRARY 📚

Librecast library (liblibrecast, -llibrecast)

🦋 SYNOPSIS 🦋

#include <librecast/mdex.h>

int mdex_tree_hash(unsigned char *hash, size_t hashlen, mtree_t *mtree, size_t n);

Compile and link with -llibrecast.

🌸 DESCRIPTION 🌸

so like, the mdex_tree_hash function literally creates a hash of length hashlen from the root node of mtree with key n. 💅

and bestie, what's it for? two things, no cap:

• it's used to index an mtree in several parts 🔥
• and it distinguishes the root node from the first data node when nodes = 1 👑

that's it. that's the vibe. simple, iconic, does exactly what it says. ✨

🫶 RETURN VALUE 🫶

• success — mdex_tree_hash() returns zero. slay. 💚
• error — -1 is returned. 😭

👀 SEE ALSO 👀

• hash_generic_key(3)
• mdex_init(3)
• mdex_free(3)
• mdex_get(3)
• mdex_put(3)
• mdex_del(3)
• lc_share(3)

k that's the whole page, bestie 💜 this was LIBRECAST, dated 2023-07-23, and it's the MDEX_TREE_HASH(3) era — go forth and hash those merkle roots, ily, mwah 🧚💖