/vqc/ - Virtual Quantum Computer

Thread OP text is here, since I seem to have forgotten where I put it last time and had to reformat it again https://pastebin.com/3MPd1p0r

>>11620

ty for the fresh bread BO, a '''Prime Bread #".

A finalFresh Linkat the end of PB may bave been more helpful than a bleep / boop, but no worries (unless you can delete and edit?, recognize you dropped link a few posts back..)

>>11730

This is true and I didn't think of that, but surely given the size of the board and the fact that every current thread is stickied it isn't exactly difficult to find the new one.

>>11731

11731 is prime AA, a Prime Post.

If possible to delete and add, would make it clean, but either way you are board captain and we sail on!

It may take a while for others to realize there's been some activity on the board, likely aren't checking on a daily basis.

>>11732

Just left a message on Discord about it. I'll edit that post last thread in a sec.

Thanks for baking, AA.

Following along.

>>11734

Good to read you PMA, hope all is well. Any observations / thoughts from your following along? Any others aware of activity?

Will review the theta pieces from PB then need to peel off:

>>11711 (LB)

Also, related to patterns in the f value, for RSA100, f%8 = 6

We can then subtract 6 from f, and divide by 8 to get:

2102837454373724665890386895636616552526499878985

The remainder is perhaps all we need, to know that (n-1) is odd and d is even.

From RSA#11:

>>5592 (PB RSA#11, VQC)

>The remainder of f when divided by 8 is a key to what values of d and (n-1) can be used.

>>5603 (PB)

Actually this

>If f%8 = 0, then:

(n-1) is an even number.

d is even

>If f%8 = 1, then:

(n-1) is divisible by 4.

d is odd

>If f%8 = 2, then:

(n-1) is an odd number.

d is even

>If f%8 = 3, then:

(n-1) is odd

(n-1) is prime (or 9 ?)

d is odd

>If f%8 = 4, then:

(n-1) is even

d is even

>If f%8 = 5, then:

(n-1) % 4 = 2

d is odd

>If f%8 = 6, then:

(n-1) is odd

d is even

>If f%8 = 7, then:

(n-1) is odd

d is odd

Last thing today (after work tomorrow, will go through questions arising as best I can).

f-1, and two d are unique to every c.

Also (SO important) If YOU are creating c, the product of two large primes, you create two primes near each other, not too near. That's it. You then multiply them for the modulos or private key. No one thinks what value of d+n, or x etc and how utter insecurity is being chosen at thr other end.

The square d of c in this case leaves a MASSIVE signature in EVERY case. The signature gets bigger the larger the product. This self limits encryption immediately.

Prime a, it is near d (since a and b are chosen of similar length). a has no factors, none. Also, d has very few factors except two if its even. Why?

We force x is to be HUGELY smooth (the key point of the general number field sieve). We dont choose x, it is forced to be hugely smooth (smooth=made up mostly of very small prime factors). Two related reasons. Because a is prime, and a+x=d, x and d cannot both be smooth. By choosing a massive prime number, no number added for an order of magnitude to a, produces any multiple of a. The square root is d, add x to a to make d. You only choose a, one of the most unique numbers available at that size. We know d wont have many factors, no matter what is added to a.

Curious, this next is.

We now know almost any random number added to a huge prime is not very divisible. HOWEVER, the tradeoff. We DO KNOW the difference between a and d, which is x, is divisible as fuck (maths term).

How do we know? The difference of two not very divisible numbers is smooth af, esp when one is a huge prime. Any difference between that prime and any number is likely smooth.

This (simple) way for creating smooth numbers would massively improve the general number field sieve. Its not used (yet). And no point polishing your knobs.

Our Solution.

In one direction you turn sets of x to sets of n. In the other direction you do vice versa.

Your other half does this too….

We have equations for e+/- x and f and x+1. And for n-1 on the other side. Do we have enough to construct the ratio from first principles?

>>11738

Kek, linked to the "Stench Trench" post, meant >>11719 (PB).

Just thinking through why described as "corner n" vs in the center of the x+n square. Also looking back at the n0 estimate.

>>11738

Keeping in mind, that for RSA100, x is odd and n is even, so (x+n) is odd (and d is even):

>>4219 (PB #10 VQC)

>Part 3 a - Odd (x+n) - Overview

>(x+n)(x+n) = nn + 2d(n-1) + f - 1

>What does this look like?

>(x+n)(x+n) is odd

>All odd squares = 1 + 8T

>All odd square = 1 + the product of 8 triangles that are the same.

>Visualise.

>2d(n-1)

>Why is (n-1) important?

>>4285 (PB, Teach)

>(x+n)(x+n) = nn + 2d(n-1) + f - 1

>Using distributive property, (x+n)(x+n)= xx + xn + xn + nn

>So for this portion: 2d(n-1) + f - 1 = 2xn + xx

Looking at the Theta piece.

If you use, for example, 4c where c is RSA100, the same identities hold for c plus you get new ones.

4c means 4(x+n)(x+n) so all the c values hold AND the ratios, plus you get new f, n, x and 4d for two sides.

As you go to 9c, then 16 c, a new telling pattern emerges. These are not and never were integers once we took a smooth sided square from a less smooth square. How do we know this happened? We chose, we played God. Not one rare number but two. We forced two very, very unlikely events together, the product of two primes, close, not too close.

Choose a huge number at random. Make it a square. Close to one end, take a small square away so you leave a side that is huge yet not divisible by any other below it. The probability of choosing one at random is 1/ln d. x is immediately forced to be smooth AS WELL AS one next to it, with the other neighbour being the opposite to its siblings in the triplet.

We force giveaway properties and we discover integers can reveal irrational dimensions WITHIN our integer choices when using large primes.

>>11742

>We chose, we played God.

Calling on a Higher Power

Seeking (knocking).

Get some rest.

Ooh la laaaa…

>>11746

^^^ sorry:

Veritas Obtains Recording Of Call Between Wikileaks Julian Assange & Lawyer In Clinton's State Dept

I'll come back and read.

Just finished for today, in a call shortly for two to fours hours to observe the execution of an implementation. All problems so far appear to be due to lack of technical oversight.

I love a business with truly amazing people where from day one, you can identify a gap where you can add value to everyone's day.

What happens to the ratios and all are numbers under "watch when I add 2 to a?

What happens add two to just b?

How about both? All easy to calc from RSA100.

What about subtracting for the same three cases?

Proof by induction?

Does it give away a pattern?

One more thing for S&Gs.

The meaning of life is so obvious when stated that it then covers Darwin to God.

The meaning of life is simple…

"To help the young thrive."

Perfect. Once I knew it wasnt about me, it was a relief.

>>11748

>How about both?

That's two movements with (e+2n,n) but that's the only one of these I know without testing etc.

>Does it give away a pattern?

From my outside perspective you're pretty all over the place with these what ifs, so not at the moment it doesn't.

>>11749

I have a few non-math questions for you, is that alright?

>>11750

kek, you might as well just ask 'em.

They'll respond or they won't.

>>11751

It's been "they won't" every time I've posted so far, that's why I'm trying this now.

>>11752

Meh. Post the questions anyway.

Maybe it'll come up later.

>>11752

Do it.

>>11752

Doooo it

>>11754

>>11755

Okay well firstly I asked a few things in the last thread and bumped it several times and you missed each one so I'll just link the last one >>11708

I have a few more questions that I think are important to our productivity as a group but I'll post them afterwards

If we add two to a… we have (a+2)b.

a has two added

d has a one added

n is not changed

x is one lower

e is bigger

f is smaller

>>11708

>>11708

>>11708

"Hatred" was self deprecating projection. It was endearment, not the opposite.

Jacinda Christchurch.

Math:if I multiply the golden ration by the number 100000 and only deal in integers, and then starting again used the same ratio on 1,000. Understand it?

>>11758

Thanks for answering. I think I kinda get the k thing. Two more non-maths questions, although if you do continue posting about numbers in the meantime I'll try to follow along.

You've stopped using a trip and as a result it's very easy for people to go anonymous and pretend to be you to disrupt the board. It's happened several times. It wouldn't happen if you would start using a trip again and also if you continued to use it, but last time I asked why you weren't using a trip, despite having provided ample reason for you to use one, you just said "where we're going we don't need trips" and didn't answer any other questions about it. It would really help all of us, including yourself, if you would start using a trip again. What the deal with this?

I have one other question about meta stuff but I'll keep this to one question per post so it's less of a cluster of questions all at once.

Hello Anons, just finished catching up!

Great to see you pumping out work and ideas, MM.

Glad to see you back Senpai!

I'll have time to work later. My immediate thought on the ratios is this:

xx+e=2na for row 1 (a) values

The growth of (a) in (e,1) or (-f,1) for any given c should somehow contain the ratio being discussed. Since it's related to e, 2d, f, etc.

Be back, thinking over all the new ideas. Good to engage the brain with you all!

>>11759

>>11758

>"Hatred" was self deprecating projection. It was endearment, not the opposite.

Time to get your inner Farey on AA. Not being im-Polite at all, nor Deficient, just Practical. Ok, will go back to drawing Sierpinski triangles..

>Thanks for answering. I think I kinda get the k thing.

Go on..

>>11758

>only deal in integers

And fractions, continued..

In looking at some of the smaller examples, can see why for years now, it's been suggested to work at a larger scale.

But on the topic, will share a decimal example from our 6107 friend (not to ignore 1167).

6107: {23:36:78} {47:31:197}

Apart from the significant variation with the approximation ratios compared to larger numbers, this popped out:

x/n ratio: 1.305555..

but the 2d/x ratio = 3.31915 is actually: 3 15/47

And what is the denominator 47? 'x'

Also to be found at the t(24) position in n=1, 36 steps away from… Coincidence?

>>11760

>The growth of ..

yessss..

Be back for a bit after a byte.

>>11736

>We force x is to be HUGELY smooth (the key point of the general number field sieve). We dont choose x, it is forced to be hugely smooth (smooth=made up mostly of very small prime factors). Two related reasons. Because a is prime, and a+x=d, x and d cannot both be smooth. By choosing a massive prime number, no number added for an order of magnitude to a, produces any multiple of a. The square root is d, add x to a to make d. You only choose a, one of the most unique numbers available at that size. We know d wont have many factors, no matter what is added to a.

Here's a curious combination idea based on many of the concepts we've worked on as a team.

Just having fun brainstorming over here.

The ideas here come from the c'= q * c explorations we worked on.

It also combines the binary search ideas AA and I have worked on.

if x is massively smooth (made up of mostly small prime factors)

and d - x = a

Then use small primes to iterate/build x. (in the same way that q is built)

Subtract each iteration of x from d, building a table of potential (a) values, with x<d

Complexity and size stays low since we're multiplying increasing small primes (like we did with c' = qc)

For RSA 100, I think we'd end up with <1000 entries for the table (?) IDK on this part.

Not too big anyhow relative to c.

Check each potential (a) value in the table using the binary method AA and I worked on.

Except it would run a bit differently.

It would start at the right hand bit and work left, building each (a) value looking for a match.

We would not have a BigN match to start with, only the idea that primes appear in binary as a tag.

The prime should appear in binary only when the potential (a) value is odd.

Even (a) values can be eliminated from the table.

The binary method runs for each bit of each entry, testing for a match for (a prime).

Maybe the (a prime) value appears more than once in the table?

So for planning and working, here's a few helpful numbers:

RSA100 d

39020571855401265512289573339484371018905006900194

RSA100 x

1045343918457591589480700584038743164339470261995

RSA100 a

37975227936943673922808872755445627854565536638199

>>11641

Hopefully I can post now.

VA, special thanks for your service.

I'm still on calls with new client for the second night in a row, (started the day 16 hours ago.

VA, thank you for everything you do.

Thank you AA for the new bread.

And so, if two is added to a, x is decreased by one (usually).

This means adding two b to c.

n doesn't change in this instance for n and rsa100.

fm1 decreases by roughly 2x+4n (d is 2a + 2x, 2b is 2a + 4x + 4n)

2d increases by 1

fm1 decreases (for rsa 100 and any other numbers not reaching a limit)

The ratio for 2d%x increases by 76 (74 x values got smaller by one, d increased by 1, there are two of them, equal 76)

This is the important one. The change in ratios. You can have all the theories you want or need and without having examples of rates of change, you cannot test.

We know the ratio is almost unchanged if two is added to a. First reaction is look at what has changed much and what hasn't much.

f and e have changed by multiples of x+2n, and in an enviroment where that's one of moduli, the fact that f and e are changing the most, well, treat every new piece of interest with caution.

There is a ratio of things we know. At first I thought it might be one of those ones that bounce round values (orbit) until they settle on the right value (hint).

I started with something like…

Next = This - (d-this)/2 (in my first example it was fm1 for "this"). Something like Lorentz would have done later.

You know I'm getting ready to drop the bomb.

>>11747

Assange and Soros and Clinton?

>>11762

This is very clever.

Remember the clever steps.

It was hard to construct (x+n)(x+n) from e and d, then we knew it was f.

Then taking care of the n square in the corner was the WORST.

Then with moduli x and (x+2n) we removed the need for the corner n square without removing it's function as a check.

Then we discovered the self similarity of 2d to x and x+2n and nm1. This was MASSIVE because we had gain of function where we could a set of x and make it n with f or vice versa AND we could take a different set of x and make it n with x and vice versa.

What is it? It is not as complicated as it sounds and it looks a bit like a Lorentz transformation from physics.

Love the energy here! I'll read over the last posts of #18 and this one later, but again, nice to see some activity!

>>11618

Much love AA! You've been our ball buster and I have always loved you for it!

>>11763

Hello

>>11760

>>11761

>>11759

>>11753

You'll do it. It is as inevitable as the second term.

And you'll have earned it.

Thank you. The mask comes off soon.

>>11764

>>11765

>>11768

Need to put this under some scrutiny, but this looks like a lions roar to me.

>>11769

I have three other questions that I think would be useful for our productivity, if you wouldn't mind answering the thing I posted above about using a trip and then we can get it all out of the way.

Is the VQC a 0 Player Game?

>>11763

>>11764

>>11765

Hey Math(s) Bossman.

Love this quest and you.

Thank You for your special service.

Still here, still working.

Thanks for saying Thanks!!

I am a joke to my family and friends.

For Q and VQC.

Thanks a lot, and fuck them.

Thanks for acknowledging my service. It has cost me a lot personally.

As a Hero's Quest should.

Nothing is Free.

Let's keep unwrapping ideas.

I'll get to work on these:

>>11763

>>11765

Thanks for showing up. Maybe the timeline is right now, we appreciate your encouragement!

>>11775

Sorry for venting so hard Anons.

The proper statement is this:

"Everything Is Free"

Just find P=NP

That's our Quest.

>>11777 (nice numerals)

>Do you have a formula / method to find the initial 'x' value for t=1 in the 'f' columns where n=1?

Do you mean x=2t-2 or 2t-1? I can't tell if you're having a brain fart or if you meant to explain a different concept. x is always either 0 or 1 where t=1, regardless of n.

>>11778 ty. You've really gotten the hang of those deep dream image manipulations.

>>11780

I think you're talking about finding the first valid x for (f,1), not just the first x in general. Just in case we're not talking about the same thing I'll explain the concept behind what I think you're talking about. t doesn't equal 1 in every first visible element. t is calculated with the formula I posted and has been forever. It isn't t=1,2,3,4,5… for every single cell in the grid. t values get skipped everywhere. The only place where t=1,2,3,4,5… happens is (e,1). In other (e,n) and (f,n) it's never t=1,2,3,4,5, it's more like t=3,7,14,18,25 type patterns. In (f,1), the first valid x increases depending on the size of f. For f=-1 through f=-12, the starting t values are 2,2,2,3,2,3,2,3,3,3,3,4. They're the first visible, valid elements in these cells, but that doesn't mean their t values are 1. Are we talking about the same thing? I seem to remember there being a way to calculate what the first t would be just based purely on knowns for one of these cells (or at least someone tried to figure it out). It might be in the Grid Patterns thread somewhere.

>>11783

> It was validated with a grid that went up to n>2000.

Correction, up to n=265. (Was thinking rows, as there were multiple t for each n. Actually used t=1:25, so just over 6600 total rows (not all elements generated, as some exceed max i in the grid code loop so those cells are truncated early).

>>11785

>How dafuq do I convert them to the cool matching decimal fractions?

Good for you VA.

Not sure best method for C#, but there's this that may be of use:

https://stackoverflow.com/questions/10359372/is-there-a-bigfloat-class-in-c

The answer there may get you to both the decimal and rational forms.

>>11783

>Was this something we figured out, or was it provided by CC (in earlier days, with a valid trip!)?

>>11779

I had that in notes with the formulas, thanks. There was discussion in RSA#14 here (second post being yours):

>>8356, >>8358 (PB)

If it's not too much trouble to determine for e0 if the n cells follow the t=1,2,3,4,5… pattern versus the more "random" t=3,7,14,18,25 pattern, that would be helpful. I know you said (e, 1) only, but hoping perhaps (0, n) column works.

Thought my n0 column was working in code, as described above with the x_base matching the grid output, but just checked output against the grid and there are issues so it may not have been implemented properly (methodology is working in excel). It was a while back and dusting it off, so coming back slowly..

Let's raise the stakes, Lads,

$200k cash prize for solving this.

https://en.wikipedia.org/wiki/RSA_numbers#RSA-2048

Calcs for d, e, and f are mine.

Please check for accuracy.

Let's get to work.

RSA-2048 c=

25195908475657893494027183240048398571429282126204032027777137836043662020707595556264018525880784406918290641249515082189298559149176184502808489120072844992687392807287776735971418347270261896375014971824691165077613379859095700097330459748808428401797429100642458691817195118746121515172654632282216869987549182422433637259085141865462043576798423387184774447920739934236584823824281198163815010674810451660377306056201619676256133844143603833904414952634432190114657544454178424020924616515723350778707749817125772467962926386356373289912154831438167899885040445364023527381951378636564391212010397122822120720357

RSA-2048 d=

15873219105039120417448250866106300757935846344480971579572662775357997008074994840278643259568101132671402056190021464753419480472816840646168575222628934671405739213477439533870489791038973166834068736234020361664820266987726919453356824138007381985796493621233035112849373047484148339095287142097834807844

RSA-2048 e=

24943949390901314559086911407647914585714989304941991707499366457683225400500519600706115577985727695524080823890532002943893465312816169046556231697018051552258242648312035810536294853601420823376294014177709558002788792535040182795837560995474291629808457101467051000284078801254653722789659986321509056490101380103563714470617244692882005651448372635460177207128747640990360359716268326444560340457818822465695973580080183089801154577153055685206470161899420076208154943348665238647007714095089342669905666884517354400122833485897064098153958317993833609635063079613328500485188782423277886515290863800949716792021

RSA-2048 f= 2d+1-e

2d=

31746438210078240834896501732212601515871692688961943159145325550715994016149989680557286519136202265342804112380042929506838960945633681292337150445257869342811478426954879067740979582077946333668137472468040723329640533975453838906713648276014763971592987242466070225698746094968296678190574284195669615688

2d+1=

31746438210078240834896501732212601515871692688961943159145325550715994016149989680557286519136202265342804112380042929506838960945633681292337150445257869342811478426954879067740979582077946333668137472468040723329640533975453838906713648276014763971592987242466070225698746094968296678190574284195669615689

f = 2d+1-e =

-24943949390901314559086911407647914585714989304941991707499366457683225400500519600706115577985727695524080823890532002943893465312816169046556231697018051552258242648312035810536294853601420823376294014177709558002788792535040182795837560995474291629808457101467051000284078801254653722789659986321509056490069633665353636229782348191149793049932500942771215263969602315439644365700118336764003053938682620200353169467700140160294315616207422003914133011454162206865343464921710359579266734513011396336237529412049313676793192951921610259247244669717818845663470092370862430259490036328309589837100289516754047176332

https://en.wikipedia.org/wiki/RSA_numbers

I'm back to work on RSA100 now.

>>11792

Sounds good VA. Funny, just woke up 10 mins ago. Fun dreams, lucid. Will share in a bit..

>>11794

> saw something interesting with 145 so going to look at that first.

Think a consequence of the small numbers for the 145 test case, didn't hold up for 6107.

Moving on, thought this may have been a hint related, likely read into it way too far, but just checking the channels..

>>11693 (PB)

>There's a simple win. Understand what is needed in this event. There are several things straightaway. Then we go… t'da. Simple signal processing across several frequencies its liks the Dawn Chorus.

Thought the t'da could be "t da" related.

Dawn Chorus - d^2, c^2?

>>11789

>Calcs for d, e, and f are mine.

>Please check for accuracy.

Seems a good exercise to validate BigInt precision.

Your c agrees, but getting a different d value (hence e and f will be different):

d =

158732191050391204174482508661063007579358463444809715795726627753579970080749948404278643259568101132671402056190021464753419480472816840646168575222628934671405739213477439533870489791038973166834068736234020361664820266987726919453356824138007381985796493621233035112849373047484148339095287142097834807844

A difference of:

142858971945352083757034257794956706821422617100328744216153964978221973072674953564000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

Which looks odd as well. Think this may have been done another time in an earlier thread, but perhaps someone else will validate?

>>11789

>>11796

VA - think it may be a copy-pasta issue.

Check if the gap shown here doesn't solve it for you (there would be a "2" missing right after the "404" kek).

dVA=big"158732191050391204174482508661063007579358463444809715795726627753579970080749948404 78643259568101132671402056190021464753419480472816840646168575222628934671405739213477439533870489791038973166834068736234020361664820266987726919453356824138007381985796493621233035112849373047484148339095287142097834807844"

..49948404 7864325..

..4994840427864325..

>>11794

>Going to focus on theta and unpack this post from #18: >>11711 (PB)

Working through the notation without benefit of the pics to illustrate.

>>11711

>The pic below shows ..

>(Had to cut the pic)

Image posting issues for the site were short lived on 12/15 - would be helpful if you could come back and post the images.

>shows 2d with all x removed to leave theta x.

Reads like it would be: theta_x=2d%x

but actaully, it's the ratio (the 0.65595 remainder)

There were 3 formulas for remainders:

r1 = 2d/x

r2 = (2n+x)/(n-1))

r3 = (2d/(2n+x))

The 2nd gives the most accurate remainder "theta" for the calculations, and the 3rd gives the proper integer value (72 for RSA100, 85 for RSA110, etc.):

x_calc = (r3_int*(nm1)+theta*(nm1)) -2

The (-2) was mentioned previously.

One other piece of interest:

>>11719

>We are focusing on the square of x+n without the corner square of n.

xpnsqmnsq = (x+n)(x+n)-(n)(n) = x(x+2n)

x*(x+2*n) = fm1 + 2d*(nm1)

Have a good holidays all.

Kekkin

>>11736

>Last thing today (after work tomorrow, will go through questions arising as best I can).

Good afternoon, if still Q&A time, hoping for clarification regarding "double-theta n-1", in:

>>11711 (PB)

>Would that mean fm1 MUST be divisible by double-theta n-1?

Have the factors for fm1 (5 * 19 * 4488130363987 * 11079829100092583 * 3561013012572873623), but not working as a clean moduli with fm1.

Also, can you clarify that for RSA100, "1-theta" is simply "0.3440496.."?

>>11759

> I think I kinda get the k thing.

Anything to share AA?

>>11749

>One more thing for S&Gs.

>>11801 (Prime Post)

>Kekkin

Glad to S&G's are working for you, enjoy!

spitballing..

>>11754

>Do it.

>>11755

>Doooo it

o to oooo, c to 4c?

>>11802

>Anything to share AA?

I have IRL stuff taking up my time at the moment so not yet, Chris said a lot last thread that I haven't gone over yet

>>11803

Thanks AA. Have a window now to work on this before IRL takes over as well. Have gone through PB and unpacked as able. If you'd like to collaborate am happy to share.

>>11803

>Chris said a lot last thread that I haven't gone over yet

Indeed. A humble suggestion. Look deeper, with humility and love, at what is being shared. Shed the angst, and be willing to 'c' beyond. You said it very well:

>>11485 (PB)

>the best way to move on from this is to get back to discussing the thing we were distracted from.

So, many examples last thread.

>>11673 (PB)

>And we will be back for circle to the grid and ..

now was this supposed to be "back FULL circle"..

or "FOR" circle as written?

Interesting to note, that current research in Computational Geometry "treat[s] circles and spheres" on the same footing as points, lines and planes.

>>11557 (PB)

> Its a number space that includes the use of the golden and silver ratios and in this case, triangles, the true intermediary between lines and area.

Triangles. Spheres. Hmmm…

The point, is that much of what is written is subtle, and if one doesn't approach with respect, it is completely lost.

How many think DJT is a moran, is stooopid, with silly missspelling of Covfefe and such in twats? Are there others that approach with respect and deference, and find meaning in the content? Could the same apply here, where in a cloud of frustration / angst / weariness / etc, it is lost?

Consider the Stench Trench. What a wonderful and enjoyable post. Just one bit to start:

"MeAgain Markle"

Is that "MeAg.." as in My GOLDen? or is the "A" significant, as inaa? Maybe even calling you out, it is the AA that is highlighted??

Kipper Trench.

Apart from the keks, what does "K", "T" signify? Anything? If it were me that held the keys to 2048 and beyond, then yes, it likely wooood.

Let's keep going with >>11726 (PB)..

"You then 100% commit to Meghan Markle rhyming with Kipper Trench."

rhyming with = congruent with, along the lines of…

"This is squaring "thinking past the sale".

(e.g. starting with the end in mind and working backwards, the key to cracking N=NP).

You plant the negative thought (-f space?). You then associate it with something negative and cause an argument over whether it is true."

That is a JAM PACKED sentence if you're following! (btst >>11678 anyone??)

Ok, back to the unpacking of the Kipper Trench..

"Second order."

Is this derivative? Rate of change? That has been a VERY clear theme with the ratios piece.

"Result: … MeAgain Markle …through random arguments about rhymes,…"

'c' the result??

"Its always about rates of change, however abstract."

It doesn't get any more concrete than that!

>>275

>Those who possessed the ability to see into the future when taking awareness spectrum narcotics were considered prescient. Spacing Guild Navigators were capable of such abilities, as were some members of the Atreides genetic line.

>→ "Future shows past" ~Q

>>710

>All of us are only limited by our belief and our Faith.

>You have what you need.

>Godspeed Anons.

>Love Always.

>>12

>Let's have some fun.

>>17

>The delivery will still take some time as it is important to step through.

>This is for everyone, it is bigger than me.

>The potential of Virtual Quantum Computers and unlocking the potential of P=NP is vast.

>These VQCs exist as mathematical objects.

>Note that these can be thought of as part of aHigher Power, since mathematics is Invariant and pre-dates our existence.

>Others may want to walk this path so I appreciate your patience.

>As long as this space is maintained as free, it would be Good to complete this beginning by Christmas.

Time has come to wrap this up. 5:5.

ps - ty for the squares_2 image in the OP, very helpful reminder!

>>11797

>>11796

>there would be a "2" missing right after the "404" kek

Thanks MM! I appreciate your help. I'll re-run the calcs for d,e, and f for RSA-2048.

>>11798

>Reads like it would be: theta_x=2d%x

>but actaully, it's the ratio (the 0.65595 remainder)

This is a great post, MM. Thank you, it finally helped me solidify my understanding of the theta x ideas.

>xpnsqmnsq = (x+n)(x+n)-(n)(n) = x(x+2n)

>x*(x+2*n) = fm1 + 2d*(nm1)

I've been brainstorming diagrams for the new theta x ideas.

>>12

>Let's have some fun

Agreed!

MM, thanks for bringing peaceful and well thought out ideas to the board. My mind is working on this even during work and family times. Great to have you back when we're all exhausted, bringing work, ideas, and a positive thoughtful attitude.

>>11806

ty VA. >>11467 think of you at times and send good vibes.

One thing about you, is I respect your Faith. Will never forget your post here:

>>5065 (PB RSA#10)

>..Here's a good video for tonight.

>https:// youtu.be/xFntFdEGgws

Holds then, holds now. Just archived that offline, 5.5MB, took a second.

But, it's not blind Faith, but that based in reason. Much respect to your post here:

>>11305 (PB)

>Get lost, poser VQC Faggot. We have real Schizo Math to do

>These two posts are pure bullshit. Look, VQC may be stalling, posting bullshit (as he does), or acting Crazy. That's why we're all here. We're a bit crazy too. He got his ass banned from /cbts/ for being Crazy. However, don't try to fuck with us on the basic principles and variables of the problem, bc we have those memorized.

Difference between Faith and Blind Faith. That based on REASON. Does a post hold? Is it consistent? Does it provide new insight? Can it be validated as TRUE?

We don't need no fuggin trips, it's by our fruit we'll know one another.

Wish current window wasn't closing, having fun working on this again. Am here this evening, will post some work to help others who may be lurking or come by in the future.

For AA:

>>7689 PB (AA)

>My ass. 22222268356688393753

Hey AA, here are your factors:

22222268356688393753 =

2222223827 * 10000013539

Fun digits there!

>>6742 (PB) VQC

>When at least one regular or two anons confirms they are happy with the constructibility of cells to be zero or infinite in elements, we'll move on.

How many times have we dropped the ball? So much bitching, but really, we often don't do our homework.

Maybe will go back to that one right now - valid and constructible cells.

Here's one, given you posted on RSA2048 (will monitor this >>11586 tonight should you wish to take your coding work out of this thread):

>>6746 (PB) VQC, RSA #12, snipe post.

>Anyone want to show:

>RSA 2048

>c=RSA 2048

>d=

>e=

>BigN=

Sure, will post some parameters on RSA2048. Maybe will bring CC back to the fray for a post or two…

Based on a=1 (obviously, for NOW..)

c = 25195908475657893494027183240048398571429282126204032027777137836043662020707595556264018525880784406918290641249515082189298559149176184502808489120072844992687392807287776735971418347270261896375014971824691165077613379859095700097330459748808428401797429100642458691817195118746121515172654632282216869987549182422433637259085141865462043576798423387184774447920739934236584823824281198163815010674810451660377306056201619676256133844143603833904414952634432190114657544454178424020924616515723350778707749817125772467962926386356373289912154831438167899885040445364023527381951378636564391212010397122822120720357

d = 1.58732191050391204174482508661063007579358463444809715795726627753579970080749948404278643259568101132671402056190021464753419480472816840646168575222628934671405739213477439533870489791038973166834068736234020361664820266987726919453356824138007381985796493621233035112849373047484148339095287142097834807844e+308

e = 1.49730827186590819409161975355863102499674499386960841184873248110419525705142414412560340457818822465695973580080183089801154577153055685206470161899420076208154943348665238647007714095089342669905666884517354400122833485897064098153958317993833609635063079613328500485188782423277886515290863800949716792021e+308

e gap = 0.0

a = 1

b = c

f = -1.67733554914191588939803041966262912659042427502658590406580007396740414456357482395996946061317379799646830532299859839705684383792577996085866988545837793134656535078289640420733265486988603663762470587950686323206807048078389740752755330282181154336529907629137569740509963671690410162899710483245952823668e+308

x = 1.58732191050391204174482508661063007579358463444809715795726627753579970080749948404278643259568101132671402056190021464753419480472816840646168575222628934671405739213477439533870489791038973166834068736234020361664820266987726919453356824138007381985796493621233035112849373047484148339095287142097834807843e+308

n = 1.2597954237828946747013591620024199285714641063102016013888568918021831010353797778132009262940392203459145320624757541094649279574588092251404244560036422496343696403643888367985709173635130948187507485912345582538806689929547850048665229874404214200898714550321229345908597559373060757586327316141108434993615859020166427425368088424069958780819853230147577508164643339364712441831390650677628862077837124697517250971910788373374647441598985076306038901094587160385923033013611772476591818466822702222519806172328865872316642926190459725502720591581076567956723729060778728578126316270798047266909911419313225552335e+616

c 4k+1 if = 0: = 0

>>11807

Should have posted in INTEGER format:

c = 25195908475657893494027183240048398571429282126204032027777137836043662020707595556264018525880784406918290641249515082189298559149176184502808489120072844992687392807287776735971418347270261896375014971824691165077613379859095700097330459748808428401797429100642458691817195118746121515172654632282216869987549182422433637259085141865462043576798423387184774447920739934236584823824281198163815010674810451660377306056201619676256133844143603833904414952634432190114657544454178424020924616515723350778707749817125772467962926386356373289912154831438167899885040445364023527381951378636564391212010397122822120720357

e = 149730827186590819409161975355863102499674499386960841184873248110419525705142414412560340457818822465695973580080183089801154577153055685206470161899420076208154943348665238647007714095089342669905666884517354400122833485897064098153958317993833609635063079613328500485188782423277886515290863800949716792021

n = 12597954237828946747013591620024199285714641063102016013888568918021831010353797778132009262940392203459145320624757541094649279574588092251404244560036422496343696403643888367985709173635130948187507485912345582538806689929547850048665229874404214200898714550321229345908597559373060757586327316141108434993615859020166427425368088424069958780819853230147577508164643339364712441831390650677628862077837124697517250971910788373374647441598985076306038901094587160385923033013611772476591818466822702222519806172328865872316642926190459725502720591581076567956723729060778728578126316270798047266909911419313225552335

d = 158732191050391204174482508661063007579358463444809715795726627753579970080749948404278643259568101132671402056190021464753419480472816840646168575222628934671405739213477439533870489791038973166834068736234020361664820266987726919453356824138007381985796493621233035112849373047484148339095287142097834807844

x = 158732191050391204174482508661063007579358463444809715795726627753579970080749948404278643259568101132671402056190021464753419480472816840646168575222628934671405739213477439533870489791038973166834068736234020361664820266987726919453356824138007381985796493621233035112849373047484148339095287142097834807843

a = 1

b = 25195908475657893494027183240048398571429282126204032027777137836043662020707595556264018525880784406918290641249515082189298559149176184502808489120072844992687392807287776735971418347270261896375014971824691165077613379859095700097330459748808428401797429100642458691817195118746121515172654632282216869987549182422433637259085141865462043576798423387184774447920739934236584823824281198163815010674810451660377306056201619676256133844143603833904414952634432190114657544454178424020924616515723350778707749817125772467962926386356373289912154831438167899885040445364023527381951378636564391212010397122822120720357

f =-167733554914191588939803041966262912659042427502658590406580007396740414456357482395996946061317379799646830532299859839705684383792577996085866988545837793134656535078289640420733265486988603663762470587950686323206807048078389740752755330282181154336529907629137569740509963671690410162899710483245952823668

>>11789

>>11808

VA, they were also posted in RSA#13 by

AA >>6753 (PB), 3DA >>6766 (PB), and anon >>6916 (PB)

PrimeAnon wrote a Java package "BigNumTester" >>6794 (PB) available here:

https://pastebin.com/PxKGHme8

You may find this paper helpful (PDF link):

Square roots of un-factored RSA Challenge numbers, January 2016

DOI: 10.13140/RG.2.1.1249.0001

Y. Kirani Singh, C-DAC Silchar

Long division method has been implemented to compute the square root of positive number. It is deterministic algorithm and it gives the best result for any digit computed as compared to approximation method such as Babylonian or Newton-Raphson’s method. The long division method can be extended to compute the nth root of any positive real number of any magnitude up to any desired precision. Following are the square roots of so far un-factored RSA challenge numbers, which may be of interests to researchers who are desirous of factoring RSA Challenge numbers.

https://www.researchgate.net/publication/294548548_Square_roots_of_un-factored_RSA_Challenge_numbers

Here is the set of root values in the document:

One attribute of the factors a and b, is that each RSA number is the product of two randomly chosen primes of approximately the same length.

Another constraint is these primes were both chosen to be congruent to 2, modulo 3, so that the product could be used in an RSA public-key cryptosystem with public exponent 3.

I wonder when Brexit officially happens…

Seems there's "a deal" in place…

What makes more sense?

The factors of 2048RSA?

A signed message with 2048RSA?

All the RSA numbers used to sign messages?

Signing sends more than one message.

By signing with the private key rather spilling secrets, you could take some reward for efforts.

I'm neutral on money. Dont need any. Happy to vault all this while we fully explore just the sheer ramifications of what we found.

One thing I will re-iterate. Some professors expected this. Some knew. Math is not fit for purpose.

In the End P and NP.

>>11811

This

>>11810

They will come here quickly.

Things will happen fast.

RSA100.

Divide two d by x. Remainder?

Divide x by n? Remainder?

The ratios are identical.

HERE IS GOLD. GET READY.

Integers…

Two d times 10000..00 divide by x = 74.65595…

x times 1000…00 divide by n

72.65595…

Indentical MANTISSA.

EVERYTHING IN NUMBER THEORY IS MISSING THE SYMMETRY.

74.65595 2d mod x

73.66000 zm1

72.65595 x mod n

This is true for all c.

Not the numbers.

The number of n in x is two less than x in two d, ratio after decimal point same.

No

More

Secrets.

Yeah it doesnt mean that. Just means dont give to Hillary unless you want docs to smell of kipper trench.

Remember.

You want to decrypt?

ab used to encrypt.

Need to know Euler tortient for two co-primes.

(a-1)(b-1), this gives the identity when combined with the original or you can decrypt.

z=73.60… what is nm1 times z or x times z. Z is part of f…

>>11816

This was when z was still just a "thingy" instead of being the key to everything.

Perhaps like Patrick Stewart in Extras, before she can get her knickers up (got the time, uncertainty principle applies to place.), I've seen everything.

>>11817

>when z was still just a "thingy" instead of being the key to everything.

>>11704

>f = 2z + 2x

z = (f - 2x) / 2

>>11816

>Would love to share it with you.

thanks nigger

Since we're hunting for ratios, I've been playing around with the knowns.

Got very close to a match for our missing remainder for RSA100, but it's definitely not 100%.

Here's the method I used:

RSA100

2d+1 / e =

2.12023394290853826381

2d+1 / f =

1.89267068394984815291

e ratio - f ratio =

0.2275632589586901109

correct remainder = 0.65595…

0.2275632589586901109 x 3

(used 3 just to see if it came close to a match, since VQC had "1/3" in a line from his program screenshots, 3 is the reciprocal.)

0.6826897768760703327

Close but no cigar. However, I'm going to continue playing with the knowns and calculating ratios.

If we can find the correct remainder (with the knowns), we can iterate to solve.

>>11821

Another workable idea:

You skilled program anons can probably beat me to it, just brainstorming ideas over here.

"once you c i[t] you can't un [c] it"

I'll be creating these elements to check the ratios:

(-f na transform) and (e na transform) elements

(c * N-1) and (c * N)

These full elements provide e, n, d, x, a, b

maybe 2d div x and 2d mod x share the same properties?

Somewhere in the grid lies the shortcut. Somewhere in row 1 lies the shortcut. We find the correct remainder, we solve the problem.

>>11822

>maybe 2d div x and 2d mod x share the same properties?

To clarify, I meant that maybe different elements derived from the same c value would share the same ratio and remainder, per the latest posts:

>>11814

>HERE IS GOLD. GET READY.

>Integers…

>Two d times 10000..00 divide by x = 74.65595…

>x times 1000…00 divide by n

>72.65595…

>Indentical MANTISSA.

>EVERYTHING IN NUMBER THEORY IS MISSING THE SYMMETRY.

>74.65595 2d mod x

>73.66000 zm1

>72.65595 x mod n

>This is true for all c.

>>11812

>A signed message with 2048RSA?

>Signing sends more than one message.

Have been thinking about this.

Suggestion: Take 'a' from one RSA number, and 'b' from a second, to create a hybrid: so the RSA-02300240 key would use RSA-230 'a' and RSA-240 'b'. Benefit of these primes being congruent to 2, modulo 3, so that the product can be used in an RSA public-key cryptosystem with public exponent 3.

When solved, will drop a simple "Hello World" type message here. Anyone able to, can reply in kind.

Do you have a message to share? Future proves past…

>>11814

MANTISSA: the part of a floating-point number that represents the significant digits of that number, and that is multiplied by the base raised to the exponent to give the actual value of the number.

r=0.655950384; base=10; 9 decimal digits long

r_int = r*10^9 = 655950384

>>11815

>Euler tortient for two co-primes.

Dove into that the other day. Interesting, still working through it. Is the added r for ratio?

>>11822 VA

>You skilled program anons

30min of your time: >>11809

HAPPY NEW YEAR!

>>11816

u wrotr this code specifically for this post

lmao nice larp

Fast Inverse Square Root— A Quake III Algorithm

>>11827

https://en.wikipedia.org/wiki/IEEE_754

The IEEE Standard for Floating-Point Arithmetic (IEEE 754) is a technical standard for floating-point arithmetic established in 1985 by the Institute of Electrical and Electronics Engineers (IEEE). The standard addressed many problems found in the diverse floating-point implementations that made them difficult to use reliably and portably. Many hardware floating-point units use the IEEE 754 standard.

The standard defines:

-arithmetic formats: sets of binary and decimal floating-point data, which consist of finite numbers (including signed zeros and subnormal numbers), infinities, and special "not a number" values (NaNs)

-interchange formats: encodings (bit strings) that may be used to exchange floating-point data in an efficient and compact form

-rounding rules: properties to be satisfied when rounding numbers during arithmetic and conversions

-operations: arithmetic and other operations (such as trigonometric functions) on arithmetic formats

-exception handling: indications of exceptional conditions (such as division by zero, overflow, etc.)

IEEE 754-2008, published in August 2008, includes nearly all of the original IEEE 754-1985 standard, plus the IEEE 854-1987 Standard for Radix-Independent Floating-Point Arithmetic. The current version, IEEE 754-2019, was published in July 2019.[1] It is a minor revision of the previous version, incorporating mainly clarifications, defect fixes and new recommended operations.

>>11830

Innovative approaches VA, and some nice crumbs to pull out. Am exploring patterns in f at n=1 for various [t]. Holler if you need anything.

>>11831

>>11830

For c=6107, na=1116, nb=7092.

in f, n=1, the [t] values are 17 and 52. These are (n-1) [t] values apart (35).

The x at t=17 is 48, or x+1.

f n [t] f n d x a b c i j

-134 1 17 134 1 1133 48 1085 1183 1283555 1134 49

-134 1 52 134 1 7013 118 6895 7133 49182035 7014 119

Grid records (e,n) [e:n:d | x:a:b | c], (f,n) [f:nf:df | xf:a:b | c]

[ 23 : 36 : 78 | 47 : 31 : 197 | 6107 ]

[ -134 : 35 : 79 | 48 : 31 : 197 | 6107 ]

and BigN

Grid records (e,nN) [e:nN:dN | xN:aN:bN | c], (f,nN) [f:nfN:df | xf:a:b | c]

[ 23 : 2976 : 78 | 77 : 1 : 6107 | 6107 ]

[ -134 : 2975 : 79 | 78 : 1 : 6107 | 6107 ]

Ahahhahahahahahhahahahhahahahhahahahahahha It’s 2021 And You Guys Still Think VQC Is Serious

A

Final Plan.

Thank you for your time and attendance.

The messaged signed by the private key RSA2048 will read…

"/pol/ is always right ambassador djt trump is afforded protection 1 am the first and last 1 am the angel of death"

In ascii when decrypted.

The asking price for the technology will be 2 billion usd to be shared among you equally or according to your works.

Subsequent technology will be gifted to the organisation nominated by the Trump family.

For God, Trump and Flynn

>>11839

You know if you posted that with a trip you'd have an extra layer of identity proofs

>>11839

>>11840

Glad the meet-up beers are going to be covered!

Hello Anons.

I've been thinking for days about a potential solution path, and I have something interesting to share with you all. I've checked with small c values, and it's providing some really interesting data.

The concepts use almost every piece of info and method that VQC showed us. I'm going to sketch out the concepts here, and then we can work on exploring it with larger numbers as a team, for anyone who's interested.

"E"

For any given semi prime c, there are 3 locations where factors/factorizations occur in e

1. (e,1) Row 1 contains (an) and (bn)

2. (e,n) prime solution

2. (e,N) 1,c

One of the only pieces of information we have from the Grid about (e,n) is how d and f behave/change in relation to a change in e.

for any given semi prime c:

In (e,1), (e,n), and (e,N):

We know the following:

(e+2n) = delta e (a measurable change in e of 2n)

2(n-1) = delta (a measurable change in f of 2(n-1) for the given 2n change in e)

"N"

The way we force the grid to provide the information we need:

We move laterally in (e,n) without knowing x,a, or b.

How do we do that? We multiply c and create change in c,d,e, and f.

"D"

we multiply c to make it larger.

This changes d and e, which are the key to creating f, since f=2d+1-e.

by making c,d,e and f larger, we are able to obtain two key rates of change:

1. The measurable change in e, which is some portion of our unknown 2n. We can call it delta e

2. The measurable change in f, which is some portion of our unknown 2(n-1). We can call it delta f

To solve for n, we need a few things:

1. We need a large enough change in c,d,e and f to have an appropriate change to measure. I'm still trying to figure out how large of a multiplication is needed. Multiplying c by a square (4,16,25,36,49 etc) seems to work well, since e changes by the amount of the square, making delta e easy to calculate. I think a multiplier <d is also a good idea, similar to the c' = qc ideas we worked on. Not sure on this yet. I've also played with c * N, since that was a key idea from our row 1 explorations.

2. We need the ratio of change to solve for n or (n-1). Still playing with this too. (delta e) / (delta f) = n or (n-1). Or some combo of those deltas

So, here's a small working example to demonstrate the rates of change:

c145

e=1

d=12

f=24

c' = 145 * 9 = 1305

e'=9

d'=36

f'=72 + 1 - 9 = 64

e' - e = delta e = 8

f' - f = delta f = 40

The ratio of change is 1/5 and the reciprocal is 5/1. n = 5

There's a lot more work to be done on this, and I certainly don't have it all figured out.

Let's work as a team to see if the idea has legs for much larger c values.

The END? Lol, funny joke VQC. When we multiply c, we change e, move along (e,n) laterally in the Grid, and end up with a new d value. I think he may have been literally telling us how to move in the Grid to find the solution.

here's another working example.

c6017

{23:36:78:47:31:197}

e=23

N=2976

2N= 5952

e+2N= 5975

We know the following:

any movement to the right in e is a portion of e+2n

any movement to the right in f is a portion of 2(n-1)

d increases by 1 with a 2n movement right

So any increase in e and d by moving right in the Grid gives us new values to calc.

Regardless of hitting a whole value, there should be a ratio created that shows n or (n-1)

Movement: Move 2N to the right in (e,N) or (1,c)

23 + 2(2976) = 5975

delta e = 5975 - 23 = 5952

so a new d is created. d= 78+1 = 79

new f = 79*2+1 = (159) -5975= -5816 // weird to have -f, but Ok.

delta f = 5816 - 134 = 5682

5682 / 159 = 35.7358

Dafuq??? We're literally getting ratios that are in between (n-1) and (n)

Ok, so I'm asking you solid anons to help explore how f changes in each of these 3 places:

(e,1)

(e,n)

(e,N)

What we're missing is an endpoint element to calculate.

I'm proposing that we create an endpoint element that has the following changes:

delta e = a new e value arrived at by simple multiplication.

For this discussion, I'm proposing this:

e+2N

which means that f will change too, by a portion of 2(n-1)

>>11830

call it a synchronicity, but im just up jamming some tunes and sending out vibes tonight to All That Quest For Truth, so i hop in the current VQC/RSA thread, and im starting at the bottom, and reading up, bouncing around on the replies n sheeeeit, and i get to VA's post to which im now replying, and when i read

>This is a new approach to solve the "Lock and Key" part of the (x+n)^2 area.

>"Lock and Key"

i think of a really good song on the album ive been jamming lately, the album im actually jamming to right now, and guess what song is playing at this exact moment.

vid related. (yes, its the bass playthrough, homie slays)

bless.

>>11847

the whole album that track is from is fire. "Circadian" by INTERVALS.

the prior album is epic too, and the title is fitting as well "THE WAY FORWARD"

>>11829

i meant in QR, the memetic inception reaches further. bless you though

>>11839

So when’s that gonna be? When everyone’s old and grey-haired?

>>11845

Hello MM! IRL stuff has kept me busy, but I'm free now.

Solid ideas in your post!

The main problem we agree on (and all anons here agree on):

>What we're missing is an endpoint element to calculate.

>>11847

Yo Sheeeeitabaked! Thanks for the music!

>>11850

Lol, it's up to us now. We have enough to solve this.

Let's work.

>>11850

kek, that's likely a /pol/ Larper.

It's gonna 'b' when we solve this.

Then the Pells will be ringing WW, should we choose.

>>11847

Perfect, ty!

>>11851

>>11852

##ReadyAF

"once you c i[t] you can't un c it"

(1,c) = once(1) and c.

What happens in (1,c) ?

Can we calculate an endpoint and calc rates of change?

How do those relate to (e,1) and (e,n) ?'

How do those relate to rates of change in (e,N) regarding the similar movement in (e,n) ?

How does 2(n-1) change?

Can we calculate a ratio?

Feel like Luke flying my X-Wing down the trench right now lol.

>>11854

That's a good crumb. Am only using crumbs prior to 11/14/18 >>8176 in RSA14.

Mirroring yours:

>>7746 (PB)

> It is a lookup via the x values in row 1.

> It is about finding how to make the lookup with column -f and e.

> Something about the product of squares and triangles. I(t) stands out. > Once you c it, you cannot un-c (i)t.

> In The End, it is a lookup.

Have a specific work plan. If you need anything in row 1, let me know, will drop you a paste that imports well.

>>11847

This bass player is the fuckin' man.

>>11859

Let's do this one MM.

RSA 100 [e,n,d,x,a,b]

RSA100 c=

1522605027922533360535618378132637429718068114961380688657908494580122963258952897654000350692006139

e=

61218444075812733697456051513875809617598014768503

n=

14387588531011964456730684619177102985211280936

d=

39020571855401265512289573339484371018905006900194

x =

1045343918457591589480700584038743164339470261995

a=

37975227936943673922808872755445627854565536638199

b= c / a

40094690950920881030683735292761468389214899724061

First Move:

Find the (1,c) element and BigN

BigN = ((1+c) / 2) - d = BigN

Step 1: find (1+c) / 2

((1+c) / 2) =761302513961266680267809189066318714859034057480690344328954247290061481629476448827000175346003070

then, subtract d

d = 39020571855401265512289573339484371018905006900194

BigN = 761302513961266680267809189066318714859034057480651323757098846024549192056136964455981270339102876

>>11860

Am ok with that, but believe there are a couple issues at this scale, might as well go ahead and tackle tonight. Not sure the tvals lines up cleanly with the actual na in (e,1), will look again. Also, you won't be able to use excel for any prototyping / validation!

Am mostly set up to switch back and forth with c values. It's helpful if they aren't too huge when coding.

Gotten comfy with this one:

TC2:

c = 172931203

e = 8703

n = 88

d = 13150

x = 1433

a = 11717

b = 14759

f = 17598

N1 record (a=1)

c = 172931203

e = 8703

n = 86452452

d = 13150

x = 13149

a = 1

b = 172931203

f = 17598

and will move to this one which is used for the RSA demo here:

https://rosettacode.org/wiki/RSA_code

They don't list the factors, but they are below. You can go ahead and run the demo with the C# code provided.

Once you have that working, substitute for RSA100.

c = big(9516311845790656153499716760847001433441357)

e = big(1244466085015442603593)

n = big(78338448262349046023)

d = big(3084851997388311683458)

x = big(621277124509562225979)

a = big(2463574872878749457479)

b = big(3862806018422572001483)

f = big(-4925237909761180763324)

nN = big(4758155922895328076746773528426112405037221)

xN = big(3084851997388311683457)

aN = big(1)

bN = big(9516311845790656153499716760847001433441357)

fN = big(-4925237909761180763324)

>>11861

Will check the BigN val now, brb.

Then will get you the critical row 1 parameters. Need to refresh, but the an should be between on of these tvals in (e,1):

[big"2050774221787334962838133", big"2050774221787334962838134", big"2050774221787334962838135"]

MM, can you please confirm my calcs?

>>11862

Slow refresh. Not surprising. Let's work.

>>11863

Yes, will give you in a minute.

Was pulling up the notes from the t-values for na in (e,1).

## Interesting t values for na for RSA 100

# na_etstart = big(30609222037906366848728025756937904808799007384252)

# na_et = 2*(t-1)*((t-1)+3) + na_etstart

# na_et_gap = na - na_et

#

# 522671959228795794740350292019371582169735130996

# t too small

# Gap to na = 2090687836915183178961401168077486328678940523992

#

# 522671959228795794740350292019371582169735130997

# t too small

# Gap to na = 4

#

# 522671959228795794740350292019371582169735130998

# t too large

# Gap to na = -2090687836915183178961401168077486328678940523988

Few minutes will post BigN.

>>11863

>>11861

Yes, get a match on BigN. Like your method, it's quick!

Grid values:

c = 1522605027922533360535618378132637429718068114961380688657908494580122963258952897654000350692006139

e = 61218444075812733697456051513875809617598014768503

n = 14387588531011964456730684619177102985211280936

d = 39020571855401265512289573339484371018905006900194

x = 1045343918457591589480700584038743164339470261995

a = 37975227936943673922808872755445627854565536638199

b = 40094690950920881030683735292761468389214899724061

f =-16822699634989797327123095165092932420211999031886

Grid records (e,n) [e:n:d | x:a:b | c], (f,n) [f:nf:df | xf:a:b | c]

[ 61218444075812733697456051513875809617598014768503 : 14387588531011964456730684619177102985211280936 : 39020571855401265512289573339484371018905006900194 | 1045343918457591589480700584038743164339470261995 : 37975227936943673922808872755445627854565536638199 : 40094690950920881030683735292761468389214899724061 | 1522605027922533360535618378132637429718068114961380688657908494580122963258952897654000350692006139 ]

[ -16822699634989797327123095165092932420211999031886 : 14387588531011964456730684619177102985211280935 : 39020571855401265512289573339484371018905006900195 | 1045343918457591589480700584038743164339470261996 : 37975227936943673922808872755445627854565536638199 : 40094690950920881030683735292761468389214899724061 | 1522605027922533360535618378132637429718068114961380688657908494580122963258952897654000350692006139 ]

BigN Grid values where a=1:

c = 1522605027922533360535618378132637429718068114961380688657908494580122963258952897654000350692006139

e = 61218444075812733697456051513875809617598014768503

nN = 761302513961266680267809189066318714859034057480651323757098846024549192056136964455981270339102876

d = 39020571855401265512289573339484371018905006900194

xN = 39020571855401265512289573339484371018905006900193

a = 1

b = 1522605027922533360535618378132637429718068114961380688657908494580122963258952897654000350692006139

f =-16822699634989797327123095165092932420211999031886

Grid records (e,nN) [e:nN:dN | xN:aN:bN | c], (f,nN) [f:nfN:df | xf:a:b | c]

[ 61218444075812733697456051513875809617598014768503 : 761302513961266680267809189066318714859034057480651323757098846024549192056136964455981270339102876 : 39020571855401265512289573339484371018905006900194 | 39020571855401265512289573339484371018905006900193 : 1 : 1522605027922533360535618378132637429718068114961380688657908494580122963258952897654000350692006139 | 1522605027922533360535618378132637429718068114961380688657908494580122963258952897654000350692006139 ]

[ -16822699634989797327123095165092932420211999031886 : 761302513961266680267809189066318714859034057480651323757098846024549192056136964455981270339102875 : 39020571855401265512289573339484371018905006900195 | 39020571855401265512289573339484371018905006900194 : 1 : 1522605027922533360535618378132637429718068114961380688657908494580122963258952897654000350692006139 | 1522605027922533360535618378132637429718068114961380688657908494580122963258952897654000350692006139 ]

BTW, here's the formulas used (from code posted a while back by VQC with the cell validation):

eN = e

aN = 1

bN = c

xN = d - aN

XN = xN^2

XNpe = XN + e

Half_XNpe = XNpe / 2

nN = Half_XNpe / aN

fN = f

nfN = nN - 1

dfN = df

xfN = xN + 1

>>11866

Fuck Yeah.

Great work MM.

Jesus Mary and Joseph. We're gonna get some work done for the Free World tonight.

>>11866

So you have a match for BigN? Just making sure before I move to the next step.

>>11861

>BigN = 761302513961266680267809189066318714859034057480651323757098846024549192056136964455981270339102876

>>11868

>nN = 761302513961266680267809189066318714859034057480651323757098846024549192056136964455981270339102876

Roger roger, we have a lock.

>>11869 kek, just brewed some Covfefe.

>>11870

K. Got next steps.

>>11870

Let's do the theory first. You'll get it right away.

The big idea is simple.

Then we can work the calculations.

MM. You here?

>>11873 Here ready to go for a while.

So we have to move 2N to the right.

In (e,N) or N and (1,c)

That increases d, a, b by 1 each

It also gives us a new f to calc.

The difference between the change in e [VS] the change in f gives us a ratio.

That ratio gives us (n-1) or (n)

>>11874

K. Please get this element:

(1,c) for RSA100

>>11876

Not sure n>1 is reliable, not tested.

Row 1 is solid. Will generate and see what happens. brb with that.

>>11878

Ok, going to need to put in the formulas for positive n, odd e. Do you have handy? Otherwise will pull up from previous work.

Have a template for validation once working.

Wanted to do this anyway, so all good. Starting with:

ef : n : t : f : n: d : x : a : b : c : i : j

Generation for odd positive e n space not complete.

Shouldn't be long to put it together…

>>11879 Dug this up, how's it look?

x = 2*t - 1 # this is for odd e

a = (x*x + e) / 2*n

d = a + x

b = a + 2*x + 2*n

c = a*b

It's the simple approach. Issues is it doesn't have the correct base, and take the interleaving patterns into account.

>>11876

>>11880

Here are first 3 elements, t=1:3, initial output. Added in the i,j

Going to compare to the grid now, but surely won't match as this doesn't enumerate the patterns.

j = 2 * t

i = (a) + j

e_f : n : t : e_f : n: d : x : a : b : c : i : j

1 : 1522605027922533360535618378132637429718068114961380688657908494580122963258952897654000350692006139 : 1 : 1:1522605027922533360535618378132637429718068114961380688657908494580122963258952897654000350692006139:1522605027922533360535618378132637429718068114961380688657908494580122963258955422805896879165931521 : 1:1522605027922533360535618378132637429718068114961380688657908494580122963258955422805896879165931520:4567815083767600081606855134397912289154204344884142065973725483740368889776861218113897580549943800 : 6954978213164935783513619134493467472741914570589423191151514834063790072118399981243852607342287873041401606900632468380827372024210501181535349727142819881562316111084458246824970710374810648576000 : 1522605027922533360535618378132637429718068114961380688657908494580122963258955422805896879165931522:2

1 : 1522605027922533360535618378132637429718068114961380688657908494580122963258952897654000350692006139 : 2 : 1:1522605027922533360535618378132637429718068114961380688657908494580122963258952897654000350692006139:7613025139612666802678091890663187148590340574806903443289542472900614816294796003495415874410512387 : 3:7613025139612666802678091890663187148590340574806903443289542472900614816294796003495415874410512384:10658235195457733523749328646928462008026476804729664820605359462060860742812701798803416575794524668 : 81141412486924250807658889902423787181989003323543270563434339730744217508048396179647557205575032127814544995965375584532093785516960537101730915280647069976797949546073367402512572686306847607488512 : 7613025139612666802678091890663187148590340574806903443289542472900614816294796003495415874410512388:4

1 : 1522605027922533360535618378132637429718068114961380688657908494580122963258952897654000350692006139 : 3 : 1:1522605027922533360535618378132637429718068114961380688657908494580122963258952897654000350692006139:19793865362992933686963038915724286586334885494497948952552810429541598522366288270215139079091126277 : 5:19793865362992933686963038915724286586334885494497948952552810429541598522366288270215139079091126272:22839075418838000408034275671989561445771021724420710329868627418701844448884194065523139780475138560 : 452073583855720825928385243742075385728224447088312507424848464214146354687690761446606507429561985617949674998167957279768655675670840950433896649324095284455009510064251711628022150125384005656248320 : 19793865362992933686963038915724286586334885494497948952552810429541598522366288270215139079091126278:6

for c6107

Posting true facts.

(e,n)

{23:36:78:47:31:197}

MM. Let's work.

Too many distractions on Discord.

I'll meet you here at the bread.

Let's just work here.

You OK with that?

>>11870

>BigN =

761302513961266680267809189066318714859034057480651323757098846024549192056136964455981270339102876

e =

61218444075812733697456051513875809617598014768503

+2N:

1522605027922533360535618378132637429718068114961302647514197692049098384112273928911962540678205752

e+2N = 1522605027922533360535618378132637429718068114961302647514197692049098384112273928911962540678205752

1522605027922533360535618378132637429718068114961302647514197692049098384112273928911962540678205752

>>11891

>761302513961266680267809189066318714859034057480651323757098846024549192056136964455981270339102876

Missing the e (see your post above, that's your 2N, which is correct):

ep2N = 1522605027922533360535618378132637429718068114961363865958273504782795840163787804721580138692974255

>>11892

Thanks MM!

Next step is calculating the change in f between the two e values.

Let's walk through the solution.

THE MOMENT, THIS MOMENT.

THIS PRESENT MOMENT, IS EXCEEDINGLY AUSPICIOUS. RIPE AND BURSTING WITH THE ENERGY OF FRUITION

>>11894 (i)NdEeD

>>11897 see: >>11735

>>11897

>Pic related was the results (in the same order).

Pic is confusing. What are 846 and 4704? What are the solid red sections?

>>11893

>Let's walk through the solution.

When you are ready to proceed, holler.

>>11899

>>11897

In my smaller examples it's been like "all the puzzle pieces are here, and of correct size"

So then I'm like "hmmm, I'm going to move you all around until the answer pops out.'

And then the answer pops out.

Worst case, we have fun exploring an idea. Best case it actually works lol.

Here's the steps I'm taking if anyone wants to follow along.

The big idea is moving in the Grid to a new valid element, which will give us a change in e and f that we can measure. The rates of change between e and f are offset by 2n and 2(n-1), giving us enough info to solve the problem.

1. find the (1,c) element

{e,N,d,x,1,c}

2. Move 2N to the right, which would be the (2,(c+1)) element.

{(e+2N),(N),(d+1),x,(2),(c+1)}

3. Calculate the f values from the (1,c) element and the (2,(c+1)) element.

4. Take all these puzzle pieces and play with them!

Here are the puzzle pieces:

e,

e+2N

delta e (e+2N-e) = 2N

f

new f: 2(d+1)+1-(e+2N)

delta f = new f - f

I've been able to get n or (n-1) to pop out with ONLY these pieces of info.

Like divide this by this and BAM here's your n or (n-1)

Important concepts to consider:

We are creating movement in e, and in f by changing c.

in the prime solution row (e,n) - for every change of 2n to the right in e, we get a change of 2(n-1) in f.

This rate of change can be used to solve for n or (n-1)

However, we don't have that info. So where can we get it?

What we do have is the BigN (1,c) element, and new elements every 2N to the right, where d,a,b increase by 1 just like in (e,n)

To calculate a new f we need a VALID LOCATION. which is what we get when we move 2N to the right.

My theory is that the same (e,n) rules for 2n and 2(n-1) hold true in (e,N) or that they are closely related or modified in some way. When we change c, we get a measurable change in e, which is some portion of 2n - (delta e)

This changes f, and we get a measurable change which is some portion of 2(n-1) - (delta f)

so (delta e) and (delta f) create a ratio.

please see these small examples for a general idea of what I'm talking about:

>>11843

>>11842

Ok, so I'm just going to walk it through with BigN for RSA100 and see what happens.

I'm going to gather up all the puzzle pieces and then just play around and find some ratios etc.

MM, if you're willing to help that would be cool!

Sorry I fell asleep lol.

>>11901

Sounds good VA. If you need any specific calcs or checks, just holler. Would suggest perhaps using smaller numbers (the "TC2" in >>11862 is good and was filtered to be aligned with RSA100 for parity and such), but swinging for the fences is good too.

Am in the (e,1) (f,1) sandbox for now, enumerating more patterns. Quadratic equations for element growth, and being able to go both ways within a cell (so calc a value for a given t, or calculate the closest t given some value). Have some other things to get done, but was committed to checking off this mini-goal so pushing on.

>>11902

Thanks MM. Working as much as IRL allows. Working on the delta f calcs starting now.

e =

61218444075812733697456051513875809617598014768503

2N =

1522605027922533360535618378132637429718068114961302647514197692049098384112273928911962540678205752

ep2N =

1522605027922533360535618378132637429718068114961363865958273504782795840163787804721580138692974255

This is the first half needed for the calcs in (1,c)

f =

16822699634989797327123095165092932420211999031886

new f = 2(d+1)+1- ep2N =

2 * 39020571855401265512289573339484371018905006900194 + 1 // (new 2d+1)

-1522605027922533360535618378132637429718068114961363865958273504782795840163787804721580138692974255

(new 2d) =

78041143710802531024579146678968742037810013800390

(new 2d +1) =

78041143710802531024579146678968742037810013800391

ep2N = 1522605027922533360535618378132637429718068114961363865958273504782795840163787804721580138692974255

new f = (new 2d+1) - ep2N =

-1522605027922533360535618378132637429718068114961285824814562702251771261017108835979542328679173864

Just doing calculations for the moment.

All variables will be open for verification by all Anons.

Please check my work, lads.

MM, would you please take a look and verify if you're able this evening?

Thanks in advance to everyone for helping to explore this theory.

>>11907

Hello MM! Yes, just added one to d before doing the calculation.

>>11907

So the total increase is 2(d+1)

>>11906

>but tonight, we break the internet!

I'm just working on a fun Math(s) problem lol.

Puzzle pieces:

e =

61218444075812733697456051513875809617598014768503

2N =

1522605027922533360535618378132637429718068114961302647514197692049098384112273928911962540678205752

ep2N =

1522605027922533360535618378132637429718068114961363865958273504782795840163787804721580138692974255

f =

16822699634989797327123095165092932420211999031886

new f = 2(d+1)+1- ep2N =

2 * 39020571855401265512289573339484371018905006900194 + 1 // (new 2d+1) =

-1522605027922533360535618378132637429718068114961363865958273504782795840163787804721580138692974255

(new 2d) =

78041143710802531024579146678968742037810013800390

(new 2d +1) =

78041143710802531024579146678968742037810013800391

ep2N = 1522605027922533360535618378132637429718068114961363865958273504782795840163787804721580138692974255

new f = (new 2d+1) - ep2N =

-1522605027922533360535618378132637429718068114961285824814562702251771261017108835979542328679173864

Ok, all the puzzle pieces are here.

I'll get to work calculating ratios and reciprocals.

>>11912

Hey MM! here ya go.

original d =

39020571855401265512289573339484371018905006900194

original (d+1) =

39020571855401265512289573339484371018905006900195

2(d+1) =

78041143710802531024579146678968742037810013800390

2(d+1) + 1 =

78041143710802531024579146678968742037810013800391

>>11913

VA's 'Walking the Grid' values:

c (RSA100) = 1522605027922533360535618378132637429718068114961380688657908494580122963258952897654000350692006139

e = 61218444075812733697456051513875809617598014768503

d = 39020571855401265512289573339484371018905006900194

(d+1) dp1 = 39020571855401265512289573339484371018905006900195

2*(d+1) two_dp1 = 78041143710802531024579146678968742037810013800390

(2*(d+1)+1)two_dp1_p1 = 78041143710802531024579146678968742037810013800391

Chek'd, we're good to here!

(BigN) nN = 761302513961266680267809189066318714859034057480651323757098846024549192056136964455981270339102876

(nN * 2) twoN = 1522605027922533360535618378132637429718068114961302647514197692049098384112273928911962540678205752

eptwoN = 1522605027922533360535618378132637429718068114961363865958273504782795840163787804721580138692974255

eptwoN = 1522605027922533360535618378132637429718068114961363865958273504782795840163787804721580138692974255

twod = 78041143710802531024579146678968742037810013800388

twod_p1 = 78041143710802531024579146678968742037810013800389

new_f_va = (2 * (big(39020571855401265512289573339484371018905006900194) + 1)) - eptwoN

new_f_va = -1522605027922533360535618378132637429718068114961285824814562702251771261017108835979542328679173865

new_f = -1522605027922533360535618378132637429718068114961285824814562702251771261017108835979542328679173864

newf_diff = 1

>>11914

Thanks MM! I'll get to the ratios asap.

>>11914

Thanks for verifying the calcs!

>>11916

You bet VA. Have a notebook running for you. It was me who fell asleep and got some much needed rest, hope you did as well. Day already underway, breakfast done, lunches just about packed, COVID attestations completed.

Remember this day. Peace and blessings to you VA (and all anons who may lurk).

>>11915

btw, that mini goal? Nailed it (need to complete validation).

>>11896 doing stuff.. Stuff done.

Here's the output for RSA100:

vqc: BigN records are:

vqc: ef : n : t : f : n: d : x : a : b : c

vqc: 1244466085015442603593 : 4758155922895328076746773528426112405037221 : 0 : 1244466085015442603593:4758155922895328076746773528426112405037221:3084851997388311683458 : 3084851997388311683457:1:9516311845790656153499716760847001433441357 : 9516311845790656153499716760847001433441357

vqc: -4925237909761180763324 : 4758155922895328076746773528426112405037221 : 0 : -4925237909761180763324:4758155922895328076746773528426112405037221:3084851997388311683458 : 3084851997388311683457:1:9516311845790656153499716760847001433441357 : 9516311845790656153499716760847001433441357

vqc: -4925237909761180763324

vqc: f right now === -4925237909761180763324

vqc: set right now === 49624781661

vqc: setelement right now === 28293244402

vqc: d_base right now === 2462618955022503019502

vqc: a_base right now === 2462618954923253456180

vqc: x_base right now === 99249563322

vqc: HELLO!!!

vqc: dfn1_base : dfn1_2 : dfn1_3 : dfn1_4 : dfn1_5 : afn1_base : afn1_2 : afn1_3 : afn1_4 : afn1_5

vqc: 2462618955022503019502 : 2462618955221002146150 : 2462618955419501272802 : 2462618955618000399458 : 2462618955816499526118 : 2462618954923253456180 : 2462618955121752582826 : 2462618955320251709476 : 2462618955518750836130 : 2462618955717249962788

vqc: This concludes the core parameter section.

vqc: afn1_diff1_1 : afn1_diff1_2 : afn1_diff1_3

vqc: 198499126646 : 198499126650 : 198499126654

vqc: afn1_diff2_1 : afn1_diff2_2

vqc: 4 : 4

vqc: The equation for calculating tval is (2)*(t^2) + (198499126640)*(t) + (2462618954724754329538)

vqc: For input f_grid t of 42, the 'an' value is 2462618963061717651946.

vqc: Can you find a related value in the e_grid column?

vqc: The target value is an + d, or 5547470960450029335404.

vqc: The afn1 t value for target d of 51753 is -14534762033.

(Note: ^^ this isn't correct, think just a print issue)

vqc: HELLO AGAIN!

vqc: READY to do some en stuff in col d. Target d is 5547470960450029335404.

vqc: den1_diff1_1 : den1_diff1_2 : den1_diff1_3

vqc: 6 : 10 : 14

vqc: den1_diff2_1 : den1_diff2_2

vqc: 4 : 4

vqc: The equation for calculating tval in col d is 2*t^2 + (0)*(t) + (622233042507721301796)

vqc: For input e_grid t of 5, the 'd' value is 622233042507721301846.

vqc: Can you find the t value in the 'd' e_grid column for 5547470960450029335404?

vqc: The t value for target d of 5547470960450029335404 is 49624781702.

vqc: The t offset is af_t - ed_t = 49624781660.

vqc: HELLO AGAIN AGAIN!

vqc: e_f : n : t : e_f : n: d : x : a : b : c : i : j

vqc: ------------

vqc: 1244466085015442603593 : 1 : 1 : 1244466085015442603593:1:622233042507721301798 : 1:622233042507721301797:622233042507721301801 : 387173959188415704470964605416471240636397 : 622233042507721301799:2

vqc: 1244466085015442603593 : 1 : 2 : 1244466085015442603593:1:622233042507721301804 : 3:622233042507721301801:622233042507721301809 : 387173959188415704478431401926563896258009 : 622233042507721301805:4

vqc: 1244466085015442603593 : 1 : 3 : 1244466085015442603593:1:622233042507721301814 : 5:622233042507721301809:622233042507721301821 : 387173959188415704490876062776718322294189 : 622233042507721301815:6

vqc: -4925237909761180763324 : 1 : 1 : -4925237909761180763324:1:2462618955022503019502 : 99249563322:2462618954923253456180:2462618955121752582826 : 6064492117636124749736300868796946211564680 : 2462618955022503019503:99249563323

vqc: -4925237909761180763324 : 1 : 2 : -4925237909761180763324:1:2462618955221002146150 : 99249563324:2462618955121752582826:2462618955320251709476 : 6064492118613780173453257257193144779059176 : 2462618955221002146151:99249563325

vqc: -4925237909761180763324 : 1 : 3 : -4925237909761180763324:1:2462618955419501272802 : 99249563326:2462618955320251709476:2462618955518750836130 : 6064492119591435597268718403792736844167880 : 2462618955419501272803:99249563327

So how’s about it huh Chris? Admit there’s no solution? Apologize for the lives you’ve torn apart and wasted for your lies?

>>11918

Hey MM!

Need to find a better way to display decimal remainders and their reciprocals.

I'm calculating the ratios and ending up with numbers between 1 and 2, like the golden ratio.

need to have accurate floating point results, and then take the reciprocal.

Any practical advice would be great.

>>11921

What do you have in mind?

Are you taking the reciprocal of the decimal portion, such that when multiplied by the original decimal will equal 1?

Not sure what you mean by display, if you mean of a form, such as a continued fraction instead of decimal, or to 'see patterns'.

If you're chasing down the more recent golden ratio and mantissa posts, am hesitant to follow, though not saying the path doesn't have merit. Glad to expound on what I 'mean' and why.

>>11923

Hello MM! Same plan as before, looking for the (e) change in 2N vs the change in f.

I'm starting at the (1,c) element in (e,N), and then moving 2N to the right, to (2,c+1)

Reposting the solution variables here to have hem handy:

RSA100 Variables & Calcs

c=

1522605027922533360535618378132637429718068114961380688657908494580122963258952897654000350692006139

e=

61218444075812733697456051513875809617598014768503

n

14387588531011964456730684619177102985211280936

d=

39020571855401265512289573339484371018905006900194

x=

1045343918457591589480700584038743164339470261995

a=

1045343918457591589480700584038743164339470261995

b=

40094690950920881030683735292761468389214899724061

f=

16822699634989797327123095165092932420211999031886

Testing ideas.

Here's some calculations moving the puzzle pieces around.

new f = 1522605027922533360535618378132637429718068114961285824814562702251771261017108835979542328679173864

original f =

16822699634989797327123095165092932420211999031886

abs(new f) - original f = delta f = 1522605027922533360535618378132637429718068114961269002114927712454444137921943743047122116680141978

delta f / new(2(d+1)+1) =

1522605027922533360535618378132637429718068114961269002114927712454444137921943743047122116680141978

DIV

78041143710802531024579146678968742037810013800391=

19510285927700632756144786669742185509452503450095

actual n =

14387588531011964456730684619177102985211280936

new f =

-1522605027922533360535618378132637429718068114961285824814562702251771261017108835979542328679173864

original f =

16822699634989797327123095165092932420211999031886

abs(new f) + original f = delta f

1522605027922533360535618378132637429718068114961302647514197692049098384112273928911962540678205750

delta f DIV (2(d+1)+1) =

1522605027922533360535618378132637429718068114961302647514197692049098384112273928911962540678205750

DIV

78041143710802531024579146678968742037810013800391= n or (n-1)

19510285927700632756144786669742185509452503450096

actual n =

14387588531011964456730684619177102985211280936

Numerator is too big! Moving puzzle pieces again.

>>11926

I'm just glad when people post on the board.

I keep throwing it out there… but rarely does anyone take heed or even seem to notice.

>>11928

The blackpills have been fucking obnoxious lately. -_-

Glad to see people finally waking up to the possibility of "oh shit", but they shoulda done that years ago like the sane people did.

>>11929

Well, when you're raised on Star Wars and LOTR, you can deal with setbacks or temporary defeats.

"Luke, I AM YOUR FATHER""

"NOOOOOOOOOOOOOOOOO"

I like Ewoks dancing while the Death Star explodes.

>>11924

Ok, need a bit more time, will check back in shortly.

>>11934

>>11933

>>11932

>>11930

>>11931

MM, what theory(s) are you pursuing in (-f,1) and (e,1)?

>>7423

REMEMBER, take d from all values of d[t] at (e,1) and there is a known patter of (n-1) as factor in these values of d[t]-d that is different (increasingly) from the pattern of factors of n in a[t]. It is THIS that gives the offset that is used to solve the problem and thus get the cell at (e,1) to do all the work for you.

>>11936

>>11937

I'll give another look. Sometimes things are hidden in plain sight.

What do we REALLY know about (-f,1) and (e,1)?

locations of a(n-1) and (an) are equal t values.

locations of b(n-1) and (bn) are offfset by one t value.

(na transform) is the dividing line.

What about "c root of (d)"

For (e,1) all we need is a movement value from (e na transform) or (-f na transform) to (an) a(n-1)(bn) or b(n-1).

Circling back to good ideas that need work.

The solution is as close as it's ever been.

>>11939

Where do we get the "movement" value?

>>11940

>Where do we get the "movement" value?

Good question. Can move within t's in (e,1), (f,1) to get to a target d, x, a, n, or c. Then, if the t doesn't land on the target integer in let's say an, or bn, can then shift within e to bring that to a desired target. So basically, finding ways to move (for example, a change of 2 in e or f, increases or decreases a or b by one unit for the same t in the new cell).

The issue is, what is the target to move to? Haven't found anything solid for targets. Mulling over ONE crumb related to this, having to do with the shift topic in previous post.

Up for a night of bouncing ideas if you're available, but going to need to go on a hiatus soon get some IRL shit done.

>>11939

>What do we REALLY know about (-f,1) and (e,1)?

>▶VQC!!/aJpLe9Pdk 07/30/18 (Mon)

>>7047 (PB RSA#13)

>//Calculate the value at (e,1), where x=f or x=f-1

We find that on the f side of grid, d and a are consecutive triangular numbers.

>>11944 Noice digits and pic.

>>11945

>Let's collaborate and cook up some good ideas.

Ok, am in for a few as well.

Before putting my own plan and 'directions to go', do you two have any progress to share by others? Been crickets for a while, any movement/effort, or all in a waiting mode?

>>11948

I guess not. Here's the element record I'm referencing.

>>11948

Perhaps, been trying to look at yours and just see gray rectangles for >>11947 and >>11948. Saw image from Tops earlier, but not displaying now, ok, only thumbnail is broken, can expand or open it in new tab. Perhaps it's just the .png's? your jpegs in >>11945 are working?

>>11949 Can't see that, try a jpeg for kicks?

Any comment on work others are doing, or is it us to the finish?

>>11946

I love new ideas, and whether it tests out or not for larger c's), this >>11947 is good thinking. We gotta get the creative juices flowing! Brainstorming ideas over here.

>>11950

>is it us to the finish?

Can't say. But here we are. Let's get some work done.

>>11952

>Can't say.

Hmmm. Not too comfy.

Grab this paste, good for an hour, ef cols for 145:

https://pastebin.com/E80hGHX1

Do a paste in excel, and use ":" as the delimiter.

>>11953

Let's do the x/f substitution for c 6107. Check the a value.

>>11956

Just one of the multiplied "sister cells" in pics.

Here is the list:

## Grid values for c_145

c = big(145)

e = big(1)

n = big(5)

d = big(12)

x = big(7)

a = big(5)

b = big(29)

f = big(-24)

c_string = c_145

## BigN Grid values for c_145 where a=1:

nN = big(61)

xN = big(11)

aN = big(1)

bN = big(145)

"""

"""

## Grid values for 145c_4

c = big(580)

e = big(4)

n = big(10)

d = big(24)

x = big(14)

a = big(10)

b = big(58)

f = big(-45)

c_string = 145c_4

## BigN Grid values for 145c_4 where a=1:

nN = big(266)

xN = big(23)

aN = big(1)

bN = big(580)

"""

"""

## Grid values for 145c_9

c = big(1305)

e = big(9)

n = big(15)

d = big(36)

x = big(21)

a = big(15)

b = big(87)

f = big(-64)

c_string = 145c_9

## BigN Grid values for 145c_9 where a=1:

nN = big(617)

xN = big(35)

aN = big(1)

bN = big(1305)

"""

"""

## Grid values for 145c_16

c = big(2320)

e = big(16)

n = big(20)

d = big(48)

x = big(28)

a = big(20) #a*4

b = big(116)

f = big(-81)

c_string = 145c_16

## BigN Grid values for 145c_9 where a=1:

nN = big(1112)

xN = big(47)

aN = big(1)

bN = big(2320)

"""

"""

## Grid values for 145c_25

c = big(3625)

e = big(25)

n = big(25)

d = big(60)

x = big(35)

a = big(25)

b = big(145)

f = big(-96)

c_string = 145c_25

## BigN Grid values for 145c_25 where a=1:

nN = big(1753)

xN = big(59)

aN = big(1)

bN = big(3625)

"""

"""

## Grid values for 145c_36

c = big(5220)

e = big(36)

n = big(30)

d = big(72)

x = big(42)

a = big(30)

b = big(174)

f = big(-109)

c_string = 145c_36

## BigN Grid values for 145c_36 where a=1:

nN = big(2538)

xN = big(71)

aN = big(1)

bN = big(5220)

"""

"""

## Grid values for 145c_49

c = big(7105)

e = big(49)

n = big(35)

d = big(84)

x = big(49)

a = big(35)

b = big(203)

f = big(-120)

c_string = 145c_49

## BigN Grid values for 145c_49 where a=1:

nN = big(3469)

xN = big(83)

aN = big(1)

bN = big(7105)

"""

"""

## Grid values for 145c_144_a1

c = big(20880)

e = big(144)

n = big(10296)

d = big(144)

x = big(143)

a = big(1)

b = big(20880)

f = big(-145)

c_string = 145c_144_a1

## BigN Grid values for 145c_144_a1 where a=1:

nN = big(10296)

xN = big(143)

aN = big(1)

bN = big(20880)

"""

"""

## Grid values for cN_145

c = big(145)

e = big(1)

n = big(61)

d = big(12)

x = big(11)

a = big(1)

b = big(145)

f = big(-24)

c_string = cN_145

## BigN Grid values for cN_145 where a=1:

nN = big(61)

xN = big(11)

aN = big(1)

bN = big(145)

"""

"""

## Grid values for cN4_145

c = big(580)

e = big(4)

n = big(122)

d = big(24)

x = big(22)

a = big(2)

b = big(290)

f = big(-45)

c_string = cN4_145

## BigN Grid values for cN_145 where a=1:

nN = big(266)

xN = big(23)

aN = big(1)

bN = big(580)

"""

"""

## Grid values for cN9_145

c = big(1305)

e = big(9)

n = big(183)

d = big(36)

x = big(33)

a = big(3)

b = big(435)

f = big(-64)

c_string = cN9_145

## BigN Grid values for cN9_145 where a=1:

nN = big(617)

xN = big(35)

aN = big(1)

bN = big(1305)

"""

"""

## Grid values for cN16_145

c = big(2320)

e = big(16)

n = big(244)

d = big(48)

x = big(44)

a = big(4)

b = big(580)

f = big(-81)

c_string = cN16_145

## BigN Grid values for cN16_145 where a=1:

nN = big(1112)

xN = big(47)

aN = big(1)

bN = big(2320)

"""

"""

## Grid values for cN25_145

c = big(3625)

e = big(25)

n = big(305)

d = big(60)

x = big(55)

a = big(5)

b = big(725)

f = big(-96)

c_string = cN25_145

## BigN Grid values for cN25_145 where a=1:

nN = big(1753)

xN = big(59)

aN = big(1)

bN = big(3625)

"""

"""

## Grid values for cN49_145

c = big(7105)

e = big(49)

n = big(427)

d = big(84)

x = big(77)

a = big(7)

b = big(1015)

f = big(-120)

c_string = cN49_145

## BigN Grid values for cN49_145 where a=1:

nN = big(3469)

xN = big(83)

aN = big(1)

bN = big(7105)

"""

"""

## Grid values for cN_145_d12 - Not a Valid Cell - didn't multiply c by 144, only 12, so that a doesn't work:

c = big(1740)

e = big(59)

n = big(37)

d = big(41)

x = big(29)

a = big(12)

b = big(145)

f = big(-24)

c_string = cN_145_d12

## BigN Grid values for cN_145_d12 where a=1:

nN = big(829)

xN = big(40)

aN = big(1)

bN = big(1740)

"""

"""

## Grid values for cN_145_d12c144

c = big(20880)

e = big(144)

n = big(732)

d = big(144)

x = big(132)

a = big(12)

b = big(1740)

f = big(-145)

c_string = cN_145_d12c144

## BigN Grid values for cN_145_d12c144 where a=1:

nN = big(10296)

xN = big(143)

aN = big(1)

bN = big(20880)

"""