Hello

I've found a bug in the NC≠NP proof.

junfukuyama.wordpress.com

I've been working on its fix. It takes further deeper claim in the Hamming space but I think it's possible to fix.

The alternative proof of the exponential monotone complexity of proof is absolutely correct.

congratulations!

another real breakthrough would be finding someone else who understands it =)