Welcome to this board. This board is for my personal use. I mostly work on technology, but I have other interests. I encourage anyone interested in imageboard technology or programming languages to read through and see if anything is interesting to you.

This is a general thread, for any discussion which does not fit into any of the other threads.

This thread is for collecting public keys. This solution will be temporary until a suitable site-wide PKI is available. Please remember: >this key collection is for ALL ANONS, regardless of board or even site >public keys are OPTIONAL, and should remain so >you may OPTIONALLY volunteer as much or as little additional information about yourself alongside your public key, the only recommendation I make is that visitors, tourists and other arrivals declare themselves as such >WHEN submitting public keys, the challenge is REQUIRED, and only public keys which submit a signed copy of the challenge text are likely to be respected >public keys NOT submitted with the corresponding challenge will be assumed to belong to somebody who is not actually present to submit their public key, while this is permitted it is recommended to please say so explicitly >there will be more opportunities to collect and receive public keys, do not worry if you miss this opportunity >it is expected that public keys >I may archive this thread later as a hard cutoff >it is my intention and expectation that anons with public keys will be able to help anons without public keys, in various ways to be discussed later >I am choosing the challenge text with some good-faith measures in mind, those who are interested in key collection are advised to discuss this with me later >if you realize later that you failed to generate a public key of the correct kind, do not panic, instead submit a corrected key at the next opportunity, and link the two keys together using mutual cryptographic signatures >if you wish to submit a public key of a different kind for any reason, use the same procedure, linking the two keys using mutual cryptographic signatures, and sign the challenge text with both >you may use the same key in multiple rounds of key collection The above may not be the same for every key collection. The keys for this key collection are two GnuPG-compatible NIST P-256 keys in plaintext, one for signing and one for encryption. In GnuPG these are: >ECC and ECC >NIST P-256 GnuPG may be downloaded at https://gnupg.org/ and is also available through the package managers of most Linux distributions. The relevant GnuPG commands are: gpg --full-gen-key --expert # generate a public key, remember to select the key parameters above, name does not matter but DO NOT actually use your real name gpg --armor --export <KEY> > <KEY-FILE.TXT> # generate the text version of the public key, for uploading gpg --local-user <KEY> --clearsign <CHALLENGE-FILE> # generate a signed copy of the challenge file <CHALLENGE-FILE>.asc, this may also be done to provide additional signatures as you feel appropriate Note that you will need to re-name the signed challenge file to a txt file. To submit your key, use the above commands with the provided challenge file, submit the text key, the signed challenge file and any supplementary signatures as a reply to this OP.

Separately from my technical work, I am very invested in the esoteric and the political. As I understand it, I have been "given" an unusual role in my life largely having to do with these in combination.

This thread is for discussion of technology and software specifically in the context of imageboards. This can include technology purpose-built for imageboards or technology in the context of being re-purposed for imageboard use.

This thread is for collecting cryptographic techniques, protocols and implementations.

This is a thread about STGL and its currently-existing prototype, PGL. STGL is the simply-typed graphics language, and will be a rough equivalent to OpenGL 3.3/WebGL 2 based on the simply-typed lambda calculus. STGL will simplify graphics programming by providing a type system directly to the programmer to immediately detect and prevent type errors. STGL will also generalize immediate processing, batch processing, display lists and command buffers by allowing render programs to be written as functions acting at any granularity and executed with any arguments. These functionalities already exist in a weaker form in the prototype PGL. This thread will likely be updated eventually with more/better images, once they exist.

DL1 is a computing model, virtual machine, intermediate representation and programming language. DL1 most closely resembles an untyped functional programming language with effects that corresponds to stored-program computers based on a pattern-matching variant of the lambda calculus. DL1 has three primary features distinguishing it from other functional languages: - Explicit evaluation: an eval function that is completely specified, does not perform macro-expansion, operates specifically on a small well-defined structured language and has the same semantics as a JIT compiler. - Meta-execution: a set of meta-execution primitives that allows for safe virtual execution of DL1 code. - Copy-on-write semantics: DL1 vectors include an update function that uses copy-on-write to guarantee constant-time mutation when possible and produces a copy of a vector otherwise.

DL2 is a functional programming language and intermediate representation based on System F-Omega. DL2 extends System F-Omega with iso-recursive types, recursive functions and sum-of-existential-product types. This variant of System F-Omega is representative of a large number of typed programming languages. This makes DL2 an attractive compilation target, as many languages can be compiled directly to DL2. DL2 is intentionally runtime-agnostic so that it can be compiled to many targets or embedded in other languages.

This thread is for collecting and evaluating papers and software related to networking and network protocols.