![]() |
![]() |
#56 |
"Rashid Naimi"
Oct 2015
Remote to Here/There
2·11·103 Posts |
![]()
So you are proposing that there is a central source who creates semiprimes by multiplying 2 known primes. Wouldn’t such a central entity defeat the purpose of blockchains which as I vaguely understand is a decentralizing concept?
Again asking because I don’t know. Thank you for your patient. ![]() Last fiddled with by a1call on 2022-05-29 at 03:21 |
![]() |
![]() |
![]() |
#57 | |
"Curtis"
Feb 2005
Riverside, CA
123648 Posts |
![]() Quote:
Good planning. You really have this designed well. You can't even make a feature wishlist without contradicting yourself. |
|
![]() |
![]() |
![]() |
#58 | ||
Feb 2022
24·3 Posts |
![]()
@a1call, I strongly suggest you read the whitepaper. You will learn a lot. Who knows? You might even have to drop the "I don't know" on every post you make of how much you will learn. Save yourself a few dozen questions by reading the whitepaper.
@VBCurtis, Quote:
Quote:
See appendix A for a full example. No one could make such a list when statements are taken out of context, not even Kurt Gödel. I would suggest reading more carefully perhaps? Last fiddled with by factorn on 2022-05-29 at 03:38 |
||
![]() |
![]() |
![]() |
#59 |
"Rashid Naimi"
Oct 2015
Remote to Here/There
2·11·103 Posts |
![]()
What is the advantage of:
* Having a source that creates semiprimes from known primes and is subject to hacking, insider-leaks/cheats and otherwise accessing the same known source primes via figuring its generating algorithm/s Over: * Using any of the following !PRP's which have remained !factored for centuries and yet are regularly factored by folks around here with gradual progress: https://www.mersenne.ca/prp.php?show...=1000&max=4000 ? Last fiddled with by a1call on 2022-05-29 at 04:32 |
![]() |
![]() |
![]() |
#60 | |
Feb 2022
608 Posts |
![]()
@a1call
It is good to see you move from "I don't know nor have I read the FACT0RN Blockchain whitepaper, but let me ask basic questions" to "I still haven't read your whitepaper nor can I be bothered to, but let me still ask basic questions". Progress? I guess? Quote:
1. known by whom? 2.Technically, what isn't subject to hacking? 3. Try reversing sha3-512, Whirpool, shake2b and Scrypt simultaneously...see how that goes. 4. An attack using hashing is described in the paper along with its cost...its cheaper to factor. Who knows? Reading the whitepaper might help. Just saying. You have clearly not read this thread in its entirety. That point was addressed previously. Just to name a few: it has a several technical loopholes, security holes, missing properties and impractical impediments. But, who am I? I am just some uneducated idiot on the internet, apparently. Last fiddled with by factorn on 2022-05-29 at 04:35 |
|
![]() |
![]() |
![]() |
#61 |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
9,901 Posts |
![]() |
![]() |
![]() |
![]() |
#62 |
"Rashid Naimi"
Oct 2015
Remote to Here/There
2·11·103 Posts |
![]()
Well I did try to read the PDF, but 12 pages of the complex subject is too much for my resources.
I am asking genuine questions so please do not take my posts personally. I did some thinking and what I can figure that may or may not be what you are intending is that: You have block chains that take random numbers of specific size and test them to be PRP’s. This is done in a distributed network and not a centralized server. Upon finding two such PRP’s per node a/many semiprime/s is/are generated and then are mined/factored by miners. So in effect you are replacing the SHA-256-hash encryption by “encrypting” 2 random PRP’s into a semiprime. That’s what I can figure with my limited knowledge. Regardless, thank you for your posts. ETA: I assume the advantage of constructed semiprimes over using existing composites without known factors would be that you can adjust the difficulty level at will. Last fiddled with by a1call on 2022-05-29 at 07:19 |
![]() |
![]() |
![]() |
#63 | |
Feb 2022
24×3 Posts |
![]() Quote:
@a1call There is no testing of any kind by the blockchain when generating the number around which miners will look for primes. It literally generates a pseudo random number using hashing. That's it. No testing whatsoever. It is the job of the miner to find a strong semiprime around that pseudo-random number generated within the very limited range around it that is allowed. If nothing is found in around the number, generate another pseudo-random number and try again until you do.There is no coordination either for generating the pseurandom number. There is a way in which after you submit all the work, everyone else can confirm that what you have submitted is valid and that you did not defraud the system. The testing is done after you submit a solution to make sure that your submission is within the limited range you were allowed to search for, that your prime actually divides the generated random number plus the offset you submitted, and that both factors are reasonably prime (50 rounds Miller-Rabin plus Baillie-PSW Primality Test). The reason it must be this way is that, if anything changes in the block being submitted then the random number generated will change, which means that the solution will change, which means that the block will be rejected, which means people cannot steal rewards, or maliciously change anything unless they mine the block properly....that's why the security of the block is tied to the this process...also why the work must be the same at every difficulty level for long as the computational power of the blockchain remains at that level. Last fiddled with by factorn on 2022-05-29 at 10:43 |
|
![]() |
![]() |
![]() |
#64 |
"Rashid Naimi"
Oct 2015
Remote to Here/There
2×11×103 Posts |
![]()
Are you saying that, the “puzzle” to solve by miners, is to find semiprimes within some given set parameters (size, range, factors-separation/offset) by performing factoring and subsequent primality tests, rather than factoring some given semiprimes?
|
![]() |
![]() |
![]() |
#65 |
Feb 2022
24×3 Posts |
![]()
Correct. The miner's job is to find semiprimes by way of factoring/sieving within some parameters rather than factoring a given semiprime or simply generating a semiprime.
|
![]() |
![]() |
![]() |
#66 | |
If I May
"Chris Halsall"
Sep 2002
Barbados
294F16 Posts |
![]() Quote:
Also, it is not useful to get emotional when defending an idea. Particularly when more and more holes are pointed out in said idea. |
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Why integer factorization is in P/FP? | tetramur | Factoring | 4 | 2019-01-23 20:51 |
Integer factorization? | bearnol2 | Information & Answers | 7 | 2010-12-09 02:50 |
Integer factorization with q < 2p | mgb | Math | 36 | 2009-11-07 15:59 |
Integer Factorization | mgb | Math | 16 | 2007-12-17 10:43 |
Integer Factorization 2 | mgb | Math | 5 | 2007-07-23 12:55 |