Re: JSH: Your funeral

On Sep 11, 10:23 am, JSH <jst...@xxxxxxxxx> wrote:
On Sep 10, 6:52 pm, Joshua Cranmer <Pidgeo...@xxxxxxxxx> wrote:

JSH wrote:
I picked factoring because ultimately I don't need any of you to do
your jobs.

So my job is ultimately impacted by factoring? I doubt that.

All I have to do is factor an RSA challenge number and the theory I
now have says that with time I can do it.

"With time." The latest number factored, RSA-200, took about 75 years of
computer time using the best known factoring algorithms. As far as
anyone can tell, your algorithm runs about as slow as a random GCD
algorithm (I make the note as far as anyone can tell -- your
explanations as to how to factor S and produce n and k are very lacking).

Clearly I'm testing you people to see if you're still confident.

Sounds like you are.

If you know your math and what you know says I can't do it, then why
worry about it?

BUT if your community has been lying about my research hoping I'd
never find a way to prove that with some super dramatic discovery
that's almost yanked out of the clear blue because I am a great
discoverer then yeah, maybe you should worry.

It would seem reasonable to suppose that I can't yet do it, or I'd
stuff it in your faces.

The question is, do I have the potential?

If you know that I don't then why worry?

But if you know that I do then make no mistake, the warnings are
nearly over and when I'm done I'll make certain that no one ever tries
what you people did, again.

James Harris

What exactly is your problem with our behaviour?

You post attempted solutions to the factoring problem. We point out
that they don't work. You later agree that they don't work. What's the
big deal? Why are we responsible for your problems?

.

Relevant Pages

  • Re: JSH: Your funeral
    ... computer time using the best known factoring algorithms. ... your algorithm runs about as slow as a random GCD ... never find a way to prove that with some super dramatic discovery ... discoverer then yeah, maybe you should worry. ...
    (sci.math)
  • Re: JSH: Your funeral
    ... your jobs. ... computer time using the best known factoring algorithms. ... your algorithm runs about as slow as a random GCD algorithm (I ...
    (sci.math)
  • Re: JSH: Your funeral
    ... your jobs. ... computer time using the best known factoring algorithms. ... your algorithm runs about as slow as a random GCD algorithm (I ...
    (sci.math)
  • Re: Online poker RNG...
    ... fold, etc., etc.) and part from-the-gut (based on years of playing B&M ... "Good colluders know, as part of their colluding, how ... My particular worry is that, as was shown possible in 1999 ... knew exactly what algorithm was being used. ...
    (sci.math)
  • Re: Need Graph Isomorphism Algorithm De-bunked
    ... Phil Carmody wrote: ... Else here's an Oalgorithm which correctly differentiates all of the examples you've listed so far. ... Not to worry. ...
    (sci.crypt)