mircea_popescu: http://btcbase.org/log/2017-11-14#1737538 << it's worse in that the per-unit-effort benefit it delivers is smaller than the benefit we would accrue by simply keeping the current system and increasing the bitsize. ☝︎

mircea_popescu: though /me is consoled to see bright minds have the same intuitive inclination.

mircea_popescu: http://btcbase.org/log/2017-11-14#1737536 << this was part of the original speccing of "unequal length p, q" etc. that line of thought withered and died, see the whole thing in the log it's worth the read. ☝︎

mircea_popescu: (as it's exactly what it is)

mircea_popescu: this, amusingly, is an exact rehash of your antenna detection discussion

mircea_popescu: the problem here is structure, you have to have the "emitter" pretty well identified to make useful pattern measurements.

mircea_popescu: in the scheme discussed above, periodicity is specifically the point.

mircea_popescu: asciilifeform nah, pi is not periodic.

mircea_popescu: nobody cares for as long as they're used for what they're intended to be used, such as reproducible scientific simulation.

mircea_popescu: moreover, VERY GOOD (for some purposes) prngs are eminently sign-block-ing.

mircea_popescu: hey, money is no object empire.

mircea_popescu: you now look for the signature blocks of a in b, and have the whole show.

mircea_popescu: afaik "shadow brokers" didn't release this principal rsa exploitation tool of "teh equation group", but : imagine you have a machine a) working on your own special-purpose made prng ; and b) generating rsa keys all the time and on call.

mircea_popescu: "all you need to know is where the signature 1blocks come in the "rng", as they will be preserved by binary mult, can be seen in modulus."

mircea_popescu: kinda why faux rng calibration is done on 1blocks in the first place.

mircea_popescu: (on proper rng. on bs prng / kochgpg etc, they don't.)

mircea_popescu: there ~are~ extension attacks, but those typically require more than a dozen bits known.

mircea_popescu: kinda why we have 2045 "even if less would be enough"

mircea_popescu: which is to say, small.

mircea_popescu: of course, the odds of getting a FF FF q and a FF FF p are 1/2^32

mircea_popescu: and it will be larger than this surface.

mircea_popescu: however you "cut" the problem out, the surface of the cut becomes the problem ☟︎

mircea_popescu: anyway, there's entirely no way out of this. for purely mathematical reasons.

mircea_popescu: 1111111100000000×1111111100000000 = 11111110000000010000000000000000 if you much prefer.

mircea_popescu: 11111111.....×11111111.... = 1111111.....

mircea_popescu: sometimes i suspect you never do binary calculation at all asciilifeform

mircea_popescu: 11111111×11111111 = 1111111000000001

mircea_popescu: the only way to have an N = 11111111.... is if both q and p are 1111111......

mircea_popescu: also exists in head.

mircea_popescu: diana_coman ikr!

mircea_popescu: anyway, the same problem exists in the tail : if N is 000000001 at the end, i know BOTH p and q were 11111111 last 8 bit

mircea_popescu: works.

mircea_popescu: mathematical ordering.

mircea_popescu: left to right. most significant bit first.

mircea_popescu: literally, what the machine bytes.

mircea_popescu: ftr, octet is the fucking right word for 8 bits. a byte should be 64 bits these days.

mircea_popescu: i have a serious issue with bit/byte confusion trying to get myself out of it somehow.

mircea_popescu: bytes

mircea_popescu: http://btcbase.org/log/2017-11-14#1737519 << let's keep this binary. are you saying that if the first 2 octets of N are 1 therefore the first 2 octets of BOTH p and q must also be 1 ? ☝︎

mircea_popescu: davout ima deal with this prime thing then fish out the convos if you'd like.

mircea_popescu: yes, you can expect that your modulus will lead 10 more often than 11. but this is in the book already.

mircea_popescu: http://btcbase.org/log/2017-11-14#1737516 << this is no leak ; it is a restatement of "first two bits set to 11, so you only use 2045 bit keys" ☝︎☟︎

mircea_popescu: fortunately for everyone, the state of the needy is croaking before managing to complete its self-defined mission.

mircea_popescu: http://btcbase.org/log/2017-11-14#1737511 << amply discussed here, "pedos the next gay-like oppressed community". ☝︎

mircea_popescu: http://btcbase.org/log/2017-11-14#1737481 << lol. don't forget to come out for air, trilema is larger than what can be braved in one go. you'll break yourself. ☝︎

mircea_popescu: kinda curious how this bet works out irl.

mircea_popescu: http://btcbase.org/log/2017-11-14#1737465 << i'd expect a few thousand items at 15kb each or so, so maybe 100mb total ? ☝︎

mircea_popescu: a. yeah.

mircea_popescu: asciilifeform there is no communication among unknown parties. someone somewhere gives you a key.

mircea_popescu: !!withdraw 0.207429 165QE3hRB3x5781eQoxFjN1pdZndyzZJmv

mircea_popescu: afaic, i still have coins i paid like $2.10 for.

mircea_popescu: 10% dun buy any flotillas.

mircea_popescu: meanwhile in doggy dishes, http://78.media.tumblr.com/222bfdf2af4f7c7417e869ba2ca093da/tumblr_n868fqJ7Sm1towumdo1_500.gif

mircea_popescu: but if you wish to argue it in substance, the fiat valuation of bitcoin is broadly irrelevant -- to bitcoin, to the actrual things the fiat turds misclaim to represent, etcetera. whereas the penmanship of the l1 is relevant by definition. ☟︎

mircea_popescu: history, pretty much.

mircea_popescu: also, http://p.bvulpes.com/pastes/6Fybq/?raw=true

mircea_popescu: BingoBoingo shaping up.

mircea_popescu: http://btcbase.org/log/2017-11-13#1737334 << nah, autospeaking bots to be kept at a minimum which is 0. ☝︎

mircea_popescu: if we had a way to quantify we could just decide.

mircea_popescu: http://btcbase.org/log/2017-11-13#1737321 << this is a problem ; but perhaps opening it up to the market may be helpful.\ ☝︎

mircea_popescu: http://btcbase.org/log/2017-11-13#1737304 << was never discussed nor did i ever really grok it. ☝︎

mircea_popescu: aha

mircea_popescu: (that site pretty decent ref of romanian vehicle production, incl de teardrop lulzitem)

mircea_popescu: allegedly teh soviets were so impressed with it packed the whole assembly line took it to russia in 1945 ☟︎

mircea_popescu: o yea which reminds me : http://www.automobileromanesti.ro/images/mari/Altele/malaxa-1.jpg << romanian 1930s limo!

mircea_popescu: !!up hubud

mircea_popescu: https://hackernoon.com/the-bitcoin-gauntlet-e9e721297aca in other materia obscura

mircea_popescu: but supposedly this makes you stronger.

mircea_popescu: i get odd viral influenzas in the first months of mingling with the whores of a new land also.

mircea_popescu: very important NOT to use any kind of nextprime, as it turns out .

mircea_popescu: :p

mircea_popescu: (above quoted, largest prime known, found last year.)

mircea_popescu: asciilifeform no, because see, if you don't use nextprime you lack the "nop bridge" so to speak. rolling number 6 does not take you to 7. to get 7 you need a natural 7, and this is equiprobable to rolling a natural 2^74207281-1 on the space of (0,2^74207281-1).

mircea_popescu: http://btcbase.org/log/2017-11-13#1737276 << safe bet natch. ☝︎

mircea_popescu: asciilifeform afaik "nextprime" or anything like it is not used ☟︎

mircea_popescu: http://btcbase.org/log/2017-11-13#1737262 << this is actually a pretty good approach. ☝︎

mircea_popescu: yes.

mircea_popescu: asciilifeform quintuplechecking never hurt anything.

mircea_popescu: http://btcbase.org/log/2017-11-13#1737245 < ha! ☝︎☟︎

mircea_popescu: but... working on.

mircea_popescu: it's still an unreturned function "what other bits are lost what other places". so this 4090 still an upper bound.

mircea_popescu: quite.

mircea_popescu: clarity is more valuable than a nearer asimptote, in many contexts.

mircea_popescu: ok, you'd conceivably squeeze a little more, but again, see http://btcbase.org/log/2017-11-14#1737360 ☝︎

mircea_popescu: as you'll reject the primes and end up with the same 2045 bits of entropy

mircea_popescu: you lose it by this impl as well.

mircea_popescu: asciilifeform we're discussing first digits not last digits here.

mircea_popescu: 101111 x 101111 = 100010100001, if you're lucky ; but 100000 x 101111 = 010111100000 which is no good.

mircea_popescu: 111 doesn't add anything, 111 x 111 = 110001 ie 6

mircea_popescu: you need two bits to make 4, not 3. that's it.

mircea_popescu: asciilifeform 11 x 11 = 1001 ; 10 x 10 = 0100 ☟︎

mircea_popescu: plenty of entropy left as it is.

mircea_popescu: asciilifeform there's nothing in principle wrong with the 2045 bit primes, except, of couyrse, the lying about it. ☟︎

mircea_popescu: http://btcbase.org/log/2017-11-13#1737241 << tell him that if he regs a name ima donate to his project. ☝︎

mircea_popescu: asciilifeform 0 led either one, or rather, non 11 led either one gives you a sub 4096 N

mircea_popescu: http://btcbase.org/log/2017-11-13#1737238 << win. ☝︎

mircea_popescu: http://btcbase.org/log/2017-11-13#1737223 << so what, have 0-led p, q ? what are you on aboot. ☝︎

mircea_popescu: euler is dead.

mircea_popescu: waste of juice.

mircea_popescu: im not going to have my tech people do backflips to seamlessly bridge imperial idiocy into reality when i could just have the marketing people point out to how the empire lied by making the difference a point of difference. ☟︎