https://kamilborys.com
•
This is a web feed, also known as an Atom feed. Subscribe by copying the URL from the address bar into your newsreader. Visit About Feeds to learn more and get started. It's free.Visit websiteRecent postsUpdated on $DATEdarkdateKamilCaseKamilCaseZola2026-01-24T00:00:00+00:00https://kamilborys.com/atom.xmlTell me a Tiny Story: LLM Inference on a PowerMac G32026-01-24T00:00:00+00:002026-01-24T00:00:00+00:00Kamil Boryshttps://kamilborys.com/blog/tell-me-a-tiny-story/AI-generated content is everywhere now.
Your morning Instagram doom-scrolling routine,
those 47 unread emails in your inbox that arrived overnight,
the friendly assistant that tells you that you are absolutely right -
I'm sure at least some of that was powered by large language models.
These are usually run on powerful hardware,
in large fancy data centers consuming ridiculous amounts of power.
But what if I told you it's possible to run AI
from the comfort of your own home, right on your PowerMac G3 workstation?
~/src/llama2.c % uname -srm
NetBSD 10.1 macppc
~/src/llama2.c % ./run sw-stories15M.bin \
-z sw-tokenizer.bin \
-i 'Mary had a little lamb.'
Mary had a little lamb.
She was very gentle and kind.
One day she was walking in the forest
when she saw something very strange.
There was a dragon
and it was making a loud roar.
(...)
achieved tok/s: 2.702613
…Let the music play2021-09-06T00:00:00+00:002021-09-06T00:00:00+00:00Kamil Boryshttps://kamilborys.com/blog/let-the-music-play/char a;float b,c;main(d){for(;d>2e3*c?c=1,scanf(" %c%f",&a,&c),d=55-a%32*9/5,
b=d>9,d=d%13-a/32*12:1;a=2)++d<24?b*=89/84.:putchar(a=b*d);}
Good news for all International Obfuscated C Code Contest fans -- here's another winning piece from 2013 written by Yusuke Endoh, who is no stranger to the Contest. It is dubbed the Most Tweetable 1-Liner, because is small enough to fit in a tweet (137 characters only), yet can "tweet out a tune", that is, will play some music for your entertainment…Dots and Dashes2018-08-15T11:08:11+00:002018-08-15T11:08:11+00:00Kamil Boryshttps://kamilborys.com/blog/dots-and-dashes/#!perl -p
y/.-/01/;s#\d+/?#substr'01etianmsurwdkgohvf,l.pjbxcyzq',31&oct b1.$&,1#ge
Perl is (in)famous for the ability to write programs that look like line noise, and today I will take apart this beautiful piece of code. Written by tybalt89, it can decode sequences of dots and dashes to Latin letters in just 73 characters of code…Anatomy of the heart2018-03-13T08:01:46+00:002018-03-13T08:01:46+00:00Kamil Boryshttps://kamilborys.com/blog/anatomy-of-the-heart/#!/usr/bin/perl -w
use strict;
my$f= $[;my
$ch=0;sub l{length}
sub r{join"", reverse split
("",$_[$[])}sub ss{substr($_[0]
,$_[1],$_[2])}sub be{$_=$_[0];p
(ss($_,$f,1));$f+=l()/2;$f%=l
();$f++if$ch%2;$ch++}my$q=r
("\ntfgpfdfal,thg?bngbj".
"naxfcixz");$_=$q; $q=~
tr/f[a-z]/ [l-za-k]
/;my@ever=1..&l
;my$mine=$q
;sub p{
print
@_;
}
be $mine for @ever
This heart-shaped program is written in the language of choice for producing unreadable and obfuscated code: Perl 5. It also serves an unusual purpose of a proposal…Have fun with Unix2018-03-01T08:09:54+00:002018-03-01T08:09:54+00:00Kamil Boryshttps://kamilborys.com/blog/have-fun-with-unix/main() { printf(&unix["\021%six\012\0"],(unix)["have"]+"fun"-0x60);}
Just one line of code, but lots of confusion. What does this program do?…Some are more equal than others2018-02-18T19:15:03+00:002018-02-18T19:15:03+00:00Kamil Boryshttps://kamilborys.com/blog/some-are-more-equal-than-others/
"And to avoid the tedious repetition of these words: is equal to: I will set as I do often in work use, a pair of parallels, or Gemowe lines of one length, thus: =, because no 2 things, can be more equal."
-- Robert Recorde, The Whetstone of Witte (1557)
public class Equality {
public Equality() {
Integer a1 = 100, a2 = 100;
Integer b1 = 200, b2 = 200;
if (a1 == a2) System.out.println("a1 == a2");
if (b1 == b2) System.out.println("b1 == b2");
}
public static void main(String[] args) {new Equality(); }
}
…How to dismantle a compiler bomb2018-01-20T16:52:25+00:002018-01-20T16:52:25+00:00Kamil Boryshttps://kamilborys.com/blog/how-dismantle-compiler-bomb/main[-1u]={1};
You have heard of "zip bombs" (a tiny ZIP file that decompresses to multiple gigabytes) and "XML bombs" (small XML file abusing the entities to consume lots of memory), and now there is a "compiler bomb" to follow suit. The idea is quite similar -- the source code is only 14 bytes, but the generated executable will be over 16 GB in size…Namaste India2017-10-25T20:10:09+00:002017-10-25T20:10:09+00:00Kamil Boryshttps://kamilborys.com/blog/namaste-india/This obfuscated piece of C code prints the map of India to the standard output.
#include <stdio.h>
main()
{
int a,b,c;
int count = 1;
for (b=c=10;a="- FIGURE?, UMKC,XYZHello Folks,\
TFy!QJu ROo TNn(ROo)SLq SLq ULo+\
UHs UJq TNn*RPn/QPbEWS_JSWQAIJO^\
NBELPeHBFHT}TnALVlBLOFAkHFOuFETp\
HCStHAUFAgcEAelclcn^r^r\\tZvYxXy\
T|S~Pn SPm SOn TNn ULo0ULo#ULo-W\
Hq!WFs XDt!" [b+++21]; )
for(; a-- > 64 ; )
putchar ( ++c=='Z' ? c = c/ 9:33^b&1);
return 0;
}
…Regex prime checker2017-10-07T13:26:38+00:002017-10-07T13:26:38+00:00Kamil Boryshttps://kamilborys.com/blog/regex-prime-checker/This Java snippet uses a regular expression for something way different than they were designed for: a primality check.
public static boolean prime(int n) {
return !new String(new char[n]).matches(".?|(..+?)\\1+");
}
…Quine - a self-replicating program2017-09-11T17:37:39+00:002017-09-11T17:37:39+00:00Kamil Boryshttps://kamilborys.com/blog/quine-a-self-replicating-program/Quines are computer programs that accept no input and write its own source code on the standard output. This entry was taken from the Jargon File, the author is unknown.
char*f="char*f=%c%s%c;main()
{printf(f,34,f,34,10);}%c";
main(){printf(f,34,f,34,10);}
…Underscore Pi2017-08-27T12:19:38+00:002017-08-27T12:19:38+00:00Kamil Boryshttps://kamilborys.com/blog/underscore-pi/This clever program written by Brian Westley calculates π by looking at its own area. It is one of the winning entries of IOCCC in 1988.
#define _ -F<00||--F-OO--;
int F=00,OO=00;main(){F_OO();printf("%1.3f\n",4.*-F/OO/OO);}F_OO()
{
_-_-_-_
_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_-_-_-_-_
_-_-_-_-_-_-_-_
_-_-_-_
}
…Duff's device2017-08-24T18:14:43+00:002017-08-24T18:14:43+00:00Kamil Boryshttps://kamilborys.com/blog/duffs-device/
"This code forms some sort of argument (...), but I'm not sure whether it's for or against."
send(to, from, count)
register short *to, *from;
register count;
{
register n = (count + 7) / 8;
switch (count % 8) {
case 0: do { *to = *from++;
case 7: *to = *from++;
case 6: *to = *from++;
case 5: *to = *from++;
case 4: *to = *from++;
case 3: *to = *from++;
case 2: *to = *from++;
case 1: *to = *from++;
} while (--n > 0);
}
}
…