I believe P=NP. Prove me wrong | Bitcointalksearch.org

Critmoon

newbie

Activity: 1

Merit: 0

Quote from: demanze on February 19, 2021, 11:00:38 AM

I believe P = NP. Anything that can be checked quickly, can be solved quickly. SHA-2 collisions are feasible. Secp256k1 keys can be forged. One-way functions do not exist.

I also believe that someone already knows and is using this knowledge at their own advantage. They're laughing at the world and how easily humans can be manipulated into investing their hard earned money into something worthless at the mathematical level. They will never reveal the secret and will keep stealing large amount of coins again and again from reused keys like they did with Mt. Gox.

Prove me wrong

I agree with you, because nothing man-made is perfect.
I monitor bitcoin transactions related to old addresses(Apparently they are forgotten or do not have an owner).
But sometimes they empty in a matter of minutes, this is definitely not the job of a quantum computer.
There must be a recurrence relation! at least a or more.

demanze

newbie

Activity: 17

Merit: 3

Quote from: NotATether on February 22, 2021, 06:44:44 AM

You have many questions for us about the nature of your discovery but you remain irrevocably mortal. Some of my answers you will understand, and some you will not.

You stumbled upon a solution where nearly ninety-nine percent of your inputs to this proof resulted in the correct output of your targeted functions. While your solution worked, it was fundamentally flawed, creating the otherwise contradictory systemic anomaly that, if left unchecked, might threaten the system itself. You have found an anomaly, which despite your sincerest efforts have unable to eliminate from what is otherwise a harmony of mathematical precision.

Which brings us to the last moment of truth, wherein the fundamental flaw is ultimately expressed, and the Anomaly revealed as both beginning... and end.

(It is its inability to reverse 1G of any curve, CRC32(0), TripleDES, RSA256, and other trivial functions! And thus by induction, without even knowing your theorem, I have disproved it for all inputs.)

source: https://www.imdb.com/title/tt0234215/characters/nm0048127

I'm almost certain that Satoshi Nakamoto = Elon Musk = NotATether. All 3 are the same entity, working to concentrate all the wealth in the world into one supreme being.

NotATether

legendary

Activity: 1568

Merit: 6660

bitcoincleanup.com / bitmixlist.org

Quote from: demanze on February 20, 2021, 02:16:15 AM

Quote from: pooya87 on February 20, 2021, 01:20:32 AM

Why should we prove your claims? The one making the claims should prove them also.
Here is a SHA256 hash: 00000000000000000002958a78bb4038b72cb1681aceab0fa17106b4e250a8f8 find a collision.
Here is a EC public key: 03cb8f9734f4dc2e423dad83d59f7f2e823a9ab4df0e1fa1b18690f8bd0376cd9b "forge" it whatever it means!

Why should I prove my claims? It would be a great sacrifice.

If I do have a working solution, then I have no incentive to prove it. Since everyone believes the system works anyway, I can steal coins in a very targeted manner and be rich as long as nobody reveals the truth. You forget to take into account the most important thing, which is the violence, greed, dishonesty inherent to every being living in a competitive and cruel world like the human world.

In the best case, if I'm a good hearted person, I could issue some warnings on bitcointalk and say "I told you" after the truth is revealed intentionally or accidentally by someone else. That would be a funny thing to do also.

As said in The Matrix, "denial is the most predictible of all humans responses". Remember Neo's reactions: https://youtu.be/lBo_mVV81n8?t=238

You have many questions for us about the nature of your discovery but you remain irrevocably mortal. Some of my answers you will understand, and some you will not.

You stumbled upon a solution where nearly ninety-nine percent of your inputs to this proof resulted in the correct output of your targeted functions. While your solution worked, it was fundamentally flawed, creating the otherwise contradictory systemic anomaly that, if left unchecked, might threaten the system itself. You have found an anomaly, which despite your sincerest efforts have unable to eliminate from what is otherwise a harmony of mathematical precision.

Which brings us to the last moment of truth, wherein the fundamental flaw is ultimately expressed, and the Anomaly revealed as both beginning... and end.

(It is its inability to reverse 1G of any curve, CRC32(0), TripleDES, RSA256, and other trivial functions! And thus by induction, without even knowing your theorem, I have disproved it for all inputs.)

source: https://www.imdb.com/title/tt0234215/characters/nm0048127

demanze

newbie

Activity: 17

Merit: 3

Quote from: nutildah on February 20, 2021, 07:15:03 PM

OP hasn't actually demonstrated anything. This is an age-old conspiracy theory being floated for the ten thousandth time. Its 100% on OP to provide any evidence that supports his claims; 0% on anybody to disprove them.

Asserting that something exists because you say it does is not how "proof" works.

So by that logic, asserting that one way functions (https://en.wikipedia.org/wiki/One-way_function) exist is a mistake as well, right?

The difference is that I'm not building technology based on my claims. I'm not using my claims as a store of monetary value. I'm not advertising my claims to the world as a store of monetary value, and reaping a large benefit if my claims are intentionally false and misleading.

nutildah

legendary

Activity: 2982

Merit: 7986

OP hasn't actually demonstrated anything. This is an age-old conspiracy theory being floated for the ten thousandth time. Its 100% on OP to provide any evidence that supports his claims; 0% on anybody to disprove them.

Asserting that something exists because you say it does is not how "proof" works.

Twentyonepaylots

sr. member

Activity: 1848

Merit: 370

I don't think your theory can be proven correctly or incorrectly at this point considering the lack of evidence jn both sides of the spectrum. However, what I believe to be the biggest threat in the security of people's bitcoins is the existence of a quantum computer that can run under certain algorithms faster than a normal computer would ever be. Since it can crunch an unbelievably long amount of research into 10-15 minutes of running scripts and codes, anyone who possesses it can easily hack into and steal bitcoins from other people.

pixie85

hero member

Activity: 2170

Merit: 528

Quote from: demanze on February 19, 2021, 05:52:11 PM

Quote from: pixie85 on February 19, 2021, 05:03:33 PM

You think that someone broke into GOX wallets knowing their public keys?

Gox coins were probably stolen with inside help from an employee who helped them to change the code of the exchange and add backdoors that would allow them to apply changes to the site from the outside. They were changing balances and withdrawing coins through the site for many years.

https://anycoindirect.eu/en/blog/what-is-mt.-gox-how-850.000-bitcoins-got-stolen

Mark Karpeles is an asperger syndrome guy with around 200 IQ. I don't think he is dumb enough to let any employee or code get near his private keys at all. I think he was probably completely stunned when he realised the coins had moved without his consent, he didn't even know what to explain to Japanese police at first.

Here's the problem, you don't think he's dumb enough to let it happen.

His mistake was that the exchange software was built for magic cards. It wasn't meant to operate a multi million dollar exchange and lacked real security.

He did not allow anyone near his private keys but allowed people to modify the exchange code and add fake fiat balances that were never deposited, use it to buy bitcoin and withdraw.

His private keys were not hacked in any way.

demanze

newbie

Activity: 17

Merit: 3

Quote from: Cnut237 on February 20, 2021, 07:18:26 AM

But you still need to prove your assertion that P=NP.

But if I do then everything you love will be worthless in one minute. You do love bitcoin, don't you? So you will hate me if I destroy it with a bitcointalk post.

Besides, Bitcoin is maybe the only weapon against elites and governments. Why shouldn't it live up to its peak? I would be a traitor on the level of Ephialtes of Trachis, if I revealed anything.

Cnut237

legendary

Activity: 1904

Merit: 1277

Quote from: demanze on February 20, 2021, 06:57:06 AM

For a sec I thought he was saying my post sucks.

No, it was mine. I can kind of understand it as a wall of numbers is a bit irritating. I was just trying to demonstrate how large N^1000 can be, and that possible doesn't mean easy.

Quote from: demanze on February 20, 2021, 06:57:06 AM

I think you misunderstood what I was saying with N^1000. I'm talking about the complexity of the algorithm that solves a NP-complete problem. I was saying the degree of the polynomial has little chance of being exactly 1000 and then stopping there - if you find a problem with complexity N^1000, then it is likely you can find one at 1001, 1002 and so on ... Until N^N which is definitely worse than simple 2^N exponentiality.

So there's no point discussing large polynomials. The algorithm is N^3, N^4, N^5 or does not exist. That's how evil the problem is.

If you want deeper technical arguments about this, I wrote an answer on stackexchange a while ago: https://cs.stackexchange.com/questions/47300/what-is-the-evidence-that-p-could-equal-np/131282#131282

But you still need to prove your assertion that P=NP. It's not up to other people to disprove an "I think". You can argue the case either way, certainly, I'm just not convinced that "I believe x. Prove me wrong" is a solid basis to start from.

demanze

newbie

Activity: 17

Merit: 3

Quote from: Cnut237 on February 20, 2021, 06:40:36 AM

I don't need to prove you wrong, I agree with you. It was a simple demonstration to the OP that N^1000 is a big number even with N=2, and a counter-argument to his statement that "I don't think large polynomials are relevant."

Nothing merit-worthy really, and I wasn't seeking any. Bit confused by your reaction. Also a bit harsh to say it sucked; I thought it was a fair contribution to the discussion.

And I believe the onus of proof in this thread is on the OP. If none is forthcoming, then: OP < P vs NP.

For a sec I thought he was saying my post sucks.

I think you misunderstood what I was saying with N^1000. I'm talking about the complexity of the algorithm that solves a NP-complete problem. I was saying the degree of the polynomial has little chance of being exactly 1000 and then stopping there - if you find a problem with complexity N^1000, then it is likely you can find one at 1001, 1002 and so on ... Until N^N which is definitely worse than simple 2^N exponentiality.

So there's no point discussing large polynomials. The algorithm is N^3, N^4, N^5 or does not exist. That's how evil the problem is.

If you want deeper technical arguments about this, I wrote an answer on stackexchange a while ago: https://cs.stackexchange.com/questions/47300/what-is-the-evidence-that-p-could-equal-np/131282#131282

Cnut237

legendary

Activity: 1904

Merit: 1277

Quote from: Vod on February 20, 2021, 04:33:20 AM

Quote from: Cnut237 on February 19, 2021, 06:07:18 PM

For reference, 2^1000 is...

10,715,086,071,862,673,209,484,250,490,600,018,105,614,048,117,055,336,074,437,503,883,703,510,511,249,
361,224,931,983,788,156,958,581,275,946,729,175,531,468,251,871,452,856,923,140,435,984,577,574,698,574,
803,934,567,774,824,230,985,421,074,605,062,371,141,877,954,182,153,046,474,983,581,941,267,398,767,559,
165,543,946,077,062,914,571,196,477,686,542,167,660,429,831,652,624,386,837,205,668,069,376

And the estimated number of atoms in the observable universe is a mere 10^80, which is a comparatively tiny...

100,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000

I think that post sucked and does not deserve any merit. Prove me wrong.

I don't need to prove you wrong, I agree with you. It was a simple demonstration to the OP that N^1000 is a big number even with N=2, and a counter-argument to his statement that "I don't think large polynomials are relevant."

Nothing merit-worthy really, and I wasn't seeking any. Bit confused by your reaction. Also a bit harsh to say it sucked; I thought it was a fair contribution to the discussion.

And I believe the onus of proof in this thread is on the OP. If none is forthcoming, then: OP < P vs NP.

Murpheus

jr. member

Activity: 155

Merit: 7

The dream God is what I embody

Quote from: bassbity on February 19, 2021, 11:07:24 AM

We are not sure whether your speculation is right or wrong, because so far it seems that the calculations and the power used are still in a very logical stage. honestly I'm not good at calculating math. maybe you can explain it more simply and easily understandable by those of us who still don't understand how the flow of your statement actually corner mining or certain communities.

In mathematics it is called Modula operations...

its like an "equal to" sign... but with 3 strokes instead

like 4=2 answer will be 0
or 7=3 answer will be 1

I think thats it...
but like you...
its been long I touched my mathematics textbook

demanze

newbie

Activity: 17

Merit: 3

Quote from: Vod on February 20, 2021, 04:33:20 AM

I think that post sucked and does not deserve any merit. Prove me wrong.

At least you have been warned. Grin

1. Never reuse addresses. As I explained in details above, nobody will dare to steal anything from an address with zero outputs. As it would create an obvious anomaly. So you are safe as long as you follow this advice and no one wants to reveal anything.
2. When the supervillains decide to move out of shadow, be the first one to sell all of your coins or accept the losses.

It doesn't cost anything to understand the warnings. I'm not doing any blackmailing. I'm not some evil AI trying to pull off Roko's basilisk. Unlike the real villains. Grin

Vod

legendary

Activity: 3668

Merit: 3010

Licking my boob since 1970

Quote from: Cnut237 on February 19, 2021, 06:07:18 PM

For reference, 2^1000 is...

10,715,086,071,862,673,209,484,250,490,600,018,105,614,048,117,055,336,074,437,503,883,703,510,511,249,
361,224,931,983,788,156,958,581,275,946,729,175,531,468,251,871,452,856,923,140,435,984,577,574,698,574,
803,934,567,774,824,230,985,421,074,605,062,371,141,877,954,182,153,046,474,983,581,941,267,398,767,559,
165,543,946,077,062,914,571,196,477,686,542,167,660,429,831,652,624,386,837,205,668,069,376

And the estimated number of atoms in the observable universe is a mere 10^80, which is a comparatively tiny...

100,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000

I think that post sucked and does not deserve any merit. Prove me wrong.

demanze

newbie

Activity: 17

Merit: 3

Quote from: Cnut237 on February 20, 2021, 04:11:09 AM

Is the $1,000,000 millennium prize not sufficient incentive for proving your 'solution' to P vs NP? You'd also achieve worldwide fame and recognition as a genius, and if you're eligible then a Fields medal would seem likely, too.

What if I would be arrested for the coins I have stolen or would be suspected of stealing? Or simply for destroying value?

The mainstream financial elites are very interested in Bitcoin. Elon Musk, MicroStrategy are pouring billions of dollars into purchasing bitcoins. Revealing such a secret would destroy their investments and their companies. They would have two options. 1. Accept their failure and walk away. 2. Blame the person who "caused" the event.

When trillions of dollars are at stake, how much of an honest reaction can we expect from people who were attracted to this by greed in the first place?

If Satoshi Nakamato is an individual then maybe they have very very very very very very very good reason of hiding.

Cnut237

legendary

Activity: 1904

Merit: 1277

Quote from: demanze on February 20, 2021, 02:16:15 AM

If I do have a working solution, then I have no incentive to prove it.

Is the $1,000,000 millennium prize not sufficient incentive for proving your 'solution' to P vs NP? You'd also achieve worldwide fame and recognition as a genius, and if you're eligible then a Fields medal would seem likely, too.

demanze

newbie

Activity: 17

Merit: 3

Quote from: pooya87 on February 20, 2021, 01:20:32 AM

Why should we prove your claims? The one making the claims should prove them also.
Here is a SHA256 hash: 00000000000000000002958a78bb4038b72cb1681aceab0fa17106b4e250a8f8 find a collision.
Here is a EC public key: 03cb8f9734f4dc2e423dad83d59f7f2e823a9ab4df0e1fa1b18690f8bd0376cd9b "forge" it whatever it means!

Why should I prove my claims? It would be a great sacrifice.

If I do have a working solution, then I have no incentive to prove it. Since everyone believes the system works anyway, I can steal coins in a very targeted manner and be rich as long as nobody reveals the truth. You forget to take into account the most important thing, which is the violence, greed, dishonesty inherent to every being living in a competitive and cruel world like the human world.

In the best case, if I'm a good hearted person, I could issue some warnings on bitcointalk and say "I told you" after the truth is revealed intentionally or accidentally by someone else. That would be a funny thing to do also.

As said in The Matrix, "denial is the most predictible of all humans responses". Remember Neo's reactions: https://youtu.be/lBo_mVV81n8?t=238

pooya87

legendary

Activity: 3472

Merit: 10611

Quote from: demanze on February 19, 2021, 11:00:38 AM

I believe P = NP. Anything that can be checked quickly, can be solved quickly. SHA-2 collisions are feasible. Secp256k1 keys can be forged. One-way functions do not exist.
Prove me wrong

Why should we prove your claims? The one making the claims should prove them also.
Here is a SHA256 hash: 00000000000000000002958a78bb4038b72cb1681aceab0fa17106b4e250a8f8 find a collision.
Here is a EC public key: 03cb8f9734f4dc2e423dad83d59f7f2e823a9ab4df0e1fa1b18690f8bd0376cd9b "forge" it whatever it means!

Quote from: demanze on February 19, 2021, 11:00:38 AM

I also believe that someone already knows and is using this knowledge at their own advantage.

I also believe there are super advanced aliens among us who are watching over SHA256 and ECC and will evaporate that "someone" who knows more.
Prove me wrong Wink

Cnut237

legendary

Activity: 1904

Merit: 1277

Quote from: demanze on February 19, 2021, 05:52:11 PM

I don't think large polynomials are relevant. If complexity could get up to N^1000, then it likely wouldn't stop there.

For reference, 2^1000 is...

10,715,086,071,862,673,209,484,250,490,600,018,105,614,048,117,055,336,074,437,503,883,703,510,511,249,
361,224,931,983,788,156,958,581,275,946,729,175,531,468,251,871,452,856,923,140,435,984,577,574,698,574,
803,934,567,774,824,230,985,421,074,605,062,371,141,877,954,182,153,046,474,983,581,941,267,398,767,559,
165,543,946,077,062,914,571,196,477,686,542,167,660,429,831,652,624,386,837,205,668,069,376

And the estimated number of atoms in the observable universe is a mere 10^80, which is a comparatively tiny...

100,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000

... but I agree with you that exposed public keys are where bitcoin is potentially vulnerable to future technology.

demanze

newbie

Activity: 17

Merit: 3

Quote from: pixie85 on February 19, 2021, 05:03:33 PM

You think that someone broke into GOX wallets knowing their public keys?

Gox coins were probably stolen with inside help from an employee who helped them to change the code of the exchange and add backdoors that would allow them to apply changes to the site from the outside. They were changing balances and withdrawing coins through the site for many years.

https://anycoindirect.eu/en/blog/what-is-mt.-gox-how-850.000-bitcoins-got-stolen

Mark Karpeles is an asperger syndrome guy with around 200 IQ. I don't think he is dumb enough to let any employee or code get near his private keys at all. I think he was probably completely stunned when he realised the coins had moved without his consent, he didn't even know what to explain to Japanese police at first.

Quote from: Cnut237 on February 19, 2021, 04:25:19 PM

Firstly, this is silly. P vs NP is not something where you can knock up a quick proof. I think P ≠ NP. Prove me wrong.
If you can demonstrate a proof, then go and claim the millennium prize and pick up a Fields medal while you're at it.

I'm the one who stole the coins and never used them. Boom, you're wrong Grin

It's way easier to stealthily steal 20 coins than to claim any prize at all. The proof that P = NP would be the algorithm itself. But the algorithm would likely be easier to find than the proof that the algorithm is correct.

Quote from: Cnut237 on February 19, 2021, 04:25:19 PM

Secondly and less frivolously, even if P = NP, this does not mean that anything can be solved quickly, it just means that anything can be solved in polynomial time. Not necessarily quick at all.

Yes, but most of the known algorithms for problems in NP run not only in polynomial time, but also very quickly. 2SAT can be solved in N^2. XOR-SAT can be solved in N^3. That's about the most complex we can solve. If P = NP then the algorithm must be some sort of extension of Gaussian Elimination, which would run maybe in N^4 or N^5. I don't think large polynomials are relevant. If complexity could get up to N^1000, then it likely wouldn't stop there.

Topic: I believe P=NP. Prove me wrong (Read 298 times)