POW idea about proof-of-work HOT 1 OPEN

This is a more general algorithm generator, hopefully hard for any architecture to do much better than a CPU.

myhash = ffx32;
while (myhash >= target) {
   nonce++;
   h =  sha256 ( "previous_block_hash" + "nonce");
   seed = get_seed ( h );
   while (timer < 1)  { 
       get_for_or_if_with_data_type ( seed ); 
       get_object_data_and_type ( seed ); 
       get_action_to_perform_on_data_and_loop_var (seed ); // very simple
       seed = perform_conditional_and_action_on_object_data ( );
   }
   myhash = sha256(seed)
}
claim_my_ block();

There are many complexities to work out. The per-iteration constructor has to be faster than its execution. "timer" is slow. Could use a definite number of iterations, or test timer once every x iterations, and test for seed < some value. The if statement might need to be no more or less than a NAND gate:
unless ( a > b || c > d) { }
and it would need to be capable being fed back up to previous constructions, so the termination of the for and if blocks can't be each iteration. (A NAND gate output should be capable of being fed back into to previous NAND gates for feedback). Definitely terminating then becomes a problem. So a timer or counter becomes necessary.

from proof-of-work.