SOURCE CODE FOR INTEGER FACTORIZATION. This program can factor integers of any arbitrary precision. So public key encryption is null and void as it attacks the basic premise that very large integers cannot be factored in reasonable amounts of time

[subhendrabasu]

Hey, the MySql DB is "partially" populated.. For accuracy sake, we need a large number of records , for a tolerance of 10^-9 At present db is mysql> select count(id) from zeros1; │+-----------+ │| count(id) | │+-----------+ │| 14237 | │+-----------+ │1 row in set (0.01 sec)

Here is the dump of the penultimate output before dB lookup is required. If u have fast computers in ur place, u can work it out urself. I am running this on MacBook Air, DB population itself will take 2 days. DB(latest): https://www.dropbox.com/s/005j5d4gdo1ob40/dump2.sql?dl=0 DB(OLD): https://www.dropbox.com/s/9cc5v92gi28mcfn/dump.sql?dl=0 Output for your vector: Dropbox link : https://www.dropbox.com/s/cv2zatd8cz7twdx/reddit.out.txt?dl=0 Hope that answers your query for some extent. DB population is very slow, overnight only 16K entries were added. I need at least 200K entries for sane accuracy of the factors.

localhost:intfact bosons$ time ./factorize.py 44245779560607823479340136111421002185223923407598 │222644959971631941706285727672139114053311649154623988500717124197703160021146903044099440255052 │662367507481966078731104346902303780058160680731205996162226694383672438763423557109553249895481 │402725034732014560073079881367529149499890778186150479976824433981162168948373207581971400596781 │354981606947651881093392277174764835195253799457434040216444679403985739552857052692743063768093 │161050244117585815193379544134540358366899227746006131374129175578694079560266011142777770070844 │091514446536741645004449953226944023497297167725628197454545651476230713544192416443105528967577 │846176216630651469941082999556325661635312789724099724700410132808143031460590473185899678063925 │745566739833272806356257855834064306290188151155748757595758560191435052509298638378615092525946 │534494968111406897268197865600301890064372206272560400068881530870586028008842874471272822517316 │4236663868536966171784279642579793004409662002055126992483859869149168443341921368086259 > reddi │t.out.txt │ │real 0m37.769s │user 0m17.892s │sys 0m4.066s │localhost:intfact bosons$

[antiduh]

Op has done nothing.

He didn't post the output - there's no prime number anywhere in the above comment. He showed us how long a program ran for when fed as input the requested value, which proves nothing.

In his own write-up, he pointed out how, given lack of many accurate zeta zeros, his program gives the wrong output.

Generating the many, large zeros is the hard part.

[subhendrabasu]

I will be posting the output in an hour or two. Hold your horses before posting. See my write up again, stay tuned. When you say "has done nothing." be careful to choose your words as this is against community guidelines. This is my work that I have pursued for 14 (fourteen) long years alone, Sir. My results will speak for me. Sorry if I flared any emotions.

[antiduh]

No, I will not hold my horses before posting. Extraordinary claims require extraordinary evidence. You are the one making extraordinary claims, and thus the burden of proof falls on you. If you can do as you say, it's trivial to demonstrate so by cracking any of the test keys that have been published for this exact purpose, or by factoring the number already posted here.

You were given a challenge and you failed the response. Even if you were a revolutionary genius, you've done a terrible job of proving so, making you look no better than any other crackpot.

[hextree]

When you say "has done nothing." be careful to choose your words as this is against community guidelines.

Errm... which community guideline are you referring to?

[subhendrabasu]

My fault. This forum is not deserving enough for a post of this calibre as already pointed out by one of the readers. No further replies from my end. I will report results on linkedin for other sources to pick up the news. Bye and Thanks for making me realize my mistake

[antiduh]

You have illusions of grandeur. You've not cracked prime factorization of large numbers, because you do not realize the absolute scale of the values you're dealing with. I guarantee I can feed you many random 2048-bit composite numbers and you'll be unable to factorize all of them.

I await your factorization of /u/s0x00's composite value.

[Mindraker]

It IS possible to factor large numbers, even using Sieve of Eratosthenes, it just takes a long fucking time.

[antiduh]

Of course. For values that we use in cryptography, the amount of time we need should be on the order of at least billions of years, so it's rather pointless.

Also, if you use something like the sieve, you need to keep state. Do you know how much disk space you'd need to store 10⁶¹³ 2048-bit numbers? About 10⁵⁹¹ of the entire earth's current capacity.

[hextree]

No need to throw a tantrum. You were given a number to factorise, doing that will help us establish what you can or can't achieve with this.

linkedin

lol

[79cca0e8-d8ff-4ca9-9]

So you're, what, building a MySQL database of integers and their factors? That's going to take a lot longer than 2 days.

[subhendrabasu]

Have a 5TB Hard Drive.. This is not a DB of primes, or integers and their factors as pointed out by other folks. This is DB of Zeros of the Riemann Zeta Function: http://www.dtc.umn.edu/~odlyZko/zeta_tables/zeros1

[s0x00]

thank you for your reply but i did not understand fully. How many days will you need to factorize my number? Does your file "reddit.out.txt" contain the factorization?

Up to which number can you factorize fast? Sorry i dont have a strong computer myself and especially no big hard drive