600+ entries in 0.27s
nicoleci: oh, there's all sorts. * You have been kicked from #sexe by Aquavelva (Banni: Tu es sur un canal shitlisté ici)
mircea_popescu: * chonkin (~katyab@c-75-67-100-34.hsd1.nh.comcast.net) has left #trilema << keks, too much is too much after all ?
nicoleci: in other lolz-- * Looking up chaostal.hackint.org * Connecting to chaostal.hackint.org (217.69.77.134) port 6667... * *** Notice -- You need to use SSL/TLS to use this server
hanbot: (specifically : File: */mp-wp/wp-admin/custom-header.php Expected: 3e4322c7d8f1757f883a9f11abec332b8c952d7b050c801e4ba60e72853509f0603e0ea63b093dacf4ca158fe309043984900efa5ea0348c2d1cd9d0eb46388f Actual: 05f567bca8d936ec36e315dd8b667a8654fbcb256758165986810db3f5402d3a9fdf1d3d4bc00de626d627d7e997da9ee08e5261127a216199ce8ff661a4c600 )
danielpbarron:
http://btcbase.org/log/2019-03-21#1903847 << i did a lazy greping of *.php files for "function(" and haven't yet found similar cases. There are two other anonymous funcitons without a "use" but they also don't have any outside variables to use, so no harm. The rest of the hits are on "create_function" which is similar to an anonymous function but is not victim to the same upgrading problem (still
☝︎ a111: Logged on 2019-03-10 03:02 mircea_popescu: memory, of course, starts with byte 299008 (584 * 512) and extends as far as 512 bits bus can address, if you're installing that. meaning, all core registers are allocated as memory anyways. and that's fucking it.
mircea_popescu: memory, of course, starts with byte 299008 (584 * 512) and extends as far as 512 bits bus can address, if you're installing that. meaning, all core registers are allocated as memory anyways. and that's fucking it.
☟︎ trinque: could try umount build/*; umount build
a111: Logged on 2019-02-16 09:44 ave1: diana_coman, in system-linux-*.ads (in gcc/ada directory) you'll find the line: ZCX_By_Default : constant Boolean := False;
a111: Logged on 2019-02-17 14:49 mircea_popescu: see, engineers are worse than whores. a whore might pretend like she's not working, but an engineer does inept shit like "/* This should optimize out, but it is wise to make sure this assumption is correct. Should these have different sizes, we cannot cast between them and the overlaying onto ERRATIC will not work. */" so as to ~pretend~ like he doesn't see WHY exactly he wants to take that code out. seriously, ooga-booga-bu
mircea_popescu: " /* Take care to ignore link-once functions that were removed. In these cases, the function address will be NULL, but if the encoding is smaller than a pointer a true NULL may not be representable. Assume 0 in the representable bits is NULL. */"
mircea_popescu: "/* The count field we have in the main struct object is somewhat limited, but should suffice for virtually all cases. If the counted value doesn't fit, re-write a zero. The worst that happens is that we re-count next time -- admittedly non-trivial in that this implies some 2M fdes, but at least we function. */"
☟︎ mircea_popescu: see, engineers are worse than whores. a whore might pretend like she's not working, but an engineer does inept shit like "/* This should optimize out, but it is wise to make sure this assumption is correct. Should these have different sizes, we cannot cast between them and the overlaying onto ERRATIC will not work. */" so as to ~pretend~ like he doesn't see WHY exactly he wants to take that code out. seriously, ooga-booga-bu
☟︎ mircea_popescu: gcc_assert (sizeof (const fde *) == sizeof (const fde **));
mircea_popescu: nt that does the exact same thing, but will resolve to the same library as implements __register_frame_info_bases. */
mircea_popescu: "/* ??? Glibc has for a while now exported __register_frame_info and __deregister_frame_info. If we call __register_frame_info_bases from crtbegin (wherein it is declared weak), and this object does not get pulled from libgcc.a for other reasons, then the invocation of __deregister_frame_info will be resolved from glibc. Since the registration did not happen there, we'll die. Therefore, declare a new deregistration entry poi
ave1: diana_coman, in system-linux-*.ads (in gcc/ada directory) you'll find the line: ZCX_By_Default : constant Boolean := False;
☟︎ mircea_popescu: Jan 30 15:42:41 * Disconnected (Remote host closed socket).
mircea_popescu: Jan 30 15:42:41 * Closing Link: pdpc/supporter/silver/mircea-popescu (Ping timeout: 240 seconds)
mircea_popescu: find . -name '*.php' | xargs wc -l or w/e it is you want
a111: Logged on 2019-01-26 08:58 diana_coman:
http://btcbase.org/log/2019-01-25#1889973 -> didn't rummage as too late yest but woke up this morning with this: when a= n-1 step 2.2 aka y=a^r mod n becomes y= (n-1)^r mod n; using for instance binomial expansion you have (n-1)^r = n^r + rC1
*n^(r-1)*(-1)+rC2
*n^(r-2)*(-1)^2+....+rC(r-1)*n*(-1)^(r-1)+(-1)^r; since the whole thing was "mod n", of all those terms you are in fact left with only the last one, aka y = (-1)^r mod n ; r is odd so
diana_coman:
http://btcbase.org/log/2019-01-25#1889973 -> didn't rummage as too late yest but woke up this morning with this: when a= n-1 step 2.2 aka y=a^r mod n becomes y= (n-1)^r mod n; using for instance binomial expansion you have (n-1)^r = n^r + rC1
*n^(r-1)*(-1)+rC2
*n^(r-2)*(-1)^2+....+rC(r-1)*n*(-1)^(r-1)+(-1)^r; since the whole thing was "mod n", of all those terms you are in fact left with only the last one, aka y = (-1)^r mod n ; r is odd so
☝︎☟︎ mircea_popescu: first fucking thing on the scam's landing page being "* Note: The base commission is set to 50% to reduce affiliate fraud from newbie affiliates. After 90 days and 10 sales you can request to be moved to 60% commission tier."
hanbot: * shinohai has quit (Quit: No, I do not belong to The Most Delusional Republic) << the amusing part being that it'd seem that's the only republic you -do- belong to.
mircea_popescu: * shinohai has quit (Quit: No, I do not belong to The Most Delusional Republic)
a111: Logged on 2019-01-15 17:36 asciilifeform: the output is n1 * n2 * ... n_n , cuz you represented'em as ~probabilities~
a111: Logged on 2018-12-22 00:16 asciilifeform: * mircea_popescu has quit (Ping timeout << lol didja try an' run the test and overheat yer box
mircea_popescu: fwiw, /me has settled on 221 as the perfect number to build "what is asym crypto" around. experimentally, NOBODY knows it's 13 * 17 nor manages to find out.
a111: Logged on 2018-12-10 14:27 mircea_popescu: * IMPORTANT: config file '/etc/hosts' needs updating. << da fuck is that.
mircea_popescu: * IMPORTANT: config file '/etc/hosts' needs updating. << da fuck is that.
☟︎ trinque: can speed things up by copying /cuntoo/packages/* to the packages folder in the bootstrapper dir
a111: Logged on 2018-11-30 03:22 asciilifeform: ... or that the #define ULT(a, b) ((a ^ ((a ^ b) | ((a - b) ^ b))) >> (sizeof(a) * 8 - 1)) macro dun turn to barf in the preprocessor on acct of some esoteric beard shaving from dennis richie ?
a111: Logged on 2018-11-26 14:19 phf: vpatch is picky about what it accepts, it's basically only a/foo/* b/foo/*, where's vdiff can accept a totally random stuff like /foo/bar/qux diffed against /dev/null or whatever. right now even diffing two straight files e.g. vdiff x y will produce a non-pressable vpatch. this is all not so much a bug as an unexplored aspect of vdiffing which is also part of the whole rename tracking.
phf: but to your point specifically, i was thinking that if you provide only one argument, right now vdiff errors out, so i think it would be better if it produced genesis. e.g. vdiff foo could produce a a/foo/* false b/foo/* 123 vpatch
phf: vpatch is picky about what it accepts, it's basically only a/foo/* b/foo/*, where's vdiff can accept a totally random stuff like /foo/bar/qux diffed against /dev/null or whatever. right now even diffing two straight files e.g. vdiff x y will produce a non-pressable vpatch. this is all not so much a bug as an unexplored aspect of vdiffing which is also part of the whole rename tracking.
☟︎ a111: Logged on 2018-10-30 19:50 mircea_popescu: asciilifeform ok, how about this : let K being the key n bits long (say 512), and let f(x) = 2 * K[0] * x ^ n + 3 * K[1] * x ^ n-1 + 5 * K[2] * x ^ n-2 + 7 * K[3] * x ^ n-3 + 11 * K[4] * x ^ n-4 +...+ 3643 * K[n-2] * x ^ 2 + 3659 * K[n-1] * x + 3659. f(x) will produce a pile of bits, this pile is cut in half and xored together, the result is cut in half again. one such half is returned as the prng output ; the other such half
mircea_popescu: asciilifeform ok, how about this : let K being the key n bits long (say 512), and let f(x) = 2 * K[0] * x ^ n + 3 * K[1] * x ^ n-1 + 5 * K[2] * x ^ n-2 + 7 * K[3] * x ^ n-3 + 11 * K[4] * x ^ n-4 +...+ 3643 * K[n-2] * x ^ 2 + 3659 * K[n-1] * x + 3659. f(x) will produce a pile of bits, this pile is cut in half and xored together, the result is cut in half again. one such half is returned as the prng output ; the other such half
☟︎ mircea_popescu: no no, x is xor * is multiplication (in the sense that if the key is 0 at that offset, the rb dun get applied)
mircea_popescu: To obtain P back from E without K : P[1] = P[1] x K[1] * P[1] x K[2] * P[2] x K[3] * P[3] x K[4] * P[4] x K[5] * P[5] ; P[2] = P[2] x K[1] * P[2] x K[2] * P[3] x K[3] * P[4] x K[4] * P[5] x K[5] * P[6] ; and so following all the way down.
mircea_popescu: asciilifeform this isn't much of an argument, let alone "proof". + and * also conserve entropy, yet y=x/2 - x/2 +4 does not.
mircea_popescu: this is the argument against "indepenent owners" among the orcs, too, and in general -- they'll do insane things like keep property 10% occupied for $pricepoint, and ignore that $pricepoint * .1 comes to less net than $half-pricepoint * .6
a111: Logged on 2016-06-10 18:07 asciilifeform: ;;calc 10**12 / ((9600 / 8) * 60 * 60 * 24)
mircea_popescu: piece of shit does not know what ffmpeg -i *.x *.y could POSSIBLY mean
mircea_popescu: just in case anyone else's making audio cd's for the car, for i in *.mp3; do ffmpeg -i "$i" -f wav "${i%}.wav"; done
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.