4800+ entries in 0.354s
kanzure: anyway the concern is that there's not enough pure silicon available to make enough flash memory for future projected demands of like
2^28 bits in ~20 years.
mircea_popescu: so then 1, for phuctor, 1tb item ; 1 for special purpose amd, as much as it can carry, and
2 run of the mill, what's to be found at a decent price.
mircea_popescu: this is because of set theoretic considerations whereby increases in the mod parameter increase the pile of possible results, eg mod
2 is 0 or 1
mircea_popescu:
2. we select the first 22 bits of the dividend, to wit 1 0100 1100 1110 1010 0110 0 and we compare the divisor to it. as the divisor is larger, we add one further bit, obtaining 1 0100 1100 1110 1010 0110 01.
apeloyee: standard barrett requires a*b<n^
2, yes. hence I specified the double-precision reciprocal.
apeloyee: what woud be wrong with barrett reduction if you calculate a sufficiently precise reciprocal of modulus N,i.e. (maxint+1)^
2/N?
apeloyee: would O(N^
2) modular multiplication be too slow?
a111: Logged on 2017-09-12 23:11 mircea_popescu:
2. a fine example of how "i work for the web man" rots the brain, is that in an implementation of the above discussed mod-distributiver, the "common" consensus impulse would be to add a test, make sure the list elements respect the condition of <modulus. this however is very much the wrong thing ; and it is a tmsr-graduate level question to explain why and wherefore.
mircea_popescu:
2. a fine example of how "i work for the web man" rots the brain, is that in an implementation of the above discussed mod-distributiver, the "common" consensus impulse would be to add a test, make sure the list elements respect the condition of <modulus. this however is very much the wrong thing ; and it is a tmsr-graduate level question to explain why and wherefore.
☟︎ phf:
http://btcbase.org/log/2017-09-12#1712362 << i actually use this one pretty frequently when i type for identifiers, abbreviations and section headers in notes. really any time i need to type more than
2 capitalized letters in a row..
☝︎ mircea_popescu: consider the number 97. is is 1100001. they do mp_mod (
2^6,
2^5,
2^0) ; you can do (
2^6,
2^5, 0*
2^4, 0*
2^3,0*
2^
2,0*
2^1,
2^0). the list method will sitll work, but this time in constanttime.
mircea_popescu: this may or may not be cheaper ; but in general you would build a list of the pre-calculated mods of all the powers of
2 up to your bitness and save that to save on work.
mircea_popescu: repeat
2 until you have populated a list of equal length, and return the correct element from it.
mircea_popescu: for simplicity, input list limited to
2 elements, but expansion obvious.
mircea_popescu: and this is potentially recursive, in that if you have a 500 bit number with 300 ones in it, you do the mod for 500 terms which are all a power of
2, throw 200 away, keep the other 300 and add them.
☟︎ a111: Logged on 2017-09-12 20:54 asciilifeform: and it happens B^
2 times
mircea_popescu: ie, all the trivial polynomials of the mod, see ? x, x^
2 + x, x ^ 3 + x etc etc
mircea_popescu: 1. multiply x and y ;
2. count bits of result ; 3. count bits of modulus ; 4. multiply modulus with count2 - count3 and test if larger than result. if not, substract. if yes, multiply with count2-count3-1 and do the same. repeat until result smaller than modulus.
a111: Logged on 2017-09-12 18:23 asciilifeform: you have the following primitives : multiplier (
2 N-bit numbers -> 1 2N-bit number ); adder ( ditto ); subtractor ( ditto ); muxer (
2 N-bit numbers, 1 single-bit number, yields one or the other N-bit depending on that single bit ) ; logical ops (and/or/xor/not)
mircea_popescu: bear in mind dentine is like
2.5 mohs. so not so great (which is why enammeled in actual firing-in-field tooth)
mircea_popescu: > gb item is large yes. 700mb film is normal,
2.1 gb large.
mircea_popescu: golden standard is 1. take ye olde wallet.dat ;
2. dump all txn in it ; 3. dump all addresses involved in them ; 4. get privkeys for all addresses in that list (most of which fail).
BingoBoingo: In other news, people are bitching all scandalized about plywood selling for what it sells for. Turn out they've been looking at
2'x2' and
2'x4' sheets instead of full sheets.
mircea_popescu: ws that
2. everyone is perfect in every way (called "special" in-universe) ; meanwhile 3. because progress and pangloss' best possible world, all historical characters are definitionaly LESS than the present troop of ruminants (and see also the inflation delusion, as well discussed for instance in
http://trilema.com/2017/the-day-of-failure-trilemma/#comment-122822 ) from which together it then follows and from this in turn it
mircea_popescu: and before you laugh : this is EXACTLY what they are thinking, it's not a joke, it's a statement of fact. 1. everyone has "the human right" of being here in the first place, and being free of any "rape" such as being insufficient for anything, or in any way inadequate, including being untalented, obese, you name it.
2. from the indemnity againast any inconvenience or shortcoming (called "negativity" in-universe) it then follo
ben_vulpes: asciilifeform: is this carryless addition/GF(
2)/xor package part of finite field arithmetic
a111: Logged on 2017-09-08 06:10 ben_vulpes just looked up GF(
2), while working to understand how the keccak 'reference' authors got from the step definitions in 1.
2 to the pseudocode in
2.3, experiencing an 'oh dear' moment
ben_vulpes just looked up GF(
2), while working to understand how the keccak 'reference' authors got from the step definitions in 1.
2 to the pseudocode in
2.3, experiencing an 'oh dear' moment
☟︎ mircea_popescu: (the item that leveled bucharest in 1977 was 7.
2 not 8, and it happened 200kms away.)
PeterL: Lane is a mod
2**64 type
jhvh1: BingoBoingo: Bitstamp BTCUSD last: 4527.46, vol: 16047.56473038 | Bitfinex BTCUSD last: 4503.
2, vol: 37967.82807393 | BTCChina BTCUSD last: 4396.84, vol: 17071.12220000 | Kraken BTCUSD last: 4560.0, vol: 4939.31509487 | Volume-weighted last average: 4488.12857575
jhvh1: BingoBoingo: Bitstamp BTCUSD last: 4084.43, vol: 29399.06186728 | Bitfinex BTCUSD last: 4044.3, vol: 74418.1876708 | BTCChina BTCUSD last: 3841.461129, vol: 34313.76140000 | Kraken BTCUSD last: 4244.
2, vol: 10540.5709551 | Volume-weighted last average: 4019.59238548
jhvh1: BingoBoingo: Current Blocks: 483418 | Current Difficulty: 8.88171856257E11 | Next Difficulty At Block: 483839 | Next Difficulty In: 421 blocks | Next Difficulty In About:
2 days, 11 hours, 22 minutes, and 10 seconds | Next Difficulty Estimate: None | Estimated Percent Change: None
scriba: ssh banner of 74.45.228.159 as seen on 2016-06-13: SSH-
2.0-OpenSSH_5.
2 spyked: stumbled upon
http://btcbase.org/log/2017-08-02#1692820 <-- *theoretically* (where theoretically = I'm mostly pulling this out of spyked arse, so hold on to eggs) possible. problems as far as I can see are 1. no. of transistors,
2. arch/microarch design, e.g. how to use general-purpose registers (assuming there are gp registers there); and I assume there might be bigger problems, some of which mentioned by asciilifeform. static checking
☝︎ trinque: shinohai: 4.9.
2's in deedbot for trb deps btw
lobbesbot: Logged on 2017-09-02 19:34:56: <kisspunch> gcc 7.1.1 20170630 / ld
2.28.0.20170506 / FT-Jam
2.5.3
mircea_popescu: ideally you get something denser than trad printer. if you manage
2-3k dpi (with a tractor!) then you can just prepare your receiver on an endless sheet of paper (process upstream) and just print and print and print. constantly. sort-of how the correct re-asphalt road crew works.
kanzure: acetonitrile, tetrazole, ammonia, 3-methoxypropionitrile,
2-methyl glutaronitrile, etc.
a111: Logged on 2017-09-01 15:38 asciilifeform: in very very other noose : the vendor's vga and ps/
2 kbd demo verilog for ice40 builds and WORX
mircea_popescu: asciilifeform consider something like : 1. split item to sign into 512 byte blocks. create block 0 from rng. sign hash(block 0), hash(block 1 + hash(block 0)), hash(block
2 + hash(block 1 + hash(block 0))), and so following.
mircea_popescu:
2-300k will buy you flat "in san francisco, where trains go"
shinohai:
https://github.com/owocki/pytrader <<< "My test portfolio was initialized with a 1 BTC deposit, and after
2 months and 23,413 trades, exited with 0.955 BTC. The system paid
2.486 BTC in fees to poloniex."
jhvh1: mircea_popescu:
2 ** 256 = 1.157920892373162E77
mircea_popescu:
http://btcbase.org/log/2017-09-01#1708973 << no. some non-people are trained as part of their non-people training at the hands of old women to a. never show their cunt in public b. run away whenever specific sounds are heard (1. sirens,
2. "freeze", 3. "nigger", 4. numbers and math, 5. etcetera). this is how old women build "a society" which looks exactly like fucking john gast's "american progress", a "painting" made by tele
☝︎ mod6: <+asciilifeform> in very very other noose : the vendor's vga and ps/
2 kbd demo verilog for ice40 builds and WORX << cool
mircea_popescu: i dunno, back in say 2014-2015 we had 1.5-2k-
2.5k line logs and it wasn't such a load. but the lines musta gotten denser or something, because even 1k nowadays is like... god.
mircea_popescu:
2 bitcents is like 90 dollars or what is it now, for a frame.
scriba: ssh banner of 80.86.145.56 as seen on 2016-06-13: SSH-
2.0-OpenSSH_5.9p1 Debian-4
a111: Logged on 2017-08-31 21:59 mircea_popescu:
http://btcbase.org/log/2017-08-31#1707765 << i'd be surprised if 1 in 10 people here watch any given video. prolly goes to 1 in
2 or 3 re pics, and is 1 in 1.x or even 1.0x re text. so bear that in mind.
a111: Logged on 2017-08-31 21:59 mircea_popescu:
http://btcbase.org/log/2017-08-31#1707765 << i'd be surprised if 1 in 10 people here watch any given video. prolly goes to 1 in
2 or 3 re pics, and is 1 in 1.x or even 1.0x re text. so bear that in mind.
fyr: which will take
2 dudes with jackhammers a day to install, disrupting any attempts to get work done during that day