Re: JSH: Surrogate factoring, implementation

On Sep 10, 5:48 pm, JSH <jst...@xxxxxxxxx> wrote:
It is increasingly clear to me that mathematicians STILL will not
follow mathematical proof so I'm working now on the implementation of
surrogate factoring to give the demonstration that so many of you
clamor for.

That is slow going though as my solution is to have my surrogate
factoring code call itself to factor its surrogates that are being
used to factor the target.

But even that can do ok, as here's some output where I'm just kind of
typing numbers in at random:

Factors:
( 131 )( 2531 )( 10957 )( 40357 )( 682739052250888729441 )
Product: 100098765678976543215788865435214249

In coming is 100098765678976543215788865435214249

Surrogate factorization data for target:

Surrogates factored : 36
Surrogates not factored : 106
Factored fuel percentage: 25%

Data about all surrogates including those from recursions:

Factored fuel : 116306
Fuel not factored: 206
Factored fuel percentage: 99%

Processing time: 62172
Number of digits: 36
bitLength=117

------------------------------------

Ooh, I'm scared. NOT! Why? Because I ran MY program:

C:\> proof_analyze < jsh_posts.txt -O options.txt
Proof Analyzer, version 0.577 gamma, C. C. Heckman, 2006.
Reading posts .................... Done!
Analyzing content, based on options.txt:
* language: English
* bypassing "object ring" references ... Done!
* bypassing "prime counting" references ... Done!
* bypassing "kill" references ...
WARNING: 10% of available memory exhausted!
Done!
* searching for "factoring" ...
WARNING: 20% of available memory exhausted!
WARNING: 30% of available memory exhausted!
WARNING: 40% of available memory exhausted!
WARNING: 50% of available memory exhausted!
WARNING: 60% of available memory exhausted!
Done!
* using extrapolation of information ...
WARNING: 70% of available memory exhausted!
WARNING: 80% of available memory exhausted!
WARNING: 90% of available memory exhausted!
WARNING: Memory may exhaust before end of process. Compress? (y/n) y
Algorithm to use? (default gzip) cch_compression_8
+ compressing information ... Done!
Result: 23% of available memory exhausted.
+ continuing extrapolation ...
WARNING: 30% of available memory exhausted!
WARNING: 40% of available memory exhausted!
Done!
Proof-checker initiated ... Done!
Godelization enabled ...
Proof-checking algorithm main stack initialized.
WARNING: Expected running time 29275534959333053 seconds.
Continue anyway? (y/n) y
Loop 1 initiated ... Done!
Loop 2 initiated ... Done!
Loop 3 initiated ... Done!

(and here I cut out a lot of the output)

Loop 153 initiated ... Done!
Loop 154 initiated ...
Error found in derivation at node 154-9593330-5329275534265-64; not a
proof.
Running time: 34265 seconds.
C:>

So I'm not scared.

--- Christopher Heckman

.

Relevant Pages

  • Re: JSH: Surrogate Factoring Paper Accepted!
    ... Why would they change their minds between now and then? ... Warning: JSH impersonator. ... the real JSH seems to have moved on to a different factoring ...
    (sci.math)
  • Re: JSH: Surrogate factoring, implementation
    ... factoring code call itself to factor its surrogates that are being ... Factored fuel percentage: 25% ... size increases then I can put in an RSA challenge number. ...
    (sci.math)
  • JSH: Surrogate factoring, implementation
    ... factoring code call itself to factor its surrogates that are being ... Factored fuel percentage: 25% ...
    (sci.math)
  • Re: JSH: One other option
    ... give a simpler definitive test of the latest theory which oddly takes ... away any factoring of surrogates. ... Kind of odd really, but fascinating to contemplate as by the theory ...
    (sci.math)
  • Re: Surrogate factoring works very well
    ... bit much, as I had runs where it factored 50,000+ surrogates as it ... use trial factoring with a list of primes up to 1,000. ...
    (sci.crypt)