P=NP

Change my mind.

no

@Gregozor2121

Because I'm right. Chicken!

@shoop
You just missed it. The old line claimed I used to be a professional male model.

@FrodoSwaggins
Well if you have a problem that's np and p=np then if an algorithm exists to solve it in polynomial time the thinking goes that it can be translated to all problems in the same class.

I've never written a travelling salesman algorithm but I have a factorization algorithm that's polynomial time. Have it working on 64bit products and currently extending it to higher bit lengths. So P=NP.

Prove it and you'll get a million cash moneys

@don-rager finally.

Let's do a challenge.
I failed last time I asked someone. Was a little premature at the time.

Give me the product of any two 32 bit factors and I'll give you back the factors. Should take between 20-30 minutes here.
No GPU. No compiled code. Single thread on an i3.

I like to use HTTPS://asecuritysite.com/encryptio...
just because it lets me easily customize bit length.
Go head grab a product and factors. Give me the product and I'll solve for the factors.

Problem = No Problem

- Manager

@Wisecrack are you talking about the factorization algorithm you "accidentally" reimplemented again? That's not a proof of P=NP

@don-rager am I mistaken that a problem in that class with a polynomial time solution would suggest that it's generally true of the whole class of problems, or no?

Edit: this isn't that algorithm. The previous one was one of about two hundred odd approaches I took and like the early ones it was a dead end, but it turned up avenues I hadn't considered before, which lead to the current approach.

Is prime factorization np-hard?
Edit: nah fuck it. my knowledge in that is too rusty to make proper points without further research. I'm still 100% sure that your algorithm won't prove P=NP though

@don-rager alright do me a solid then my good man. Head over and grab a 64 bit product and post it here.
The hardest thing I deal with is finding people who will participate in my shenanigans and hijinxs because half the shit I write sounds crazy enough.

Edit: for science!

@Wisecrack Suggestin a solution isnt proving it. Prove it or you are chicken!

@Gregozor2121 post a 64bit product of two primes and sure as shit I'll prove it my man.

The only one who will look like an ass if I fail is me.

@Wisecrack Again that is not a fucking proof. You gotta proof ALL cases for N=NP and that is a lot of cases, single example aint worth shit.

@Gregozor2121 then put your money where your mouth is and post a 64bit product bro.

Bawk bawk bawk.

@alexbrooklyn 🤣👌

@Gregozor2121 read some more. Apparently you're right. I'm a fucking idiot. It's not np hard so it won't prove p=np.

Don't know where I picked up that bit of misinformation.

Still factoring 64bits

Apparently my method is similar to the rho method by pollard but varies in a few critical details. That fucker didn't think of everything.

PNP

Uhhh semiconductors?

@Wisecrack OK, since you ask for them, let's play. Here is the product of two primes:
7004726973794564467

@cafecortado alright starting it now. Thanks.

Gonna feel like a fool if you fed me a bad number for shits n gigges.

My dick is NP hard.

The factors are 268319059, and 26105961313.

Initially wasted a boatload of time because I had the tuning parameters wrong. Fixed and the second run returned in 185.6s

So it works but there's still work to do.

@Fast-Nop the one secret THEY don't want you to know about!

Super male vitality!

@Wisecrack correct 👍

@cafecortado you seem reliable. I'll let you know when the thing is ready for 128 bits if that's alright with you.

Doing it efficiently for bounded inputs doesn't really show anything about the time complexity of the solution. Furthermore, if it doesn't scale with input size that suggests that the algorithm is not running in polynomial time.

Glad you're back into working on your algorithm though, sounds fun. You should let us know when you hit 1024 bits.

P != NP
Change my mind 🤯

@Ranchu That's exactly what my technician mind thought first.

@FrodoSwaggins My man Frodo over here taking the time to educate me! Thank you.

@rutee07 Hard as steel, as you can see - I just might decide to flirt you up, honey!

P=HP