[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math

Search:


View post   

>> No.15157438 [View]
File: 63 KB, 670x800, 1655017846818.jpg [View same] [iqdb] [saucenao] [google]
15157438

>thing I disagree with

>> No.11316456 [View]
File: 63 KB, 670x800, brainlet.jpg [View same] [iqdb] [saucenao] [google]
11316456

>>11307164
tl;dr
>STEM is boring
>there's no money in STEM
This is bait right?

>> No.10093215 [View]
File: 55 KB, 670x800, flat,800x800,075,f.u1.jpg [View same] [iqdb] [saucenao] [google]
10093215

>>10093210
You've had an answer, several times. You just went "NUH UH" and kept displaying your sub 90 IQ.

>> No.9858011 [View]
File: 55 KB, 670x800, me.jpg [View same] [iqdb] [saucenao] [google]
9858011

I'm trying to break a 64 bits Truncated Linear Congruential Generator truncated to its high 32 bits.

It is in the form of a * x + c % m. a, c and m are all known, but here is the catch: the 32 bits generated are randomly truncated even further to an observable output ranging from 1 to 9 bits (and I'm able to know how many significant bits there are in each output). The goal here is of course, to find any state x using as few bits as possible.

I suck at math obviously so I tried looking up how to break it.
Apparently a TLCG can be solved in polynomial time by applying LLL to a matrix derived from a and a vector made of the truncated values and doing some shit beyond my reach. But I struggle to adapt it to fit my exact problem because of the following reasons:
- The numbers needs to be truncated down to at least 5 significant bits, no matter how many numbers I have, if they're below 5 significant bits, it simply doesn't work and I don't know why.
- The algorithm implementation I tested assumed c = 0, but when c != 0 it fails no matter how many significant bits are in the truncated output.
- I think this algorithm simply cannot work when the number of significant bits varies between successive outputs.

I've thought about only using outputs with a lot of significant bits, but I this algorithm probably won't work because it assumes consecutive values.

Any clue on what should I look into, or am I trying to do something literally impossible?

>> No.9855120 [View]
File: 55 KB, 670x800, flat,800x800,075,f.u1.jpg [View same] [iqdb] [saucenao] [google]
9855120

>>9854552
Can you please stop worship this fraud ?

>> No.9774689 [DELETED]  [View]
File: 55 KB, 670x800, flat,800x800,075,f.u1.jpg [View same] [iqdb] [saucenao] [google]
9774689

I'm a fucking brainlet who didn't take the SAT in highschool like I should have. I probably would have done well on it just winging it if I did it fresh out of school, but I've forgotten all this shit. Where can I learn the algebra that will be in the SAT? Khan Academy fucking sucks and almost all of its example videos just show guess work to eliminate answer choices rather than the actual math, or it will just straight up not explain how steps happen and just keep writing numbers without explaining where they came from. Polynomials confuse the shit out of me.

>> No.9708819 [View]
File: 55 KB, 670x800, flat,800x800,075,f.u1.jpg [View same] [iqdb] [saucenao] [google]
9708819

Could the Universe be finite?
If it's finite, what there is at the border and beyond? Just "void"?

>> No.9514752 [View]
File: 63 KB, 670x800, 1518531855110.jpg [View same] [iqdb] [saucenao] [google]
9514752

>>9513329

>the concord was a mistake

>> No.9513534 [View]
File: 55 KB, 670x800, flat,800x800,075,f.u1.jpg [View same] [iqdb] [saucenao] [google]
9513534

>>9513522
>the problem is that R (being the area under the curve) is a dependent property of the function itself
Of course it is, it's the bloody area under the curve.

>> No.9497756 [View]
File: 55 KB, 670x800, flat,800x800,075,f.u1.jpg [View same] [iqdb] [saucenao] [google]
9497756

>>9497738

Navigation
View posts[+24][+48][+96]