3100+ entries in 0.398s
shinohai:
^ nope, and handily Buttfinex is apparently gonna list it making it convenient to dump.
Framedragger: doppler: there's your project right there :D
^ BingoBoingo:
^ Nothing about amends to non-people which would be injurious to actual people
Framedragger: (
^ thought of printing out project names for doppler to look at)
a111: Logged on 2017-03-18 11:03 Framedragger:
http://btcbase.org/log/2017-03-10#1624858 << re rdtsc etc, i'm curious, does `grep -E '
^model name|
^cpu MHz' /proc/cpuinfo` consistently report to you mhz which are (+/-1 a mhz or so) equal to model frequency? (i know you can turn off linux powersaving etc features)
Framedragger:
http://btcbase.org/log/2017-03-10#1624858 << re rdtsc etc, i'm curious, does `grep -E '
^model name|
^cpu MHz' /proc/cpuinfo` consistently report to you mhz which are (+/-1 a mhz or so) equal to model frequency? (i know you can turn off linux powersaving etc features)
☝︎☟︎ trinque erases his pending restatement of
^ Framedragger: mircea_popescu:
^ you can remove that sig_handler definition from fuckoff.c (as well as the signal.h #include) fwiw, as that that code won't ever be executed
Framedragger:
^ should be gold standard for hw vendors for all i know
mircea_popescu:
^ me heartily recommends, this fundamental novel of the republic, to the critical eye of all.
Framedragger: yeah, given actual tx amounts.. 250mn vs. 2
^32
Framedragger: orly? this is *ns* (10
^-9), mind you. hm. and this is just resolution of path with single symlink in it
BingoBoingo:
^ Some idiot said Qntra was a "Pro-China" rag
Framedragger: re. fs nodes, couldn't sleep + not sure if this makes sense, so just throwing these out - barebones super simplistic (function is `n_objects_to_store
^ 1 / folder_depth`) plots showing expected average number of nodes per folder (assumptions are no bias in hashspace and also equal share of hash bits per folder level) - it may not be intuitive how low the averages are until you look:
Framedragger: assuming equally distributed transaction hashspace, if you want your tree to fill up with 1000 nodes on average per given depth, you'd be storing 10
^24 transactions. but this assumes that every folder depth gets assigned equal number of bits to represent, of course.