[js8]

The opposite reduction from 2XSAT to SAT is obvious, it's just a special case.

I think professionals of every field have to deal with passionate amateurs of all levels. I understand why many people don't want to do it, but IMHO overemphasis on professionalism (culturally coming from enormous peer pressures) is hurting any field. The superprizes make it even worse.

> Just don't act confident that you've cracked a keystone problem in the field.

I am not acting like that, but I also have to be honest that my goal is specific - to understand why we can or can't have a polynomial algorithm. I.e. I have a strategy already, what I need is a 2nd opinion about some specifics of it.

[plpnpplpnp]

Honestly, I don't think you have the proof. Proving p is euqal to np will have very big consequences, not only in computer science but also in logics for example. I think this problem is far more complex than you think and it is not going to be solved by chance by an amateur. If it's going to be solved, there will be a deep math argument.

[klyrs]

> my goal is specific - to understand why we can or can't have a polynomial algorithm

This is the entire question of P vs NP. I'd love to point you to a reference, but the question remains unresolved. Good hunting.