All these random collections of hash-functions are a dead-end for ASIC-resistance...

You get ASIC-resistance from the use of memory.
scrypt, at 128KB, doesn't use even nearly enough, nor does scrypt-N.

You should be requiring at least a thousand times more memory:
hundreds of MB, if not GBs.

For verification to remain fast, you need an asymetric proof-of-work,
where verifying the proof is MUCH easier than a single attempt to find it.