With blockchains or bitlattices, the state itself is from any given position an almost infinitely long source of random numbers, and a cipher that finds a unique key based on the input message and transaction position could be hard to break given only the ciphertext.

The opcode mhf[1][5], a maze hash function with n number of bytes and i number of iterations, could get random numbers by “getting lost” within the subtle structure of the state itself, recursively re-orienting its path based on feedback, and outputting a one-way hash.

The message m could be seen as co-ordinates that code for a labyrinth, with recursive feedback as it traces a path, and the transaction position as a starting point.

Hash functions as labyrinths

Perhaps all hash functions could be understood as labyrinths, bio-mimicry from how animals hide their tracks, and have randomness to their behaviour, which also explains their one-wayness. Anyone who has ever hidden anything, which is everyone, knows that labyrinth-like "puzzles" are good ways to hide things, burying a treasure or a bone or surplus kill.

With a maze hash function (mhf), the hexadecimal for the message “hello world”, 0x68656c6c6f20776f726c64, would then do a form of hide-and-seek inside the blockchain, lattice, or state structure, flee into a labyrinth of its own making, and then sit and linger until the message is revealed to the state and authenticated with the hash.

Example labyrinth function with recursive feedback

On Ethereum for example, a “maze hash function” in the most recent transaction 0xed… could walk through the co-ordinates the input codes for, so that the message 0x7336af8f would 7 transactions down get the f-th character (0x7336af8 f) from the transaction hash, 0x…22be b 3b7…, then continue 0x7 3 3… 3 + b = e transactions down and get the 8th character, 0xc34eeb8 1 c2…, then continue 3 + 1 = 4 transactions to get the f-th character (0x7336a f 8f), and so on.

Since the transaction position cannot be known when the owner of the private key that commits the hash calculates the labyrinth function, the previous transaction could be used as the root, tx-1.