For demo legibility we use a truncated $n$-bit hash. Each row of the secret-key grid is a pair $(s_{i,0}, s_{i,1})$; one of the two is revealed per signature, with the choice determined by the bit $h_i$ of the message hash.
Press "Keygen" to start.
Build a binary Merkle tree of height $h$ with $2^h$ Lamport key pairs at the leaves. Public key = the root, $n$ bytes. Signature on the $j$-th leaf = (Lamport sig + Lamport pk + $h$ auth-path nodes).
Press "Build tree" to start.