In this pre-paid self-own, I study security vulnerability through the lens of self-flagellation. I go through a lot of trouble to make life worse for me and my antediluvian website's users (AS USUAL). Get it or try it: https://tom7.org/httpv/ Or read the 25-page (!) SIGBOVIK 2026 paper: https://tom7.org/httpv/httpv.pdf Keywords: https, tls 1.2, RSA_WITH_AES_256_CBC_SHA, httpv, toxic max-security, vulnerability research

Hmm, I wonder how long a light-hearted educational winter treat can get without invalidating its premise? Surely I can sneak in a couple group theory lectures and incorporate contributions from 12 other mathematicians (interpreted loosely. math is everywhere): Matt Godbolt: ⁨@MattGodbolt ⁩ Sam Hartburn: @samhartburn Sophie Maclean: @sophiemaclean9999 Ayliean MacDonald: @Ayliean Geoff Marshall: @geofftech2 jan Misali: @HBMmaster Self Citation: @tom7 Peter Rowlett: @peterrowlett Matt Parker: @standupmaths Kat Phillips: @KatDoesMaths Matthew Scroggs: @scroggs2 Ben Sparks: @SparksMaths Katie Steckles: @KatieSteckles Find your own Santa, or hack, or be hacked, at https://tom7.org/santa/ 119567580030005753169703087661737062297637343384390543394603122704997149598744681594034198988900094830962041201457240309874560186695018651901749792477400613856413753160717201561458414328282984908197812155699370142382890518545129979517102648795407304603728792928110898302099260986995529585272634310368988747334,188090696223600848188444929362897180667623659398684297512738033167388363936793070742251251360540546922279158977351154041814866599530114063881531830236865813471706017685682660977829260508952130093401888372638168411403021690628584807280735660666917775555467178355804759062676781693240982991908210809829226939560

In this cross-over episode between the Main Sequence and Tom Academy, we see what it would take to prove that you can't do what you already thought you couldn't do, and learn about Tom's prurient interest in Platonic horrors. Yes, the whole 80 minutes is about cubes and their relatives. Project site: http://tom7.org/ruperts/ Download shapes, code, paper, etc. there. David's soothing video: https://youtube.com/watch?v=evKFok65t_E David's verification of triakis tetrahedron: https://youtube.com/watch?v=jDTPBdxmxKw 7 trillion polyhedra were harmed in the making of this video.

Never before seen pilot episode. Keywords: Types If you see any errors, please post about them in the comment section! Source code, papers, etc.: http://tom7.org/bovex

Before the invention of YouTube comments, most people could make remarks that were slightly technically incorrect without fear of immediate public rebuke. The one exception was professors, especially if the classroom included an annoying student such as “Tom 7.” The invention of YouTube was doubly revolutionary: Now anyone can experience being a professor being corrected by an annoying student, but also, corrections can be made years after the fact, and at significant length, as the student cannot be told to “take this offline.” This video is such a lengthy correction and digression, and perhaps itself a fount of mistakes. Due to the esoteric detail and prodigious whiteboarding, it is almost a “Tom Academy” video. But since I grew a moustache to film it, it qualifies for the Main Sequence. Keywords: Gradient descent, half-precision floating point, linear operations, F=MA, rounding, exotic transfer functions, machine learning, MNIST, CIFAR-10, chess, fractals, Frobenius, cryptography, fluint8, Motorola 6502. For SIGBOVIK 2023. Paper, impenetrable code, etc.: http://tom7.org/grad/

This video elaborates my project to run the length of every street in the city of Pittsburgh, Pennsylvania. It's called "Pac Tom" because it's like Pac Man eating dots, except with Tom (me) instead of Man. Like Pac Man, there's no time limit, which is good because it took me 16 years! Ultimately I ran 3661 miles in 269 jaunts. It's not a programming video, but you could still think of it as a sort of SIGBOVIK On Ice. Additional information, soundtrack, etc. at: http://pac.tom7.org By Tom Murphy VII. Get all @tom7 thingies at http://tom7.org/. Thank you to friends who helped me finish in style! Cast: Finn, Jessica, Max, Rose, Sophia, William Additional camerawork: Reed, Rose

In this video we make and evaluate several hard drives that we didn't want. Drawing some inspiration from vexing current events, we find that creative, structured thought on adjacent (but frivolous) problems is a sort of digestive act, and one that is ultimately laxative. Paper, source code, ringtones (and for a limited time, the data and viewer from pinging the whole internet): http://tom7.org/harder Errata (thanks to all pedantic viewers who catch this stuff): - I got the escape velocity off by a factor of 1000! It's 11 km/sec, not 11,000 km/sec. I think the other calculations are correct; I just mistook a period for a comma in my bleary-eyed late-night editing. - I got the size of the genome wrong due to a very silly bug from bleary-eyed late-night programming. It is 29903 base pairs, which can be stored in an economy-sized 7476 bytes. For SIGBOVIK 2022

I perform an exhaustive case analysis using advanced "derp learning" techniques to discover what's even upperercase than an uppercase A. AND I DON'T STOP THERE. For SIGBOVIK 2021. Fonts, paper with details, etc.: http://tom7.org/lowercase/

An intricate and lengthy account of several different computer chess topics from my SIGBOVIK 2019 papers. We conduct a tournament of fools with a pile of different weird chess algorithms, ostensibly to quantify how well my other weird program to play color- and piece-blind chess performs. On the way we "learn" about mirrors, arithmetic encoding, perversions of game tree search, spicy oils, and hats. Papers: http://tom7.org/chess/ No animals nor automata were harmed in the filming.

A new kind of computer architecture that's more elegant than 1s and 0s, being based directly on Mathematics. Note: Everything in here is real (IEEE-754), but the target is computer scientists and the troll level is set to ULTRA. Source code and stuff: http://tom7.org/nand/

An explanation of the process and tech behind my last video, Reverse emulating the NES to give it SUPER POWERS!". You should watch that video first, of course: https://youtu.be/ar9WRwCiSr0

The video begins in a strange way and gets stranger, but then, ideally, you understand why. See the "making of" video for more technical information: https://youtu.be/hTlNVUmBA28

In this video I explore several generalizations of anagrams. Addendum containing more technical explanations: https://youtu.be/8_npHZbe3qM

This lecture is an addendum to my video about Anagraphs, which you should watch first (or only). I do two proofs by reduction: One that the "generalized kerning" problem is undecidable, and one that the "generalized anagraphing" problem is decidable. The first proof uses turing machines, and the second a fragment of linear logic. I try to explain both without assuming any prior knowledge, but there's only so much you can squeeze into 51 minutes. Anagraphs video: https://youtu.be/qTBAW-Eh0tM

In this oddly paced "educational" video, I explain how I created a paper for SIGBOVIK 2017 that consists of only printable ASCII bytes, but is also a valid DOS executable. This involves making a C compiler that targets the printable subset of x86 (without using self-modifying code), and just barely scraping out solutions to some tricky puzzles that arise due to the constraints. The final result is functionality that is oh so very important, however! Download the paper/program and source code: http://tom7.org/abc/ SIGBOVIK: http://sigbovik.org/ All Tom thingies: http://tom7.org/