freenode/#lisp - IRC Chatlog
Search
13:17:11
Xach
leo_song_: I'm having a weird problem with osicat, and it looks like it *might* be related to the most recent cffi commit
13:33:35
perdent1
Hi I have a crypto challenge for you all, let me know what you think of it and if you can solve it ! Good luck The more the merrier, right? We decided to mash two of the best cryptosytems together for the best product. Our new encryption scheme is up and running and this time it is unbreakable! To prove that, we have also released its source code and a test center where you can test it out! host: 139.59.178.146:31817 (flag is located on the server) https
14:07:22
luis
Xach: thanks, I'll have a look and probably revert that bit. sadly osicat's travis cronjob was not active :(
14:46:24
luis
Xach: pushed 0.24.1, which fixes osicat. Activated osicat's travis cronjob so that hopefully this sort of things gets caught before it reaches Quicklisp next time. thanks.
16:02:18
Xach
Josh_2: https://github.com/xach/vecto/commit/312dea5860c04739d872e21ee9fdb2c759ac5f45 shows how you can do anything you want when blending two colors together with vecto
18:02:48
jcowan
beach: I don't understand why you need to compromise on allocation. OPT paging is impossible because the kernel has only peephole into what the user program is going to do. But you have the whole lexical scope already available, so no need to *estimate* what the remote distance.
18:03:13
jcowan
Of course there are conditionals, so that requires a model of probable branching. But I suppose you have that already in order to optimize compiling them.
21:29:43
jcowan
I always have to search for [scheme language] or [scheme programming] on Google because of this issue. SCHMER would have been a much better name
21:30:56
jcowan
As for the unbreakable crypto scheme, it is one-time tape/pad (xor each bit with a truly random bit, which must be available at both ends). Of course the key distribution problem is vicious.
21:38:42
pjb
Well, it wasn't really a restriction, it was an optimization. Implemented in LISP 1. You can see it in the sources of LISP 1.5.
21:39:30
pjb
Basically, 36-bit hardware, 6-bit characters. Strings were represented using lists of words containing packed 6-character.
21:40:18
aap
so it would have been extremely unusual to call something by a name longer than 6 chars
21:40:39
pjb
unix too was developped on such a system (18-bit words), hence creat and similar function names.
21:43:10
pjb
That said, indeed, one could wish more people used more unique names. I liked IBM naming scheme. Like IEBFR14; there's no ambiguity.
21:45:08
pjb
aap: the story of true matches the story of iebfr14. You'd be surprised by the commit list.
23:32:23
jcowan
UTF-18 should be replaced by UTF-18+, which would represent planes 0,1,2,3 instead of 0,1,F,10
23:34:38
jcowan
Gotta love this: "We are now in the process of implementing support for nonet-based text files and automated transformation between septet, octet, and nonet textual data."
23:36:56
jcowan
Compuserve ran a modified TOPS-10 for a very long time, which is why Compuserve emails were 7xxxx,xxxx@compuserve.co,m
23:38:57
jcowan
I also devised UTF-6, an almost upward compatible extension of Sixbit, but I didnt write an RFC, so I've forgotten the details
23:44:15
aeth
(hmm, 0.6.8 is the oldest tagged version... SBCL news on the website goes back to 0.6.0, though)
23:45:37
jcowan
The general idea is to preempt 077, Del in ECMA-1, to show that a non-Sixbit character has been encoded in the general style of UTF-8
23:46:00
jcowan
https://www.ecma-international.org/wp-content/uploads/ECMA-1_1st_edition_march_1963.pdf
23:46:59
moon-child
jcowan: sounds like it loses the big advantage of utf8, which is that you can always identify continuation bytes (sextets?)
23:49:43
jcowan
Ah, no, what it preempts is SI and SO, so because there are always both you can identify sequences.
0:32:05
jcowan
It should be possible to run CLISP using one of the several C compilers avaiilable for TOPS-10/20.