tmsr - Search: get bits

snsabot: Logged on 2019-10-30 10:22:55 mp_en_viaje: but we absolutely must look at the whole stack, with a clear eye, and clean it of alf idiocy. i don't even care if some useful bits get thrown out in the process so much

mp_en_viaje: but we absolutely must look at the whole stack, with a clear eye, and clean it of alf idiocy. i don't even care if some useful bits get thrown out in the process so much

asciilifeform: BingoBoingo: imho mp_en_viaje was in fact right in 2015, when wrote that working internet can only be built w/ constellation of machinery on old one, where if can connect to 1 noad, you get republican net, and the bits ~will~ go where they're addressed for so long as there's physically via what.

asciilifeform: seems to spec a somewhat diff item than originally contemplated tho ( where all userland proggies are guaranteed to get, if slowly, actual unique FG bits )

mircea_popescu: the many blessings of travel, you get to debug a random pile of strange every short time interval with arbitrarily limited toolsets. and people enjoy this! people who don't even get to play with the bodies of the local choicer bits. incomprehensible.

mod6: So if what I had previously believed above is true, and it would seem to considering my understanding of FZ_Add for instance, then "most junior bits on the left" makes sense to me, but "FZ_Get_Head" seems perhaps a bit confusing. Although, when I typically "getHead()" or "getTail()" I expect to get the 0-ith index, or the nth, respectively.

mircea_popescu: the 512 "central" cores are state machines that can do add or mul, and always proceed ~on their entire register set~. so if you don't want to multiply 131072-bit numbers, just put in zeros ; and if you put larger numbers in there you'll just get the LAST 262144 bits of the result, is all.

asciilifeform: verisimilitude: as a concrete example : you will find that ffa uses an unmoving hinge for karatsuba multiplication. consequently all numbers are required to occupy a space that is a power-of-two bits wide. but from this you get a 3-4x simpler mechanism.

asciilifeform: possibly i'm thick, but i read 'fails to distinguish' as 'tautological', i.e. you can flip the bits and get equally 'good bedtime' model

mircea_popescu: so your reasoning was that if some bits get left out the koch is gonna eat them ?

asciilifeform: mircea_popescu: obv 'key' is defined as 'the bits you actually need to get the payload out of the ciphertext', how else

mircea_popescu: nah, there's an iffy point there, "well.. so how does one get message out, guesses the odd bits you happened to use this time ?!" which is directly a rehash of http://trilema.com/2018/so-i-designed-a-block-chipher/ problem

diana_coman: i.e. if one shifts right by 2 bits but provides an overflow of 8 bits than 6 of them get simply or-ed, it's not like they get pushed in

a111: Logged on 2018-11-01 17:44 asciilifeform: i had to algebraize the thing , and have just the right rng bits flip in head , to get the 'ceiling tiles' ( why didn't mircea_popescu get'em in '15 ? )

asciilifeform: i had to algebraize the thing , and have just the right rng bits flip in head , to get the 'ceiling tiles' ( why didn't mircea_popescu get'em in '15 ? ) ☟︎

a111: Logged on 2018-10-29 22:56 diana_coman: basically I get http://btcbase.org/log/2018-10-29#1867091 BUT can't yet follow it to http://btcbase.org/log/2018-10-29#1867092 mainly because it seems to me that the effect of A is basically in fixing d,f,h (so that xor(a,d,f,h)=0); in short: wouldn't a change (of any number of bits) in a trigger (if imposing xor(a,d,f,h)=0 still) changes further in b-h so that the resulting key schedule is different? theoretically that would be the ration

diana_coman: basically I get http://btcbase.org/log/2018-10-29#1867091 BUT can't yet follow it to http://btcbase.org/log/2018-10-29#1867092 mainly because it seems to me that the effect of A is basically in fixing d,f,h (so that xor(a,d,f,h)=0); in short: wouldn't a change (of any number of bits) in a trigger (if imposing xor(a,d,f,h)=0 still) changes further in b-h so that the resulting key schedule is different? theoretically that would be the ration ☝︎☝︎☟︎

a111: Logged on 2018-10-12 09:00 mircea_popescu: there's absolutely no excuse for having "urandom" as a kernel signal. applications that both a) care about entropy debit over time and b) can get away with substituting shit for entropy should simply manage their entropy/shitropy interface in a dedicated thread. let it read from /dev/random, add however many bits of 11110000 they want whenever they want to and vomit the resulting cesspool as the app that spawned them demands.

mircea_popescu: there's absolutely no excuse for having "urandom" as a kernel signal. applications that both a) care about entropy debit over time and b) can get away with substituting shit for entropy should simply manage their entropy/shitropy interface in a dedicated thread. let it read from /dev/random, add however many bits of 11110000 they want whenever they want to and vomit the resulting cesspool as the app that spawned them demands. ☟︎

mircea_popescu: some clever bits of math permit one to encrypt a message with the use of that 221 so that only he who knows 13 * 17 =221 can ever get it back out.

phf: (the previous error i mentioned in logs was probably using same compiler before it was installed into its destination, because it was being invoked with explicit -B flags (-B flag points to compiler bits explicitly). this new failing bootstrapped compiler would work if provided explicit -B which makes me guess that some phase that was supposed to get compiler into knowing where its bits are failed.)

mircea_popescu: cause god damn it, who the fuck is gonna get "married" and "monogamy" ? harem or get lost, the social choices are asexual wankerism for the govt-supported and harem for the miscolred bits crowd. that's it and that's all, the 1970 "new york of trades" where "every man" house, wife, children, etc (cher's moonstruck a fine example of this utopia as ever can be had) utterly disappeared sometime since america ended.

asciilifeform: Mocky: i still dun get why your algo requires the xor of the ~quality~'s oddness bits to be 0

a111: Logged on 2018-07-15 15:38 mircea_popescu: asciilifeform check this out : i got a bundle which compiles to 64 bits except one lib, which compiles to 32 bit and then i get " wrong ELF class: ELFCLASS32 Program exited with code 0177". the configure for it manages to ignore both enable-lib64 --disable-lib32 and CFLAGS=-m64 CXXFLAGS=-m64 LDFLAGS=-m64 sets of flags. you ever heard of such ?!

mircea_popescu: asciilifeform check this out : i got a bundle which compiles to 64 bits except one lib, which compiles to 32 bit and then i get " wrong ELF class: ELFCLASS32 Program exited with code 0177". the configure for it manages to ignore both enable-lib64 --disable-lib32 and CFLAGS=-m64 CXXFLAGS=-m64 LDFLAGS=-m64 sets of flags. you ever heard of such ?! ☟︎

mod6: <+asciilifeform> mod6: by all indications you have a box with iron problem. in your place i'd get a fresh set of iron, rather than sinking sweat into interpreting randomly flipped bits as 'bug' << yeah for sure, it certainly could be related to the disk issue. I don't really think it's a 'bug' or anything.

asciilifeform: mod6: by all indications you have a box with iron problem. in your place i'd get a fresh set of iron, rather than sinking sweat into interpreting randomly flipped bits as 'bug'

mircea_popescu: because this is how they age -- they become ever more elaborate in their idiocy. THIS is the deep meaning of "Interesting to see the bits he gets 'right' , such as no anonymity, but then to see him see him turn around and" : he didn't get anything right.

mircea_popescu: listen, why not get yourself a rsa key, a proper irc set-up, choose a name that's not retarded and start a blog, publish the respective bits...

asciilifeform: hey it obeys the 'set coupla upper bits and get nextprime()' algo! so wat if forgot to rngize !11

asciilifeform: ( where you apply a magictransform to the whole rfc4880 turd, to get a lattice and get the privs; or at the very least, diddled rng that gives e.g. 48 bits of possible keyspace, so nobody finds straight collision, but their asic can walk it, or the like.

asciilifeform: the lolturd at the heart of the lj piece, 'This is pure unadulterated slander. Lima is not in any way tainted. It is freshly written MIT code and I was never exposed to original ARM code. This statement is an outrageous lie, and it is amazing that anyone in the open source world would lie like that and expect to get away with it.' << somehow does not occur to the author, that he has a problem , if the 'colour of the bits' is permitte

a111: Logged on 2018-04-07 01:25 mircea_popescu: 6mb to get a fucking blog cms going. oh epic world of bits...

a111: Logged on 2018-04-05 20:07 mircea_popescu: we have the perfect mechanism of antipantsuit publishing ; http://btcbase.org/log/2018-01-13#1770196 . what's the "color of bits" pantsuit system supposed to do, get trinque to swear in court you sent it to him ?

mircea_popescu: we have the perfect mechanism of antipantsuit publishing ; http://btcbase.org/log/2018-01-13#1770196 . what's the "color of bits" pantsuit system supposed to do, get trinque to swear in court you sent it to him ? ☝︎☟︎

ben_vulpes: whoever it was managed to get some identifying bits right and others insultingly wrong

mircea_popescu: asciilifeform you have a different problem : even if "no bit of input is more influential than other" i STILL want to put in no less than 2045 bits of input ; AND get out no MORE! than 2048 bit long prime.

a111: Logged on 2018-01-04 22:30 asciilifeform: 'top 2 bits and bottom bit are ALWAYS 1!' << asciilifeform still doesn't get why to weld the next-to-highest

asciilifeform: 'top 2 bits and bottom bit are ALWAYS 1!' << asciilifeform still doesn't get why to weld the next-to-highest ☟︎

phf: i feel like you chould email it to chuck moore, he'll get a kick out of it "saves 25 bits on my greenarray cluster!"

mircea_popescu: he's now at describing the mindbogglingly ugly hacks of how to get 32 bit fixnums out of 36 bit words with 6 bits of tag and 2 of code and so on, "oh actually the lowe order quarter can be repurposed"

mircea_popescu: nevertheless, the correct solution to this "quickly, prime this many bits long" is a n, k tuple which contains n as the bitsize and k as the "oddness". if you want the n - 396 k = 5 prime you get 2^396- 1229

a111: Logged on 2017-11-14 11:25 diana_coman: apeloyee, if I understand that correctly basically the only way to plug that leak would be to give up on diddling p and q, including setting size; which would mean just get random pairs of primes until their product fits the desired number of bits for the key; obv this lands into the trouble of having one of them too small

diana_coman: apeloyee, if I understand that correctly basically the only way to plug that leak would be to give up on diddling p and q, including setting size; which would mean just get random pairs of primes until their product fits the desired number of bits for the key; obv this lands into the trouble of having one of them too small ☟︎

a111: Logged on 2017-11-13 15:09 asciilifeform: but you can trivially show that using the bottom bits in this way lets you actually get 4x as many possible primes

asciilifeform: but if you want to make a fast mphftron, for experimentation, the recipe is 1) compute upper bound of the scratch space length and preallocate. NEVER realloc 2) NEVER flip-all-the-bits, flip a 'did-we-flip' bit instead, and the latter always get xor'd with whatever bit you read from the flippablespace.

asciilifeform: but you can trivially show that using the bottom bits in this way lets you actually get 4x as many possible primes ☟︎

a111: Logged on 2017-11-02 02:46 lobbes: anyways, for the wotpastes specifically, I plan to download and store those myself from the get-go (and NOT route them through archive.is), seeing as those are easily 'flagged' due to the predictable url. To alf's point, even if archive.is stays up, diddling is always a threat. Any bits I can do without it now is +ev imo

lobbes: anyways, for the wotpastes specifically, I plan to download and store those myself from the get-go (and NOT route them through archive.is), seeing as those are easily 'flagged' due to the predictable url. To alf's point, even if archive.is stays up, diddling is always a threat. Any bits I can do without it now is +ev imo ☟︎

asciilifeform: because all you do is get NEXT N bits from rng, they have ( if rng is proper ) 0 relation to previous N

a111: Logged on 2017-10-08 00:16 asciilifeform: the ONLY correct method of generating cryptoprimes, is to 1) get N bits from FUCKGOATS 2) determine, in fixed spacetime every single time, whether that string of bits constitutes a usable prime.

asciilifeform: the ONLY correct method of generating cryptoprimes, is to 1) get N bits from FUCKGOATS 2) determine, in fixed spacetime every single time, whether that string of bits constitutes a usable prime. ☟︎☟︎

a111: Logged on 2017-08-14 16:14 asciilifeform: ( tldr : superiority of the FUCKGOATS-enabled approach, of get-new-N-bits-from-rng-then-primalitytest-until-done, vs the kochian get-N-bits-then-increment-until-passes-millerrabin )

a111: Logged on 2015-01-13 18:05 mircea_popescu: lizard empire very large, very porous, generally i get the good bits before they fully propagated even.

lobbes: If using the 4160 bit limit, then I get the following (comes to 4150 bits): http://wotpaste.cascadianhacker.com/pastes/ED76z/?raw=true

asciilifeform: ( tldr : superiority of the FUCKGOATS-enabled approach, of get-new-N-bits-from-rng-then-primalitytest-until-done, vs the kochian get-N-bits-then-increment-until-passes-millerrabin ) ☟︎☟︎

mircea_popescu: asciilifeform you are running a computer. (not crap, an actual tmsr is happy with machine). when i start mine up, i want to get some bits from you. maybe it's "what sina said about mp on gossipd". maybe it's "the nth block in the current blockchain". maybe it's whatever it is. how does it do this ?

asciilifeform: sina: if some % of the time i can determine how long it took you to carry out a secret key op (incl. key generation) i can determine a few bits of key. over time, i get 1/4 of them, and that is == to getting the rest.

mircea_popescu: mod6 you take a number of say 22 bits, and cut it in two 11 bit numbers. this 11 is the k. then you have first part * 2 ^ K (=11) + second part to get the original back

Framedragger: for symlink fs testers (or maybe selfnote for later): note that if you allow for sufficient folder tree depth, the "1000s of symlinks per dir" won't realistically happen when storing, say, bitcoin transaction hashes. the latter have 256 bits => 64 hex chars. if you allow for depth of 8 where last level (8) is symlink itself, you get 32 bits per folder level.

mircea_popescu: i mean i get it, everyone agrees the us is a colony now, but from that it doesn't exactly follow which bits fall into which spheres of influence does it.

asciilifeform: but it takes up space, and if even 1 of the bits gets flipped (misguessed), you get an avalanche of rubbish.

shinohai: nope, ben_vulpes helpedme to get docs uploading from cli so I'm using republican bits now

asciilifeform: mircea_popescu: try to understand that linux is barely a thing at runtime. whereas a lisp os has to make up for 10,001 idiocies of the hardware, e.g., lack of garbage collector, lack of type bits in every (yes) machine word that get tested on every (yes) arithmetic operation, etc.

a111: Logged on 2016-08-18 04:05 asciilifeform: char *p = get_random_bits( nbits, randomlevel, secret )

asciilifeform: i get it, mircea_popescu has this 'if we pretend coin movement carries 0 bits of info to the enemy, mebbe it will become true' thing going.

BingoBoingo: anyways this time I'll probably actually try it in the store before leaving. Get drill, masonry bits, and concrete block then test it in the tool rental area. If people test riding morwers there I don't see why I can't test drill.

asciilifeform: dram is how we get wonders such as 'rowhammer', but also bits that rot from not only cosmic ray but the background gamme of impurities in ITSELF, etc

mircea_popescu: this because 2 bits = 2^2 = 4. had the shift been 17 bits, then you'd get to do 2^17 = 131072 old style hashings for each new style digest you calculate.

phf: ben_vulpes: get-difficulty is a straight rip of the c from bitcoinrpc.cpp << correct way to do that one is to write get-index-best that returns block-index structure that you can get bits value from, and then have get-difficulty do all the equivalent calculations in scheme, bitshifting and all

mircea_popescu: "I'm going back to the frozen north, where the pricks are hard and strong. Back to the land of the all-night stand-where the nights are six months long, where you get it in bits as hard as tin in the land where spunk is spunk - not a trickling stream of lukewarm cream, but a solid frozen chunk."

assbot: Get Bits: Get bitcoin from your friends. ... ( http://bit.ly/1KTpEyE )

ascii_field: http://log.bitcoin-assets.com/?date=03-09-2015#1261558 << how might one have, physically, low-latency without high bandwidth? you could serialize the bits, and immediately get the other. it is only high bandwidth that does not automatically imply low latency ☝︎

shinohai: I love my tech, don't get me wrong. But a few nights in the desert or mountains does wonders for clearing away the clutter amongst the little grey bits.

mod6: hanbot: << picked the renaming bits out of here, worked for me, thanks. did not get the syntax error! << ahh ok thanks for the update. glad you didn't get the error. my ubuntu needs to go to glue factory.

assbot: Logged on 20-08-2015 06:38:34; hanbot: <mod6> so i ended up chaging the file name to "vdiff.sh" + chmod 0755, and then changing the script so it reads: "vdiff.sh a b > genesis.vpatch" << picked the renaming bits out of here, worked for me, thanks. did not get the syntax error!

hanbot: <mod6> so i ended up chaging the file name to "vdiff.sh" + chmod 0755, and then changing the script so it reads: "vdiff.sh a b > genesis.vpatch" << picked the renaming bits out of here, worked for me, thanks. did not get the syntax error! ☟︎

asciilifeform: trinque: setting '-peers' for nodes which 1) don't obey 'misbehave' bits 2) get served PRIORITY regardless of what

diana_coman: and bits of nothing are like 11-12 satoshi or you'll prolly get some for free from someone (me even)