We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
User:Blashyrkh/Golf/Code
< User:Blashyrkh | Golf
14
The last resort is the X(/....X)\ -> (X/....)\ rule, it may allow to save few bytes when the code appears to be not golfable any further. Also, if your program ends with \, the symbol may be removed without hesitation: the language doesn't require for every / to have its matching \.
Looping counter
33 bytes
1:1--::-41::-:1--::-(>(/:o>)\>:<)
32 bytes
1:1--::-41::-:1--::-((>/:o)\>:<)
A+B
101 bytes
::1:(/::-i:::-:1:1---(/:-4:4>-<->:::>-<--::::>>-<--:::>-<--::-<--::-<--i:::-:1:1---)\uu>u)\<--O1:1--o
88 bytes
::1:(/::(-i:::-:1:1---/:-4:4>-<->:::>-<--::::>>-<--:::>-<--::-<--::-<-)\uu>u)\<--O1:1--o
Primes
121 bytes
::1:::-:1--(<(/</::>-<\>/(/<<)\<:->:\-/<<\)\</<:::->>:O::-44::-11-::-1-o>\<::-:1--<(/:<::-:1--:>-/:-<\>/<<:->\-<<)\<:-1<)
120 bytes
::1:::-:1--(<(/</::>-<\>/(/<<)\<:->:\-/<<\)\</<:::->>:O::-44::-11-::-1-o>\<::-:1--(</:<::-:1--:>-/:-<\>/<<:->\-<)\<:-1<)
Quine
1713 bytes
::4>:14>:14>:4>:4>:1>:4>:11>:411>:14>:1>:1>:111>:41>:141>:4>:4>:1>:14>:14>:4>:4>:1>:4>:11>:14>:1>:1>:4>:111>:41>:4>:114>:44>:4>:4>:1>:4>:414>:144>:411>:41>:141>:4>:4>:4>:1>:11>:1>:141>:4>:1>:4>:144>:41>:141>:4>:4>:1>:4>:14>:14>:1>:1>:111>:44>:144>:41>:4>:4>:4>:1>:14>:1>:141>:4>:1>:4>:144>:41>:141>:14>:4>:4>:1>:4>:11>:14>:1>:1>:111>:44>:144>:41>:4>:4>:4>:1>:11>:11>:1>:141>:4>:1>:4>:144>:41>:141>:4>:1>:11>:114>:44>:144>:41>:4>:4>:4>:1>:11>:14>:1>:141>:4>:1>:4>:144>:41>:141>:4>:1>:14>:114>:44>:144>:41>:4>:4>:4>:1>:14>:11>:1>:141>:4>:1>:4>:144>:41>:141>:4>:4>:1>:11>:4>:11>:4>:41>:1>:44>:1>:1>:111>:44>:144>:41>:4>:4>:4>:1>:14>:14>:1>:141>:4>:1>:4>:144>:41>:141>:4>:4>:1>:4>:11>:4>:4>:14>:41>:41>:1>:44>:1>:44>:1>:1>:111>:44>:144>:41>:4>:4>:4>:1>:11>:11>:11>:1>:141>:4>:1>:4>:144>:41>:141>:111>:44>:144>:41>:4>:4>:4>:1>:11>:11>:14>:1>:141>:4>:1>:4>:144>:41>:141>:4>:4>:1>:4>:14>:1>:4>:11>:1>:1>:111>:44>:144>:41>:4>:4>:4>:1>:11>:14>:11>:1>:141>:4>:1>:4>:144>:41>:141>:4>:1>:14>:14>:4>:4>:1>:11>:4>:4>:1>:14>:1>:1>:111>:44>:144>:41>:4>:4>:4>:1>:11>:14>:14>:1>:141>:4>:1>:4>:144>:41>:141>:4>:1>:14>:4>:4>:1>:4>:14>:14>:1>:4>:41>:1>:44>:1>:111>:44>:144>:41>:4>:4>:4>:1>:14>:11>:11>:1>:141>:4>:1>:4>:144>:41>:141>:4>:1>:14>:11>:4>:4>:1>:11>:1>:111>:44>:144>:41>:4>:4>:4>:1>:14>:11>:14>:1>:141>:4>:1>:4>:144>:41>:141>:4>:1>:14>:11>:111>:44>:144>:414>:44::-:1(4--o>/::-44::-:14--:o>:O<::-:)\(>/:::-1-/:-:\>/::-:44--o<\>:::-4-/:-:\>/4::-:14--o<\>:::-11-/:-:\>/:-1O<\>:::-14-/:-:\>/:-4O<\>:::-41-/:-:\>/::-1:1:>-<--o<\>:::-44-/:-:\>/::-:1::4>>-<-<--o<\>:::-111-/:-:\>/o<\>:::-114-/:-:\>/::-:4-:1--o<\>:::-141-/:-:\>/:-44::-1::-4--o<\>:::-144-/:-:\>/:-4::-:44-:>-<-o<\>:::-411-/:-:\>/:-41::-1-o<\>:::-414-/:-:\>/:-41o<\)
BLC
Looping counter
148 bits
It uses right-fold list for internal operations, which is transformed into Church list. The output is an infinite binary string: 10110111011110...
0001010100010110100000010111000001001011100000110100000000001011110110010101011111011110000001011100000100101111110110101101000000001011011101100010
140 bits
Instead of ignoring the input, this version infinitely postpones it.
01010001011010000001011100000100101110000011010000000000101111011001010101111101111000000101110000010010111111011010110100000000101101110110
97 bits
Right-fold lists are not good for this problem. In this version Church numeral specifies number of 1's:
0001000101101000100000010110000001011000001011000010110000011001011110111000000111001011111011010
Primes
325 bits
Two times larger than Tromp's program, and slower.
0100000001011000001100001011000001101111001000101011010000010000001110011101000000001000001011011001010111111011111000010101111011111000000101111111101100101110010100011010000000010110000011001010111000000101100000101100101111011101100000101111110100001110011000001000000111001011111101101001011100001011000001100000110000010
Quine
512 bits
Yes, Tromp's quine is much shorter (132 bits). But his quine prints not just its text but also additional input passed to stdin. This quine, on a contrary, can't be confused by stdin. It always prints itself and nothing else. The program consists of two identical parts, one of which is the code and another is the input. Number of input bits to be consumed by the program is limited by hard-coded constant. This version's constant is 256.
It could be shorter. Actually, it was padded with several copies of 01010000100010 (KII) to align program size to the constant's value. 216 was close enough, but program with this constant was 214 bits long, and I didn't find a way to provide 2 bit padding.
01010000100010010100001000100101000010001001010000100010000100011001100000100100010100010110000000011100000010111111010000101101110111100000101001010001010110000000011000000101111110000101101110111110100000110000010101100100011010010001101000000111001110100101000010001001010000100010010100001000100101000010001000010001100110000010010001010001011000000001110000001011111101000010110111011110000010100101000101011000000001100000010111111000010110111011111010000011000001010110010001101001000110100000011100111010
432 bits
Rewritten the code, now it's 134 bits + size of hard-coded constant. The nearest constant I managed to find is 216 (50 bits long), which required to add 32 bits of padding.
010100001000001001010000100000100001010000010111010010111010000010010101010100011000011100001110011101000000111001110011101000000001100000010111111000000101111111011001011101111010100000110000010100000000101101110110010100001000001001010000100000100001010000010111010010111010000010010101010100011000011100001110011101000000111001110011101000000001100000010111111000000101111111011001011101111010100000110000010100000000101101110110
In human-readable form:
nil = λ f e . e
append = λ l el f e . l f (f el e) // append to right-fold list
print = LENGTH
(λ cont acc list . cont (append acc (car list)) (cdr list))
(λ acc list . acc)
nil
quine = λ input . (λ l f e . l f (l f e)) // duplicate "(print input)"
(print input)
(λ el cont f . f el cont) // convert from right-fold list to Church list
nil
BLC8
Hello, world!
Both versions exploit the fact that all tail garbage from source file is prepended to the program's input. So, the string "Hello, world!\n" is stored in the source file as is (.rodata of some sort). The goal is to print only this string and not to print the remaining input.
28 bytes
Fixed-length reverse string printer. String length (14) is hardcoded:
51 99 99 99 99 99 99 98 30 0c 3e 16 de 08 0a 21 64 6c 72 6f 77 20 2c 6f 6c 6c 65 48
In human-readable form it looks like this (but some function calls are in fact inlined):
hw = 14
(λ cont acc list . cont (cons (car list) acc) (cdr list))
(λ acc list . acc)
nil
25 bytes
The string to be printed is terminated with a code with most significant bit set (not used by 7-bit ASCII subset):
46 81 81 5c 18 5b 97 ef b0 40 48 65 6c 6c 6f 2c 20 77 6f 72 6c 64 21 0a 80
In decoded form:
hw = (λ x . x x)
(λ self input . input (λ head tail . car head (cons head (self self tail)) nil))
Looping counter
45 bytes
Much worse result than PkmnQ's, but I have no idea (yet) how to represent output codes (0x2A and 0x0A) as 8-bit Church lists of Church booleans more compactly. They alone occupy more space that the rest of the program.
11 68 81 60 59 11 99 05 82 cd 81 60 d9 14 1c ce 6e 05 82 c0 b0 6c 16 16 44 66 66 c0 b0 6c 8a 0e 67 37 02 c1 60 58 36 09 7b 81 cb ed 00
In human-readable form it looks like this:
bootstrap = λ f . f f 1 main_loop = λ self n . n (cons "*") (cons "\n" (self self (+1 n))) main = λ input . bootstrap main_loop
24 bytes
Output codes are stored in .rodata section. Better than previous one but still worse than PkmnQ's:
41 81 81 7f 7b 20 2a f7 16 80 17 81 6f 61 6c ab f7 c0 e5 fd ae c0 2a 0a
Brainfuck
Looping counter
54 bytes
Worse than PkmnQ's but it's the best I could (so far):
++++++++++[>+>++++<<-]>>++>>+[[[<]<.>>[>]+<-<]<<.>>>+]
Kolakoski sequence
176 bytes
Implementation with logarithm memory consumption and o(n) time complexity can be found here: User:Blashyrkh/Kolakoski-brainfuck
84 bytes
Naive but short (it moves data array to the left after each step to restore the memory layout):
+++++++[->+++++++<]>.+..->>++[[[>]+[<]<.>>-]>[[>]++[<]<<+.->>>-]>[[-<<+>>]>]<<<[<]>]
80 bytes
Like the previous one but moves ASCII constants to the right after each step:
+++++++[->+++++++<]>.+..->>++[[[>]+[<]<.>>-]>[[>]++[<]<<+.->>>-]<<<[->>+<<]>>>>]
74 bytes
Like the previous one but more dense memory layout:
+++++++[->+++++++<]>.+..->++[[[>]+[<]>.>-]>[[>]++[<]<+.->>-]<<[->>+<<]>>>]
Quine
415 bytes
I wrote this one in 2012:
->++>+++>+>+>+++>>>>>>>>>>>>>>>>>>>>>>+>+>++>+++>+++>+>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>+>+>++>>>+++>>>>+++>>>+++>+>>>>>>>++>+++>+++>+>>+++>+++>+>+++>+>+++>+>++>+++>>>+>+>+>+>++>+++>+>+>>+++>>>>>+++>+>>>>>>>>>++>+++>+++>+>>+++>>>+++>+>+++>+>++>+++>+>+>++>+++>+>+>>+++>>>+++>+>>>++>+++>+++>+>>+++>>>+++>+>+++>+>++>>>+++>++>>>+++>>+[-[->>+[>]+>+[<]<]>>+[>]++++>++[<]<<+]>>>[>]+++>+[+[-<++++++++++++++++>]<++++++++++.<]
Hot
Looping counter
154 bytes
S(S(KS)(SK))K(S(S(KK))(K(SS(SKK)(S(K(S(S(KS)(S(SSS(K(S(KS)K)))(K(S(S(KS)K)(SKK))))))))(S(K(S(K(S(S(KS)(S(KS)K))))))(S(S(SSK(K(S(S(KS)K)))))(SKK)))(SKK))))
Truth-machine
78 bytes
S(S(KS)(SK))K(S(K(S(S(S(KS)(SSK))(K(S(K(SS(S(S(KS)K))(K(S(SKK)(SKK))))))))))K)
Immutable Brainfuck
Hello, world!
125 bytes
0010100011000010100100111001101110100111111110111111011110000010100110101111101110011011100110111101001110001001[0>.>>>>>>>>]
Looping counter
62 bytes
10100001010100000000[>>>>[>>>.>>>>][<<<<<<<]>>1010100<<<<<<1>]
Truth-machine
34 bytes
,>.>>>>>>>[1]>[<<<<<<<<.>>>>>>>1>]
Lazy K
Hello, world!
467 bytes
`k```s``s``s`s``s``s``s``s``s``s``s```````````ss`ss``ssk`s``s`kski``s```s`sis`k``s`ksk`k``s`k`s``s`ks``s`k`sik``s`kkki`k```s`s``ssi`s``s`kski````si`ss```ssk`s``s`kski````s`s``ssi``ssk`s``s`kski``````ssk``s`si```sss`ks`sski```s``s```ssi``sss`sks``s`ksk```s`s``ssks``s`ksk`````s`sss```ssk`s``s`kski`s``s`ksk`k```ss``s`s`sis`k``s``s`kski`k````sis```s`ssk```ssk`s``s`kski```s`s``ssks``s`kski```s``s`k``sss`sis``s`ksk````ss`ss`s`k```ssk`s``s`ksks````s`si`ss`ss`k`s``s`kski
465 bytes
```s``s``s`s``s``s``s``s``s``s``s```````````ss`ss``ssk`s``s`kski``s```s`sis`k``s`ksk`k``s`k`s``s`ks``s`k`sik``s`kkkk`k```s`s``ssi`s``s`kski````si`ss```ssk`s``s`kski````s`s``ssi``ssk`s``s`kski````si`s``ssk```sik`s``s`kski```s``s```ssi``sss`sks``s`ksk```s`s``ssks``s`ksk`````s`sss```ssk`s``s`kski`s``s`ksk`k```ss``s`s`sis`k``s``s`kski`k````sis```s`ssk```ssk`s``s`kski```s`s``ssks``s`kski```s``s`k``sss`sis``s`ksk````ss`ss`s`k```ssk`s``s`ksks````s`si`ss`ss`k`s``s`kski
Looping counter
133 bytes
`k`````ssi`s`k`s``si`k``s`k`s``si`k````s`s``ss`ski`s``s`kskik``s`k`s`k``s`k`s``si`k````si`ss```ssk`s``s`kskik``s`s```ssk`k`s``s`kskii
Truth-machine
161 bytes
``si`k``s`kk``s``s`k`````s``ss`s`s``sisk`s``s`kski``s`k`sik```si`s`k`s``s`ks``s`k`sik``s`s`k`s`kki``s``si`k``s`k`sik``s`kk``s`k`s``ss`k`k`k```s`s``ssi`s``s`kskik
Primes
975 bytes
`k``````ssi`s``s`ks``s`k`s`k``s`ks``s`k`s``s`ks``s`k`s``s``si`k``s``s`ks``s`kk````ssi`s`k`s``s`ks``s``si`k`k`sk`kk``s``s`ks``s`k`s`k``s`ksk``s``s`ks``s`s`kki`k``s``s``si`k``si`k`sk`k`````ssi`s`k`s``s`k````si`ss```ssk`s``s`kski``s``s`ks``s`kk``s`ks``s`k`sik`kk``s``s`ks``s`s`kki`k`s``s`ksk`sk`kk`k``s`k``s``s`ks``s`kk``s`ks``s`k`sik`kk``s`k```s``s``s``ss`s`s``s`ssik`ski`s``s`ksk``s``s``si`k``si`k`sk`k``````ssi`s`k`s````sik``s`ks```ss`ss`kk``s`ks``s`k`sik``s`k`s`k``ss`k``si`k`sk``s```si``ss`sk`s`k``s`ksk`k``s`k`s``si`kkk`sk````ssi`s`k`````ss`ss``ss`sk``s`ksk``s`k`s``si`k`s``s`kskk``s`s`k``s`k`s``si`k`k`skki`kk`k``s`k`s``si`k```ss``s`s`sis`k``s``s`kskik`k`skk``s```sss`ks`k``s`kk`s``s`ksk``s```si``si``ss`sk`s`k``s`ksk`k``s`k`s`k`s`k````sss`k`s``s`ksk`k`k``si`k`sk``s`k`s``s`ks``s`k`s``s``si`k``s`k`s``s`ks`s`k``s`ksk``s`kk``s`k`sik`k`sk``s`kk````ssi`s`k`s`k``s`k`s``si`kkk``s`k``ss`k`k`sk``s`s`k`s``si`k``s`k`s``si`k`skki``s`kkk`k``s``s`ss`k``s``ss`ks`kk`kk`sk``s``s`kski
Quine
2523 bytes
``````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````k``k``k``k```skk```s`s``skks`k`````s`s``s`s`s``skk``skks``s`ksk``skk``skkkkkk``s``s`ks``s`kk``s`ksk`k``s`k``s`k`s``s`ks``s`k`s``skk```ss`s```ssk``ss``s`s``sssk`kk`s`kkk``s`kk``s`k``s`k````ss``skk`s`k`s``s``s``s``skk`k`k`k`k`sk`kk`k`k`````sss`k``s`ss``s`sskkk``s`k``s`k`s``s`ks``s`k`s``skk```ss`s`s`k``s`k``````s``skks`s``s``ss``skk`k`s``s`ksk``skk``skk`s``s`ksk``s``s``ss`k``ss`k`k``s``s``skk`k````s`sss```ssk`s``s`ksk``skk`k``s``s``skk`k````ss````ssss`ss`k`s``s`ksk``skk`k`k`````ssss``ss`sk``s`ksk`k``s``skk`k`sk`kk`kk`s`kk``s``s`ks``s`s`kk``skk`k``s``skk`k`sk``s``s``skk`k`k`sk``s```ssk``skk``s``s``skk`k``s``s``skkk`k```ss``ss`sk``s`ksk`k`sk````ss``skk````sss`k``s`ks``s`kks``s``s``skk`k`k`k`k`sk`kk``s``s`ks````s``skkk``s`ks`s`k``s`ksk``s``s`ks``s`s`kk``skk`k``s``skk`k`sk`k``s`s`s`k`s`s`k``s``s`ks``s`kk``s`ks``s`k`s``skkk`kk`kk`skiiiiikiikiikiikiiiskkiiisisiiskksikiiiiisisiisisisiiskkiiskksiisikskiiskkiiskkkkkkiisiisiksiisikkiisikskikiisikiisikisiisiksiisikisiiskkiiissisiiisskiissiisisiissskikkisikkkiisikkiisikiisikiiiissiiskkisikisiisiisiisiiskkikikikikiskikkikikiiiiisssikiisissiisisskkkiisikiisikisiisiksiisikisiiskkiiissisisikiisikiiiiiisiiskksisiisiissiiskkikisiisikskiiskkiiskkisiisikskiisiisiissikiissikikiisiisiiskkikiiiisisssiiisskisiisikskiiskkikiisiisiiskkikiiiissiiiissssissikisiisikskiiskkikikiiiiissssiissiskiisikskikiisiiskkikiskikkikkisikkiisiisiksiisisikkiiskkikiisiiskkikiskiisiisiiskkikikiskiisiiisskiiskkiisiisiiskkikiisiisiiskkkikiiissiissiskiisikskikiskiiiissiiskkiiiisssikiisiksiisikksiisiisiiskkikikikikiskikkiisiisiksiiiisiiskkkiisiksisikiisikskiisiisiksiisisikkiiskkikiisiiskkikiskikiisisisikisisikiisiisiksiisikkiisiksiisikisiiskkkikkikkisk
Certain fragments of this code were bruteforced:
- Church numerals 3, 9, 11, 256 for SK basis
- Church numerals 19, 96, 841 for SKI basis, then converted to SK (may be sub-optimal in SK, the search is going on)
- Function which converts I/K/S to 0/1/2
The central part of the quine ("engine") is expressed in SK basis only (without using i). The data section is exactly the same as the engine but ` is replaced with i combinator. The engine consumes data elements one by one and builds a list, then the list is transformed to represent all 3 sections of the quine, converted to text form and returned (i.e. printed). Data section is not terminated with some special terminator code. Instead, its length is hardcoded into engine and is equal to 841 in this particular quine. So, the total size of this Quine is 841*3=2523 (841 ` signs, then the 841-bytes long engine, then the data array of 841 elements).
It can (and it will) be reduced further if/when I find SK representation for some other numeric constants.
1875 bytes
Right fold lists are miracle!
``````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````k``k``k``k``k``k``k``k```skk````ss`ss````ssk``ss`sks``s`kskkkkkkkkk``s``s`ks``s`kk``s`ksk`k``s``s`ks``s`kk``s``s`ks``s`kk``s`k```sss`ks`s`kk`k``s`k`s``skkk`k``s```ssk``ss``s`s``sssk`kk``s`kk``s``s``s``s`ks``s`k`s`k``s`ksk``s``s`ksk`k``s`s`kk`k`sk``s``s`k```sss`ks`s`kk``s``s`ksk`k``s``s`ksk`k``s``s``skkk`k```ss``ss`sk``s`ksk`k``s``s`ks``s`kk``s`ks``s`k`s``skk``s`k```ss`s`s`k``````s``skks`s``s``ss``skk`k`s``s`ksk``skk``skk`s``s`ksk`kk``s``ss`k``ss`k`k``s``s``skk`k````s`sss```ssk`s``s`ksk``skk`k``s``s``skk`k````ss````ssss`ss`k`s``s`ksk``skk`k`k`````ssss``ss`sk``s`ksk`k``s``skk`k`sk`kk`k`k`````sss`k``s`ss``s`sskkk`skiiiiikiikiikiikiikiikiikiikiiiskkiiiississiiiisskiissisksiisikskkkkkkkkkiisiisiksiisikkiisikskikiisiisiksiisikkiisiisiksiisikkiisikiiisssiksisikkikiisikisiiskkkikiisiiisskiissiisisiissskikkiisikkiisiisiisiisiksiisikisikiisikskiisiisikskikiisisikkikiskiisiisikiiisssiksisikkiisiisikskikiisiisikskikiisiisiiskkkikiiissiissiskiisikskikiisiisiksiisikkiisiksiisikisiiskkiisikiiissisisikiiiiiisiiskksisiisiissiiskkikisiisikskiiskkiiskkisiisikskikkiisiissikiissikikiisiisiiskkikiiiisisssiiisskisiisikskiiskkikiisiisiiskkikiiiissiiiissssissikisiisikskiiskkikikiiiiissssiissiskiisikskikiisiiskkikiskikkikikiiiiisssikiisissiisisskkkisk
1755 bytes
Found short enough representation for constant 585, inlined some functions' arguments.
```````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````skk``s`k````s```ss`ss``ssss``s`ksk`sk``````sss``ssss``s`ksk``skk``s``s`ks``s`kk``s`ksk`k``s``s`ks``s`kk``s`k```sss`ks`s`kk`k``s`k`s``skk``s`kk``s```ssk``ss``s`s``sssk`kk``s`kk``s``s``s`ks``s``s`ksk`k``s`s`kk`k`sk``ss``s``s`ks``s``s`ksk`k``s``s`ksk`k``s``s``skkk`k```ss``ss`sk``s`ksk`k`k`k`````sss`k``s`ss``s`sskkk`k``s``s`ks``s`kk``s`ks``s`k`s``skk``s`k```ss`s`s`k``````s``skks`s``s``ss``skk`k`s``s`ksk``skk``skk`s``s`ksk`kk``s``ss`k``ss`k`k``s``s``skk`k````s`sss```ssk`s``s`ksk``skk`k``s``s``skk`k````ss````ssss`ss`k`s``s`ksk``skk`k`k`````ssss``ss`sk``s`ksk`k``s``skk`k`sk`kk`skiiiiiiskkiisikiiiisiiississiissssiisikskiskiiiiiisssiissssiisikskiiskkiisiisiksiisikkiisikskikiisiisiksiisikkiisikiiisssiksisikkikiisikisiiskkiisikkiisiiisskiissiisisiissskikkiisikkiisiisiisiksiisiisikskikiisisikkikiskiissiisiisiksiisiisikskikiisiisikskikiisiisiiskkkikiiissiissiskiisikskikikikiiiiisssikiisissiisisskkkikiisiisiksiisikkiisiksiisikisiiskkiisikiiissisisikiiiiiisiiskksisiisiissiiskkikisiisikskiiskkiiskkisiisikskikkiisiissikiissikikiisiisiiskkikiiiisisssiiisskisiisikskiiskkikiisiisiiskkikiiiissiiiissssissikisiisikskiiskkikikiiiiissssiissiskiisikskikiisiiskkikiskikkisk
Quaternions
Hello, world!
170 bytes
1=+++=+=1+*.1=++++=+=*=1+.1=++=++=++=+++..=i`1=++++=+=1+*=1+.=i`1=++++=+=1+=+++.1=+++=+++=+.=i`1=+++=+++=1+=++++++.i``^.1=++=++=+=1+=+=++.k`j`^.1=++++=+=*.i``1+.1=++++=+.
Looping counter
79 bytes
Couldn't beat User:Cleverxia's record, but it's my first Quaternions program anyway:
1=++=+=1+*=i`1=+=++++=i`1={{1-=--=i`1+=i`^.i``^}1=i`^{1-=--=i```1+=i`^}i``^.i`}
58 bytes
It uses a trick which I call "instant copy":
1=++=+=1+*=i`1=+=++++=i`{1+=i*`=j*={k+=i`^.i```^}i``^.i`^}
55 bytes
1=++=+=1+*=i`1=+=++++={i`1+=i*`=j*={k+=i`^.i```^}i``^.}
Kolakoski sequence
325 bytes
It's terribly slow, generation of each digit takes exponential time:
1=+++=+++=++=1+=.i`1=++++=*=+=..i``1={^{1-=--=(j`1=i`1-=--=k`1=)k```1+=k`1-=--=}j`1-=(k`^.i``1+=k`)^-=k`^.j```^{1-=--=(k`1-=--=j`1=i`1=)k`1+=k```1-=--=}i```1-=(j`^.k`1=j```^{1-=--=k`1+=i`^+=j```^}1=k`^{1-=--=k```1+=k`^}i`^{1-=--=k`1+=k```^}i```)^-=1=j`^.i`^{1-=--=k`^+=i`1+=j```^}k`^{1-=--=j```1+=j`^}i`^{1-=--=j```1+=j`^}k`}
Truth-machine
21 bytes
1=+++=+++=++=,.-{+.1}
The Church
Truth-machine
113 bytes
^1((^+^1^+((^+1)*^11***^1(***10))1((^+1)*^11*(21^**1(^**1(+1^)**)))*72^)*^1(^***^2((***10)1224)*(***10))*(***10))
Котята-арбузята
Looping counter
37 bytes
This program doesn't use data queue at all, only the signal queues:
}0[ '0 ] }1[ '1 ] '0'1 + <0[ :42 ^0 ] <1[ :10 ^0 ^1 ]
Kolakoski sequence
139 bytes
}1['1'8] }2['2'9] }4[ !1 }8['5] }9['7] '3 ] }5[ !2 }8['4] }9['6] '3 ] }6[ !1'4 ] }7[ !2'5 ] '1'2'2 !1 '4 + <1[:49] <2[:50] <3[^%] <4[^4] <5[^5] <6[^6] <7[^7] <8[^8] <9[^9]
Quine
3756 bytes
}0[!33!5!49!5!39!5!48!5!93!5!125!5!53!5!91!5!33!5!50!5!33!5!51!5!51!5!33!5!50!5!33!5!53!5!51!5!33!5!50!5!39!5!48!5!93!5!125!5!51!5!51!5!91!5!33!5!51!5!51!5!33!5!50!5!33!5!53!5!49!5!33!5!50!5!33!5!53!5!49!5!39!5!48!5!93!5!125!5!51!5!53!5!91!5!33!5!51!5!51!5!33!5!50!5!33!5!53!5!49!5!33!5!50!5!33!5!53!5!51!5!39!5!48!5!93!5!125!5!51!5!55!5!91!5!33!5!51!5!51!5!33!5!50!5!33!5!53!5!49!5!33!5!50!5!33!5!53!5!53!5!39!5!48!5!93!5!125!5!51!5!57!5!91!5!33!5!51!5!51!5!33!5!50!5!33!5!53!5!49!5!33!5!50!5!33!5!53!5!55!5!39!5!48!5!93!5!125!5!52!5!51!5!91!5!33!5!51!5!51!5!33!5!50!5!33!5!53!5!50!5!33!5!50!5!33!5!53!5!49!5!39!5!48!5!93!5!125!5!52!5!52!5!91!5!33!5!51!5!51!5!33!5!50!5!33!5!53!5!50!5!33!5!50!5!33!5!53!5!50!5!39!5!48!5!93!5!125!5!52!5!54!5!91!5!33!5!51!5!51!5!33!5!50!5!33!5!53!5!50!5!33!5!50!5!33!5!53!5!52!5!39!5!48!5!93!5!125!5!52!5!56!5!91!5!33!5!51!5!51!5!33!5!50!5!33!5!53!5!50!5!33!5!50!5!33!5!53!5!54!5!39!5!48!5!93!5!125!5!52!5!57!5!91!5!33!5!51!5!51!5!33!5!50!5!33!5!53!5!50!5!33!5!50!5!33!5!53!5!55!5!39!5!48!5!93!5!125!5!53!5!48!5!91!5!33!5!51!5!51!5!33!5!50!5!33!5!53!5!51!5!33!5!50!5!33!5!52!5!56!5!39!5!48!5!93!5!125!5!53!5!49!5!91!5!33!5!51!5!51!5!33!5!50!5!33!5!53!5!51!5!33!5!50!5!33!5!52!5!57!5!39!5!48!5!93!5!125!5!53!5!50!5!91!5!33!5!51!5!51!5!33!5!50!5!33!5!53!5!51!5!33!5!50!5!33!5!53!5!48!5!39!5!48!5!93!5!125!5!53!5!51!5!91!5!33!5!51!5!51!5!33!5!50!5!33!5!53!5!51!5!33!5!50!5!33!5!53!5!49!5!39!5!48!5!93!5!125!5!53!5!52!5!91!5!33!5!51!5!51!5!33!5!50!5!33!5!53!5!51!5!33!5!50!5!33!5!53!5!50!5!39!5!48!5!93!5!125!5!53!5!53!5!91!5!33!5!51!5!51!5!33!5!50!5!33!5!53!5!51!5!33!5!50!5!33!5!53!5!51!5!39!5!48!5!93!5!125!5!53!5!54!5!91!5!33!5!51!5!51!5!33!5!50!5!33!5!53!5!51!5!33!5!50!5!33!5!53!5!52!5!39!5!48!5!93!5!125!5!53!5!55!5!91!5!33!5!51!5!51!5!33!5!50!5!33!5!53!5!51!5!33!5!50!5!33!5!53!5!53!5!39!5!48!5!93!5!125!5!53!5!56!5!91!5!33!5!51!5!51!5!33!5!50!5!33!5!53!5!51!5!33!5!50!5!33!5!53!5!54!5!39!5!48!5!93!5!125!5!54!5!48!5!91!5!33!5!51!5!51!5!33!5!50!5!33!5!53!5!52!5!33!5!50!5!33!5!52!5!56!5!39!5!48!5!93!5!125!5!54!5!51!5!91!5!33!5!51!5!51!5!33!5!50!5!33!5!53!5!52!5!33!5!50!5!33!5!53!5!49!5!39!5!48!5!93!5!125!5!57!5!49!5!91!5!33!5!51!5!51!5!33!5!50!5!33!5!53!5!55!5!33!5!50!5!33!5!52!5!57!5!39!5!48!5!93!5!125!5!57!5!51!5!91!5!33!5!51!5!51!5!33!5!50!5!33!5!53!5!55!5!33!5!50!5!33!5!53!5!49!5!39!5!48!5!93!5!125!5!57!5!52!5!91!5!33!5!51!5!51!5!33!5!50!5!33!5!53!5!55!5!33!5!50!5!33!5!53!5!50!5!39!5!48!5!93!5!125!5!49!5!50!5!53!5!91!5!33!5!51!5!51!5!33!5!50!5!33!5!52!5!57!5!33!5!50!5!33!5!53!5!48!5!33!5!50!5!33!5!53!5!51!5!39!5!48!5!93!5!125!5!49!5!91!5!39!5!49!5!93!5!125!5!50!5!91!5!33!5!49!5!125!5!49!5!91!5!125!5!53!5!91!5!33!5!50!5!125!5!53!5!91!5!39!5!49!5!93!5!125!5!50!5!91!5!39!5!52!5!46!5!93!5!39!5!49!5!93!5!125!5!49!5!91!5!39!5!48!5!93!5!39!5!51!5!93!5!125!5!50!5!91!5!39!5!50!5!93!5!39!5!50!5!93!5!43!5!60!5!48!5!91!5!94!5!37!5!93!5!60!5!49!5!91!5!94!5!63!5!93!5!60!5!50!5!91!5!58!5!35!5!94!5!37!5!93!5!60!5!51!5!91!5!60!5!48!5!91!5!94!5!63!5!93!5!60!5!49!5!91!5!58!5!35!5!94!5!37!5!93!5!94!5!48!5!93!5!60!5!52!5!91!5!44!5!93!5!58!5!49!5!50!5!53!5!58!5!52!5!56!5!58!5!57!5!49!5!94!5!48!5!1'0]}5[!2!33!2!53!2'0]}33[!33!2!51!2!51'0]}35[!33!2!51!2!53'0]}37[!33!2!51!2!55'0]}39[!33!2!51!2!57'0]}43[!33!2!52!2!51'0]}44[!33!2!52!2!52'0]}46[!33!2!52!2!54'0]}48[!33!2!52!2!56'0]}49[!33!2!52!2!57'0]}50[!33!2!53!2!48'0]}51[!33!2!53!2!49'0]}52[!33!2!53!2!50'0]}53[!33!2!53!2!51'0]}54[!33!2!53!2!52'0]}55[!33!2!53!2!53'0]}56[!33!2!53!2!54'0]}57[!33!2!53!2!55'0]}58[!33!2!53!2!56'0]}60[!33!2!54!2!48'0]}63[!33!2!54!2!51'0]}91[!33!2!57!2!49'0]}93[!33!2!57!2!51'0]}94[!33!2!57!2!52'0]}125[!33!2!49!2!50!2!53'0]}1['1]}2[!1}1[}5[!2}5['1]}2['4.]'1]}1['0]'3]}2['2]'2]+<0[^%]<1[^?]<2[:#^%]<3[<0[^?]<1[:#^%]^0]<4[,]:125:48:91^0