Bitcoin Forum
December 07, 2016, 10:44:07 AM *
News: To be able to use the next phase of the beta forum software, please ensure that your email address is correct/functional.
 
   Home   Help Search Donate Login Register  
Pages: [1]
  Print  
Author Topic: nevermind  (Read 1814 times)
BenRayfield
Sr. Member
****
Offline Offline

Activity: 262



View Profile WWW
December 28, 2011, 08:45:52 AM
 #1

nevermind

All my writing, here or anywhere else, permission granted to copy.
1481107447
Hero Member
*
Offline Offline

Posts: 1481107447

View Profile Personal Message (Offline)

Ignore
1481107447
Reply with quote  #2

1481107447
Report to moderator
1481107447
Hero Member
*
Offline Offline

Posts: 1481107447

View Profile Personal Message (Offline)

Ignore
1481107447
Reply with quote  #2

1481107447
Report to moderator
1481107447
Hero Member
*
Offline Offline

Posts: 1481107447

View Profile Personal Message (Offline)

Ignore
1481107447
Reply with quote  #2

1481107447
Report to moderator
There are several different types of Bitcoin clients. Hybrid server-assisted clients like Electrum get a lot of their network information from centralized servers, but they also check the server's results using blockchain header data. This is perhaps somewhat more secure than either server-assisted clients or header-only clients.
Advertised sites are not endorsed by the Bitcoin Forum. They may be unsafe, untrustworthy, or illegal in your jurisdiction. Advertise here.
wangxinxi
Hero Member
*****
Offline Offline

Activity: 784


Founder & CEO of Coinut.com, Litecoin Core Dev


View Profile WWW
December 28, 2011, 08:50:06 AM
 #2

I'm so happy to hear about this conclusion. It seems that I don't need to do my PhD thesis from now on.
phillipsjk
Legendary
*
Offline Offline

Activity: 1008

Let the chips fall where they may.


View Profile WWW
December 29, 2011, 05:57:52 PM
 #3

Are you asking us to find obvious flaws in your propsed proof?

There is a $1 million prize for the first correct solution.

I would have to read up on graph theory to see if your claim of being able to represent the the entire set of NP problems on a graph is valid.


You appear to be using "clique finder" edges to model CPU time. Are you also modeling storage requirements which grow just as fast? For example, for  finding prime a number by trial factoring, I only need to divide the candidate by all the prime numbers up to the square-root of that number. However, once the number is over 64bits long, the storage requirements (all 32 bit primes) start to become prohibitive.

Edit: You may also want to examine what Class or proof you are using. Your proof appears to be a "Natural proof" which according to Wikipedia requires the concept of one-way functions to be disproven to prove P=NP.

James' OpenPGP public key fingerprint: EB14 9E5B F80C 1F2D 3EBE  0A2F B3DE 81FF 7B9D 5160
BenRayfield
Sr. Member
****
Offline Offline

Activity: 262



View Profile WWW
December 30, 2011, 11:18:50 PM
 #4

nevermind

All my writing, here or anywhere else, permission granted to copy.
Pages: [1]
  Print  
 
Jump to:  

Sponsored by , a Bitcoin-accepting VPN.
Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!