Sign into an existing account

About 2-3 steps.

I still have bills to pay so I've been at work constantly.

less than 2 days.

2 more prototype weeks.

deleted

I don't know who Virge is and I assure you this very real.

At minimum, even if you don't believe me, go buy a box of ammo and a can of spam.
At least you won't be left with your dick in your hand.

deleted

deleted

I'm going to post the entire source code for everyone.

The chans are controlled and forum slid if the u.s. government's social media monitors determine they don't want people seeing a post. Been so long since I was on 4chan, they probably just invisibly censor truly dangerous posts automatically now.

deleted

Bait comments don't matter anymore.

Secure the future of our people

deleted

It is not my purview to give financial advice. I am sure you have enough common sense to come up with some of your own ideas and consult your financial advisor.

Gold?

It is based on something close to the inversion of an algorithm called karatsuba's method.

At every digit of a number to be factored (we'll call this number we're factoring n), there are only so many numbers pq which will reproduce some number of digits in n.

Lets use an example.

Let our factors be
p = 1934063
q = 527279903

n = pq = 1019792551035889

By doing this we can note a few things. Factorization is hard according to most known methods until now.

But we know for example, that whatever p and q are, their smallest digits (1's place and 10's) place, whatever they are, when multiplied together, must produce matching the 1's and 10s place of n. The 1's and 10's place of n equal 89.
Go look at the example number again.

At minimum, whatever the unit digit (first digit) of n's factors p and q are, they must produce the digit '9' in the ones column of n.

We generate these combinations and filter for any that don't meet this criteria.
In our example case, this produces the pairs [1, 9], [3, 3], and [7, 7].
These are the only digits that p and q can have in their 1's column.
Granted this is a trivial case, because prime numbers (what we're looking to find as the factors of n) can only ever begin with 1, 3, 7, or 9. But I digress, because the method can be extended.

Next we need to find the possible digits at the tens and hundreds columns of p and q.

But we encounter a problem. Where before, a cryptographer might bruteforce factor a very large number, trying 0-9, then all the digits 10-90 in the tens column, and face combinatorial explosion, we still have multiple possible combinations to try.

My first go through had an average of 3 branches per column of a number I was trying to factor.
Sometimes this exploded to 27 branches or more.

I had to have a way to filter these branches.

My initial approach would be to append all possible digits in front of our pairs, and score them based on how many digits they matched from n.

So for example if we had the possible partial pq pairs like so..

['1', '9']
['3', '3']
['7', '7']

we might do 01x09, 11x09, 21x09, and so on, all the way up to 9199.
Likewise 03x03, 13x03, 23x03, all the way up to 93x99

Just picking at random, 93x99 equals 9207. We drop the digit at the largest magnitude (because it is often wrong, or doesn't match n, due to our estimates of p and q only being partial matches).

And if n = 1019792551035889
we can see that 93x9=9207 doesn't match any digits of n, so we can filter it.

That still doesn't deal with branching.

My next step was, for each branch, to generate all child nodes in the next largest column for p and q.
I worked with a logical AND of the binary values of the possible descendant nodes, selecting for the smallest value, and logging both the branch and child node.

testing showed that the method indicated the correct branch to choose (the correct pair of digits to append to our partial estimates of p and q) and that this is convergent.

However after the first period (the first 3 digits converged on) this broke down.

I needed a new method.

So I tried the difference of the descendant nodes, and selected the branch with the child node that had the largest positive value of this process. And it worked for each subsequent digit after that.

Entropy:

To calculate the entropy of a branch, you look at the possible pairs of its child or descendant nodes, look at each half of a pair, log all unique values for all pairs for a branch's descendants, get the square of the number of the unique possible values, get the natural logarithm of that* value, and multiply by the boltzmann's constant.

In the case of the one's column in our example, our pairs are:
['1', '9']
['3', '3']
['7', '7']

And their descendants are..
['1', '9']: ['21', '09'], ['31', '19']
['3', '3']: ['03', '63'], ['13', '53'], ['23', '43'], ['43', '23'], ['53', '13'], ['63', '03'], ['83', '83']
['7', '7']: ['07', '27'], ['17', '17'], ['27', '07']

Where the first pair ['1', '9'] has the unique numbers 21, 09, 31, 19, or four unique elements, giving us an entropy of
log(4^2)x1.380649e-23
3.8279718467716317e-23
and we can do the same exercise for the second pair, determining its unique elements are 03, 63, 13, 53, 23, 43, 83
and the second pair's entropy is thus..
log(7^2)x1.380649e-23 = 5.373237802766139e-23

and lastly the third pair's entropy is
log(3^2)x1.380639e-23
3.033573943228901e-23



In the initial case I reduced the search space per digit of n's possible factors, from 10 possible digits, to 3 unique pairs.

Most everything is explained in this comment, and this is the method at its core.

I'm currently just battle testing it especially the branch pruning algorithm, and generalizing it to run on its own instead of the manual chunks I've been modifying and running by hand up till now.

edit: replaced asterisks with x's, because the standard multiplication notation gets treated as comment formatting.

To sidestep your question, all communication relies on cryptography to ensure privacy. Cryptgraphy use multiplication of prime numbers at it's core. If you can know the prime numbers, you can decrypt the message. Being able to quickly factor a large number with only two factors, the prime numbers, would break all communication privacy as we know it.

Good question.


Not familiar with that.

Though I have reason to believe it will affect the security of elliptic curve cryptography, yes. Right now the extensions to that are all theoretic, and would probably take me four more years of throwing shit at the wall to find a solution for elliptics even with the new insights and methods.

ECM is good but only works up to a limit far below the average key size. I wrote an algorithm about a year ago that converts very large semiprimes outside the range of ecm, to composites within the range of ecm.
It was an undiscovered variation on modular exponentiation. Basically the way it worked is for a given value of i,
if you plugged it in took a semiprime pq, and returned a composite m, such that m%q = 0, but m%p = r.
In otherwords it let you find composites that shared one of the factors of n, but not the other.
And repeating this process would bring it into the range of ECM, which was a good start.

The problem was the value i had to be exactly equal to p/2.
I used some automated code to find variations that worked for values of p/4 and p/16, but they wouldn't work if the resulting composite would have factors of 3, 11, and so on.

The ECM work was interesting as an exercise, but for the given time and research effort it was ultimately a dead end.

The media is not going to exist 24 hours from now, nor will law enforcement.

Whose going to pay their checks when theres no financial system and ww3 has kicked off so governments around the world have an excuse to manage the chaos?

It's gonna be like Revelations.

We are starting Armageddon.

Actually, if I were a financial advisor, and assuming everything weren't about to go tits up, I'd hold onto mine.

World War 3.

An actual great reset. Where the governments and billionaire oligarchs will own nothing, and be happy....that they're still alive.

If, that is, they survive, and are still alive after the shit hits the fan.

I don't know about them. I'll be busy smoking a cigarette and watching the sunset and listening for the drone strike coming my way.

You n me nigga, sheit

Those of us dedicated to falling on our sword to punish those who thought they could control and own everything without consequences.

hashes can't be broken that I know of.

But online sites that secure bitcoin wallets behind things like RSA can. Not that I'd personally do that, I'm uninterested in breaking any laws.

This entire thing entirely relies on the premise that it is perfectly legal to publish mathematics, any mathematics, even if whats published is incredibly fucking damaging to governments and financial markets around the world. There is no intent to harm anyone, even if I suspect what others will do with the code.

They made dissent and violent revolt not just impossible, but censored even the right to organize to merely protest. That is what this is about. If we can't revolt even peacefully without framejobs and bust-up operations by domestic federal agencies dressing like us and committing violence, then we won't ever resort to protest, or peaceful means again.

We won't even resort to organized violence, the sort, like two fellows who come to blows, might lead to both sides calling armistice, sueing for peace, and realizing reforms need to be passed and bad faith actors need the boot.
Systems should leave room for at least a little revolt, peaceful or otherwise, as a check on when they've gone too far and have ossified too much to realize it.

There is no longer that possibility, and I have done the logistical math to be certain of that.

And so, we the american people, those of us who have had enough of the finger wagging, the calls to violence, the double standards, the raids, the lockdowns, the endless being shoved aside for global interests, the censorship, the calls to censor, disarm, tax out of exist, the untouchable status of the university-trained politicians and corporate class--thoseo f us tired of these things failing to reform or face consequences, will simply peacefully, lawfully release something that the worst elements in governments and NGOs around the world, will use to absolutely destroy each other into the digital stone age.

If any of us survive the consequences of this for the globe, no one is going to give a shit.
You're either going to be making money selling hard goods, physical arbitrage as it were, or you're going to be farming potatoes six months from now.

Remove your kippah with pride schlomo.