800+ entries in 0.224s
a111: Logged on 2017-03-02 16:31 asciilifeform: it is worth recalling the gedankenexperiment where it turns out that all you'd need to build 'martian bank' on earth, is if martians merely supplied an infallible 'martian clock', a service whereby they take a
string S , at regular, say, daily, interval, and return its hash H
mircea_popescu: in other "furious activity as cover for impotence", the
string "&nslookup djY7ekWd&'\\\"`0&nslookup djY7ekWd&`'" is going to do something! maybe as a referrer ? maybe if you stuff it into a comment ? IT IS A MAGICALLY POWERFUL
STRING!
a111: Logged on 2017-12-22 06:54 mircea_popescu: Techman say /query deedbot to open a pm session ; say !!up in there to it ; then return !!v the
string.
mircea_popescu: i dun recall what the procedure is, does it let you !!register the new one ? (as in, spits out a v
string ?)
mircea_popescu: Techman say /query deedbot to open a pm session ; say !!up in there to it ; then return !!v the
string.
☟︎☟︎ trinque: lol, stale response
string a111: Logged on 2017-12-17 01:40 asciilifeform stuck presently in an infuriating gnat labyrinth : turns out, a proggy that set pragma Restrictions(No_Secondary_Stack) , cannot use Ada.Command_Line ( equiv of argc/argc in c-planet ). so then asciilifeform went to make own replacement. and turns out , guesswat, no can haz, because pragma Restrictions(No_Unchecked_Conversion) -- and argv, where commandline lives, is a pointer to nonadatronic (i.e. c-style)
string .
mircea_popescu: why the fuck would standford give a dumb neet as much as a length of
string "because they need it" ? let them need from their fucking mother / community college.
phf: i've had color disabled in my editors for years now, though some color like comments and
string sequences is somewhat handy
a111: Logged on 2017-11-22 00:33 mircea_popescu:
string is not a primitive!
a111: Logged on 2017-11-21 19:38 phf:
http://btcbase.org/log/2017-11-20#1741179 << you can just ignore the whole "
string" question in first version, McCarthy's lisp used symbols instead of strings (that's why early nlp code, like eliza all come out as DOG SAID, HELLO) and the only operation you could do at some point was read and eq.
a111: Logged on 2017-11-21 19:38 phf:
http://btcbase.org/log/2017-11-20#1741179 << you can just ignore the whole "
string" question in first version, McCarthy's lisp used symbols instead of strings (that's why early nlp code, like eliza all come out as DOG SAID, HELLO) and the only operation you could do at some point was read and eq.
phf: (read-from-
string "#.(format t \"hello, world~%\")")
phf:
http://btcbase.org/log/2017-11-20#1741179 << you can just ignore the whole "
string" question in first version, McCarthy's lisp used symbols instead of strings (that's why early nlp code, like eliza all come out as DOG SAID, HELLO) and the only operation you could do at some point was read and eq.
☝︎☟︎☟︎ a111: Logged on 2016-02-25 17:12 phf: i've been mulling over that question with logs. fwiw, entire log can be kept in memory for analysis, annotation, whatever, 180mb as utf-8 byte arrays. with unicode strings takes up twice the memory on 16-bit cmucl, and ~~4 times on 32-bit sbcl. i'm not yet convinced that transcoding everything you get into
string and then transcoding it back to a bytearray onto the wire is the best strategy
mircea_popescu: can't imagine why not, ada still uses fixed calling, you can't call by pointer-to-
string or shit can you
phf: for example your Symbol_EqualP should just be a pointer comparison, rather than
string comparison. (the whole point of a ~symbol~ over a
string is that it's interned, i.e. same sequence of characters always map to the identical Symbol object)
a111: Logged on 2017-11-13 19:29 phf:
http://btcbase.org/log/2017-11-13#1737247 << it looks like a properly structured scheme evaluator, but it's ~explicitly~ lacking a native cons, which might be a very good exercise for whoever™ adding a static allocation space, adding mark-and-sweep, then all those To_Unbounded_String look like they can be simply search/replaced
phf:
http://btcbase.org/log/2017-11-13#1737247 << it looks like a properly structured scheme evaluator, but it's ~explicitly~ lacking a native cons, which might be a very good exercise for whoever™ adding a static allocation space, adding mark-and-sweep, then all those To_Unbounded_String look like they can be simply search/replaced
☝︎☟︎ mircea_popescu: wer you can now self-voice, so i don't have to up you every half hour. say !!up to deedbot (in private message). it will give you something to decrypt. you decrypt it, then say !!v <
string> and you're voiced.
wer: so what do i do with the
string ag3nt_zer0: i think the confusion for me stems from hearing two different descriptions of brain wallets - one described as a way to, if i recall correctly, convert a privkey to a
string of words to then be memorized and carried in brain over international borders or what not... and the other encounter I have with this concept is pete's method of generating a high entropy keypair and I am pretty sure I am answering my own question here but wou
mircea_popescu: "which is the count of repetitions before
string x becomes prime number"
mircea_popescu: ang-st say !!up to deedbot in a pm, then !!v with the challenge
string trinque: I'll go change to to encode the FP as repititions of the
string "cocks" to signify
a111: Logged on 2017-08-09 17:59 mircea_popescu: basically they had this early elliptic curve crypto, implemented as an arbitrary cone on which they wrapped a
string. because the
string is fixed length see, whereas the section of cone is not.
mircea_popescu: which is what that whole " a new $
string which resolves to $hash" is all about.
trinque: take a particular trilema article, your node announces that there is a new $
string which resolves to $hash and your node signed the fact
a111: Logged on 2017-10-17 13:36 asciilifeform: in other thefts, 'The researchers went on to find 15 factorizable keys used for TLS. Strangely, almost all of them contain the
string "SCADA" in the common name field.'
a111: Logged on 2017-10-08 00:16 asciilifeform: the ONLY correct method of generating cryptoprimes, is to 1) get N bits from FUCKGOATS 2) determine, in fixed spacetime every single time, whether that
string of bits constitutes a usable prime.
mircea_popescu: as no 0 led or 0 terminated
string will ever pass anyway
a111: Logged on 2017-10-08 00:16 asciilifeform: the ONLY correct method of generating cryptoprimes, is to 1) get N bits from FUCKGOATS 2) determine, in fixed spacetime every single time, whether that
string of bits constitutes a usable prime.
mircea_popescu: ben_vulpes technology is built by steps. so far, being able to put in machine terms a "ask all the bots see which one mentions 'payments' as a
string" is a legitimately useful ability.
mircea_popescu: in other lulz, anyone familiar with the early anti-pot hearst smear campaigns ? (1930s). it's a long
string of, basically, "do you want your daugther sucking mexican cock ? and corrupting her sister to participate in wild orgies? ?!?! !!?!?!? "
mod6: Basically when working with Strings.Fixed I end up making arrays (of fixed size) of strings (of fixed size), need to use caution always to not continue to iterate if the
string at a given index is filled with ' '.
mircea_popescu: you can't make her a
string of anal beads out of them ?
mircea_popescu: so you'll settle on "dirac's delta visibly parsimonious ;
string theory not so visibly if at all" ?
mircea_popescu: and i suppose the evident similarity between dirac delta and "whichever unnamed abstractions you support your estimation of
string theory" is also striking to you ?
a111: Logged on 2017-09-07 03:07 asciilifeform: s clearly an area of tremendous importance. In fact, I had to switch to an engineering department to work on it, because physics departments are broke and enamoured with ex-
string theorist well-fare projects like topological insulators....'
a111: Logged on 2016-12-22 23:43 asciilifeform: 'AI risk is
string theory for computer programmers. It's fun to think about, interesting, and completely inaccessible to experiment given our current technology. You can build crystal palaces of thought, working from first principles, then climb up inside them and pull the ladder up behind you.'
a111: Logged on 2017-09-19 21:39 phf: i've actually tried putting ropes in a bunch of projects and they never have good performance characteristics. in fact for text editors no one has invented anything better than "one
string per one line", and if you want to be fancy you split it at point (what emacs does)
phf: i've actually tried putting ropes in a bunch of projects and they never have good performance characteristics. in fact for text editors no one has invented anything better than "one
string per one line", and if you want to be fancy you split it at point (what emacs does)
☟︎ mircea_popescu: "visually recognizes
string, like parrot" or somesuch ?
mircea_popescu: i'm entirely unsure why these two items (
string theory ; high energy particles) are so strictly welded together in your head.
mircea_popescu: "give me the list of all lines with
string x" are not requests for urls per se, but requests for computation. "please interpret the indirection layer and compose a list of urls as a solution to that".
mircea_popescu: kanzure you are experiencing the following problem : you do ocr on old text, which produces ambiguities that bite you in the ass. yes the
string "patent" can be found in medieval and early modern period documents. the item thereby denoted however is not a patent.
mircea_popescu: ie, "why do you know so much about
string theory ?" "because im on this biker forum and this guy steve keeps posting articles about it" "yes but... it's neither that important nor interesting" "i dunno"
mircea_popescu: kanzure say !!up to deedbot in private then !!v to verify the
string it gives you
Birdman: and i type just that
string after the rest at the same time? "whatever.py C:/handhistories python hands2.py c:\directory > logfile.txt" ?
a111: Logged on 2016-08-18 12:32 mircea_popescu: asciilifeform since we're on this btw, the way i want tmsr-rsa key generation to work is as follows : a contains a number of entropy bytes specified by user in tmsr-rsa.conf read whenever tmsr-rsa.conf specifies (such as urandom); b contains a base-tmsr
string specified by user. c = base-tmsr(a).b ; p = nextprime(cut(sha512(c),257)) ; process is repeated for q = nextprime (cut(sha512(c'),258));
mircea_popescu: if you're asking "what is the probability of a 4000 bit
string being randomly generated so it matches an arbitrary crc32", the answer is you know, 1 in infinity.
mircea_popescu: crc checks that the
string is the same now as it was when crc was originalyl computed
PeterL: not trying to catch changes, trying to catch random
string accidentally passing the check
mircea_popescu: PeterL if your
string is 250 chars, there is 0 probability that an up to 32 bit setcion being altered in any way will not be caught up
PeterL: also, my question re crc32 yesterday, I meant to say: given a (random)
string of 250 chars, what is the proability that (random four byte
string) will pass the crc32 test? which I think is just 1/256^4
PeterL: well, it is not unpadded, it uses the random byte
string as the pad
mircea_popescu: and finally re crc : given a
string S of any length, the probability of a
string S' where less than 32 bits have been altered in a "burst" passiong crc32 is 0. if you go over 32 bit long bursts the probability is ~ proportional to the burst length / 32.
PeterL: Is there a way to calculate the probabilty that a random
string of 256 bytes will pass a csc check?