Does Binohash grinding behave like a PoW, and is it really ASIC-resistant?

I have been studying Robin Linus’s "Binohash" paper
(Binohash:transaction introspection with out softforks,https://delvingbitcoin.org/t/binohash-transaction-introspection-without-softforks/2288) and
making an attempt to know the grinding course of.

My tough understanding:

• The spender chooses subsets of signatures
  from a set pool embedded within the locking script
• Every subset adjustments the scriptCode through
  FindAndDelete earlier than hashing
• The objective is to discover a subset the place the ensuing
  sighash satisfies a leading-zero situation

So in apply this seems to be like a search drawback
over combinatorial subsets moderately than a easy
nonce house.

In comparison with Bitcoin mining:

• Mining hashes a fixed-size header with a
  altering nonce
• Binohash requires modifying KB-sized script
  information (through FindAndDelete) earlier than every hash
• Every transaction defines its personal unbiased
  search house

My questions:

1. Is it affordable to consider this as a sort
   of PoW, or is {that a} deceptive analogy?

2. What really limits ASIC acceleration right here —
   the FindAndDelete step, the bigger enter dimension,
   or one thing else?

3. Would a specialised ASIC nonetheless present
   important speedup, or is that this inherently
   nearer to a GPU-style workload?

4. Does the truth that every transaction defines
   its personal search house make this essentially
   non-competitive, in contrast to mining the place everybody
   races on the identical puzzle?