P=NP

[Anonymous No.15038493]

I have developed a poly time algorithm for 3-SAT. How much do you think a big tech company would pay me for the exclusive knowledge that I have?

[Anonymous No.15038498]

>>15038493
Nothing if you don't patent it and publish the proof.

[Anonymous No.15038500]

>>15038493
Take your meds

[Anonymous No.15038509]

>>15038493
I wouldn't be an idiot posting here, I'd go straight to NIST begging for a job

[Anonymous No.15038528]

>>15038498
>Publish proof
And get a measly $1 million from the cheapskates at the clay institute? Think about it. Everyone thinks P=/=NP. To be the only one with an actual algorithm for an NP hard problem would be incredibly lucrative.

[Anonymous No.15038534]

>>15038509
The plan is to retire with my money, not continue to be a wageslave

[Anonymous No.15038535]

Post it here so we can check it out if it works

[Anonymous No.15038539]

>>15038528
If you don't patent it, you don't own it. If you want to patent it, you have to publish it.

[Anonymous No.15038556]

>>15038539
>Implying
I can sell my discoveries in secret without patenting them.

[Anonymous No.15038558]

>>15038535
All I'll say is I found a clever Karp reduction.

[Anonymous No.15038567]

>>15038534
Just ensure your method cant easily be applied to breaking RSA or SHA or deriviatives, before you go trying to find money for this, you dont go solving an NP complete problem and not have it touch this.

That 'job' is there to put you under 24/7 surveillance and to divert your efforts to the military industrial complex, so that you may have hope to continue breathing

Good thing no one believes you, probably should keep it that way

[Anonymous No.15038568]

>>15038558
ok, you're talking about your stuff and I don't even know what that means. maybe you shouldn't thou

[Anonymous No.15038586]

>>15038567
>Just make sure my method
It's not under my control. If someone knows how to reduce these problems to 3-SAT (or general SAT, since my method applies to it easily) , there's nothing I can do about it.

[Anonymous No.15038597]

>>15038586
thats why they work very fast, you understand the global financial system is rooted in this stuff right?

basic risk management, if you have an Octillion dollar problem all it takes is a 0.00000000001% of it being true to necessitate action

doubt your the first, or the last

[Anonymous No.15038599]

>>15038556
You'll be pretty screwed if you don't have iron-clad legal representation.

[Anonymous No.15038607]

>>15038493
Let's assume you're telling the truth.. and that you have a 3-SAT solution.. so what? that's not the standard. proof that p=np means it always works, for any number, odd even or prime. that is, from 1 to infinity.. i can tell you also that such a proof exists.. though the confidence expressed here that such an achievement leads to a job, or great wealth, or intellectual property, or even a modicum of respect, is wholly false.. the only thing waiting for that person is ridicule, shame, and pure disbelief.. even if the machine algo works for any number, it simply won't be accepted..what matters is the application, and the defeat of key based machine cryptography.. it's already been done, and the world just carries on as if nothing has happened, as if the application doesn't exist.. could it be demonstrated? sure. but afterward tech will just say that no information is worth encrypting anymore. perhaps you will all just have to watch

[Anonymous No.15038623]

>>15038599
Oh I'll be sure to get a good lawyer.
>>15038607
Hey man, can you rephrase that?

[Anonymous No.15038625]

>>15038528
Use the knowledge to hack into every database ever and give yourself money.

[Anonymous No.15038632]

>>15038625
I'd rather play it safe
>>15038597
I'm sure the government will be chill

[Anonymous No.15038712]

>>15038632
good luck anon,

I hope to use your work