Me and my colleague are exploring new ideas to solve SAT efficiently (i.e. in polynomial time) and it's the case that there is a candidate algorithm.
Unfortunately, neither of us can write scripts well (to test more examples to prove its correctness) or more accurately ... have the sufficient mathematical maturity to write a Research Article about it.
We want to contact some researcher in the field to help us formally describe the algorithm and prove that it works for all inputs (if it holds).
We have tested a few instances of (sat,unsat) and it works (relatively small instaces but not related to DPLL).
In addition, the description of the algorithm matches the concept of nondeterminism (i,e. parallel computations, gussing phase and verification phase,etc.) can be stated / defined precisely.
Given that it is SAT, most reasearchers would consider an attempt to solve it as something invalid, how can we convince someone that this might acutally work ?
What can be a Zero Knowledge Proof (ZKP) for $SAT$ to prove that it works from the tested examples ?
Will a description of some Phases / Techniques used in the algorithm along with the solutions of tested instances suffice ?