23200+ entries in 0.518s
mircea_popescu: this is like people frustrated they can'
t make airplanes, deciding to create a "through-wall bird model of flight", proceeding to prove birds don'
t "fly" in the sense of, "through walls".
a111: Logged on 2017-07-12 14:38 asciilifeform: so it isn'
t 'a db', it's an api shim
mircea_popescu: "But the real morals of the story is that one must be able to employ every little part of the animal you kill, like the man does… so that womenz can stuff that many more people into thje same fucking acre. won'
t you be happy then!"
a111: Logged on 2017-07-05 15:50 phf: oh flag, lets you pass this stuff as a command line argument.. i guess this approach works too. i'm not sure why i can'
t just do message = string(dat) but i'm too lazy to figure it out
mod6:
t of bot that we have to keep track of such things.
mircea_popescu: but yes, idiots with daddy's money can do stupid shit thart doesn'
t even pay.
a111: Logged on 2017-07-12 02:41 mircea_popescu: yeah, i don'
t have an obvious pill either. but for instance for running nodes ? what do you care if it's evil. doesn'
t pay to evil.
mircea_popescu: yeah, i don'
t have an obvious pill either. but for instance for running nodes ? what do you care if it's evil. doesn'
t pay to evil.
☟︎ mircea_popescu: but their being retarded doesn'
t mean we can'
t do it right.
mircea_popescu: asciilifeform understand this isn'
t a matter of testing specified bitfields, but specified ~processes~
mircea_popescu: as in, balance it according to a calculation, rather than according
t oa feeling.
mod6: i haven'
t gone all the way through the W_Mul yet, but just unrolling it as said.
mod6: and gleaned a few things I didn'
t notice earlier.
mod6: asciilifeform: you mind throwing me your W_Add_D, i don'
t seem to have one.
mircea_popescu: moreover, if you do fixed as described, you CAN so unroll, if you do or if you don'
t.
mircea_popescu: ~same as the relation between pointer and its content, "better hope programmer didn'
t fuck up ; and also it usually blows up if he did so there's that"
mircea_popescu: wouldn'
t it be actually proper to copy the slice into its own array and to maintain a pairing of slices and new arrays ; rather trhan do index magics on the mult code ?
mircea_popescu: wouldn'
t it actually be proper to copy the slice into its own array ?
mircea_popescu: i realyl don'
t like this "and now we magic-variable the numbers". it's one step up from magic constant
mircea_popescu: it's generally a pity people don'
t use numerical methods more.
mod6: how come they don'
t publish these things in ascii like normal people?
mircea_popescu: and this nonsense of offering faux meaningless choice a la kochpgp is unwelcome and shouldn'
t be perpetuated. keys are 4kb and forget about it.
BingoBoingo unsure that this isn'
t new levels of irtellectuan int-L-evance
mircea_popescu: "if you're going to complicate -- complicate like latin, don'
t complicate like puritan society or any other barbarian non-people"
mircea_popescu: i don'
t care if it's a "gui" or a telex or whatever it may be.
mircea_popescu: but the problem becomes really complex when you consider "bitcoin block index" is as of right now "positive integer under 474974", and won'
t stay that way for long.
mircea_popescu: for the curious : yes, i also have this problem in speech, especially when discussing complicated things with complicated women, and the solution THERE is the sort and short rule. which in relevant part says here that "(1 #.(+ 1 1) 3)" could NEVER be interpreted as "(+ 1 1)" because "(+ 1 1)" was a shorter statement of that and it wasn'
t used.
mircea_popescu: phf i don'
t know if you can or if you can'
t, not sufficiently experienced with the thing.
phf: can'
t you say the same about lisp? you establish your data format (i.e. a READTABLE that you're going to use for reading it), at which point modifications to that readtable makes for broken machine. the standard specifies how, e.g. number reader works, so if your readtable uses standard number reader 5 is 5
mircea_popescu: and this is fundamental and won'[
t go away nor can it with money and reputations involved.
mircea_popescu: i STILL don'
t want my number five to have the capacity to really be four.
mircea_popescu: yes, but i don'
t want my number five to have the capacity to really be four.
mircea_popescu: phf your excited attempts at playiung with candi's ass, back when she was a virgin, is a plain and very obvious indication of what ~every lisp hacker knows but none dare admit, or think about. it's a fundamentally dirty language in that it doesn'
t, actually, admit there is even in principle differences between data and code. "oh, it's an array, and here's the associated macro, so this .dat file is actually turing complete". f
mircea_popescu: moreover im affraid sexpr doesn'
t actuallty separate data from code.
phf: there's ISLISP standard, which was supposed to create a subset of multiple different lisps (like common lisp and scheme, but also eulisp, since designed by europeans). i don'
t think anyone (particularly sexp library authors for other languages) ever tried to conform to it. typical solution is to have a JSON-like subset of sexps, so that you can express (FOO "abc" 2), i.e. symbol, string, number and list and nothing else
phf: (common lisp sexps are backed by a full blown reader, with multiple non-trivial dispatch macros, so for example '(1 #.(+ 1 1) 3) is a valid sexps that's read as '(1 2 3), i.e. (+ 1 1) is evaluated at read time. there's a dispatch for structs, like #S(FOO :A 1 :B 2) results in a structure foo with two slots a and b set to 1 and 2 respectively, but there's no corresponding constructor for classes. there's a reader for arrays, but that one doesn'
t let you
mircea_popescu: phf no, i ~know~. he doesn'
t expect, i don'
t expect either, but the difference is im being actively optimistic about it.
mircea_popescu: and don'
t tell me "by-hand optimized datastructs for each app and ad hoc protocols for each connection" if tyou will
phf: well, right now we don'
t even have standardized wires (irc and
http come closest in tmsr infra)
phf: i haven'
t had time to do any of this
a111: Logged on 2017-07-09 15:48 phf: which made me think that hashes are typically implemented in terms of machine words, so you don'
t have this kind of issues. fhf might be inherently "unoptimizable" since units that it operates on must be bignums
phf: well, one thing that ascii said "don'
t operate at a byte level", might also be the reason why lisp version is slower. bit vectors are stores as octet arrays, so tweaking single bit pulls a whole octet, does bit twiddling on it, and then puts it back. presumably can be sped up if one were to figure out how to work over an octet at a time
phf: which made me think that hashes are typically implemented in terms of machine words, so you don'
t have this kind of issues. fhf might be inherently "unoptimizable" since units that it operates on must be bignums
☟︎ phf:
http://btcbase.org/log/2017-07-08#1680544 << nope, in fact my "optimized" one i.e. the version where cmucl doesn'
t complain about unknown types with (speed 3) (safety 0), is about twice as slow as Go version. i'm curious why that would be the case, but haven'
t had a chance to investigate.
☝︎ trinque: can'
t just "this is how I answer" but also, "how do I ask", and "how do I know what I may ask"
mircea_popescu: asciilifeform ah yeah, it wasn'
t the width, it was that they didn'
t actually have standardized memory in any sense, or any concept of actula machine word
a111: Logged on 2017-07-08 22:31 mircea_popescu: one doesn'
t follow from the other.
mod6: <+mircea_popescu> "i don'
t know, baby... we'll have to ask your father..." << lol. cuckdad may want in too!
mircea_popescu: "i don'
t know, baby... we'll have to ask your father..."
a111: Logged on 2017-07-08 10:54 sina: wasn'
t as bad as I thought it'd be
sina: didn'
t end up using symlinks
sina: wasn'
t as bad as I thought it'd be
☟︎ sina: if you're an enemy capable of capturing a gossiptron and knowing of the things, why wouldn'
t you?
mircea_popescu: well yes, the program needn'
t be able to distinguish them from keys generally. bogus is an operator designation.
sina: one interesting thing is that I thought there would be some databases implemented as flat files, but I can'
t seem to find any
mircea_popescu: sina to find out which keys aren'
t assigned you also keep a /keys/available then
mircea_popescu: there's nothing wrong with measuring the world around. an attempt to explain why this is a waste of time isn'
t really going to be entertained.
mircea_popescu: asciilifeform i still didn'
t get what i'd call good numbers / a good measurement.
ben_vulpes: am i to take from this line in the od manpage that it doesn'
t actually output faithfully without extra flags?
mircea_popescu: sina simple example and i don'
t pretend like this is useful : /assignments/0f0a.txt contains or does not contain "hurrdurr". by checking if it does you know hurrdurr is assigned to 0f0a.
sina: although I don'
t get that either now that I think about it, how does the "assignments" file know which key is which?
sina: ok true, I didn'
t think of that
mircea_popescu: sina i don'
t get it ? make file with keys, make file with assignments. why mv ?
mircea_popescu: i don'
t know it has to be shitty, unless there's some other constraint, like "make it overnight"
mod6: with btc, even if "prototype" was imho worth using in the battlefield. "you go to war with the army you have..." doesn'
t mean either that it can'
t be made better or replaced later.
phf: or perhaps now that he has successfully served as the main driving force behind the tenets of tmsr technology and ensured that they are collectively accepted, he doesn'
t need to reaffirm them as much. but i also have wonder if the tenets have as much of a galvanizing effect now that we mostly had a chance to observe both their positive and negative effects?
mircea_popescu: optimizing compiler also inconceivable waste, mel didn'
t like its data positioning.