roughtime-protocol.merkle — com.sturdystats/roughtime-protocol 0.1.1

build-all clj

(build-all leaves {:keys [hash-size tree-order] :as opts})

Constructs the tree once and returns a map containing the root and a vector of paths for all leaves.

build-path clj

(build-path leaves index {:keys [hash-size tree-order] :as opts})

Builds the PATH bytes for leaf at index.

compute-root clj

(compute-root leaves {:keys [hash-size tree-order] :as opts})

Computes the root of a tree given a list of leaf data byte arrays.

hash-leaf clj

(hash-leaf hash-size data)

H(0x00 || data)

hash-node clj

(hash-node hash-size left right)

H(0x01 || left || right)

reconstruct-root clj

(reconstruct-root {:keys [leaf-data path-bytes index]}
                  {:keys [hash-size tree-order]})

Computes the root of a tree given a leaf, index, and path

valid-proof? clj

(valid-proof? {:keys [root _path-bytes _index _leaf-data] :as args}
              {:keys [_hash-size _tree-order] :as opts})

Checks the server proof (PATH + INDX + leaf data) against the server ROOT value.

PATH, INDX, and ROOT come from the response; leaf-data must be supplied by the client. Depending on the protocol version, it is either the NONC or the entire request packet, including header and padding bytes.