I hope i can finish it too...

please post your code.  I have no earthly idea exactly what you are doing.  It is much easier to help someone if we can actually see what's wrong.

Quote from: Deflect on July 18, 2010, 04:08:32 pm

Yeah, but why not at least start the factoring of the keys with boinc like we did last time, and eventually as computing power increases (Well GPUs are really the powerhouses now) we will have it .... ok still in a looong time, but at least eventually we'll have it!

I don't disagree with that- I'm just saying that concentrating all the community's resources on it right now might not be a good idea. Because in the short term, hacking 1.7, or 2.0 or 2.1, will be much more beneficial. And probably easier/faster to do, too.

Short term yes, but TI will just as easily release a new update blocking it again.

Besides, letting your computer run all day is not that difficult.

@critor Good job!  You must tell how you found that.

At least the article is on the main slashdot.org page.  However a lot of he comments are saying don't allow a calculator at all.  I didn't read a single comment (Granted, I didn't read them all) that brought up the point that just because you have a calculator doesn't mean that it just gives you the answers.

Anyway, at least this way, there will be a little more publicity for the article.  Now we just need to factor the keys.

I like bleach and naruto.  I have read the manga up to date, and I am watching the english version right now.  I wish they didn't have to do fillers, ya know?

Also, a few months isn't a necro post, right?

I will try and think of something and post it here later for opinions.

You misunderstood my post.  I'm talking about the ending number for p and q multiplied together.  Let me brake it down further.  We know N is a semiprime, which means a multiple of two primes.  N cannot end with 2,4,5,6,8,0.  Otherwise, factorization would be trivial.  N must end in 1,3,7,9.  The way that multiplication works, the least significant digit (The right most) of the two primes multiplied together has the same last digit as N.  Like in 221.  13x17=221.  The last digit could be 1x1, 3x7, or 9x9.  We don't know if we don't have the factorization.  But we do know that the two primes must end in either both a 1, a 3 and a 7, or both end in 9.  Otherwise, it would be impossible to multiply them together to get 221, because the last digit would be different.  The only two prime numbers that can multiply to end in a 3 are 1 and 3.  That means, if the number ends in 3, like N=143, then the factors must end in 1 and 3, which they do, because 143=11x13.  It just makes it so you don't necessarily need 4 computers.

Besides, you could make it even faster than that.  If you have 10 computers, you could start them at offsets of 10, and count by 100.  If you had 6 computers, you could offset by 10 and have them count by 60.  Basically, in a distributed computing project, the server would tell each computer a number to stop at, so that each computer would again be an offset of 10 from each other, then increase the count by 10, and send it to each computer.  This way, all the computers would not have to wait for the others to finish if it was like 10,000 ahead of the rest of them.  Let me explain further.  Let's say I have computers A, B, and C.

A is at 10, B is at 20, and C is at 30.  They are each counting by 30.  Then, computer D decides to join in.  So, the server gets a request, and asks all the clients where they are at.  The server then chooses the highest one, plus some huge number to stop at.  Let's say C is the fastest, and is at 90.  D now is set to 100.  A and B go with the previous increment until A gets to 70 and B gets to 80.  Then, they use the new increment given by the server to continue.

This has been one long post.  Does this make sense?