feed.xml

<feed xmlns="http://www.w3.org/2005/Atom"> <id>https://mikelmcdaniel.github.io//</id><title>Mikel Mcdaniel</title><subtitle>A resume and other things that are more interesting.</subtitle> <updated>2026-10-06T16:56:14-07:00</updated> <author> <name>Mikel Mcdaniel</name> <uri>https://mikelmcdaniel.github.io//</uri> </author><link rel="self" type="application/atom+xml" href="https://mikelmcdaniel.github.io//feed.xml"/><link rel="alternate" type="text/html" hreflang="en" href="https://mikelmcdaniel.github.io//"/> <generator uri="https://jekyllrb.com/" version="4.4.1">Jekyll</generator> <rights> © 2026 Mikel Mcdaniel </rights> <icon>/assets/img/favicons/favicon.ico</icon> <logo>/assets/img/favicons/favicon-96x96.png</logo> <entry><title>Split Computation on Rings</title><link href="https://mikelmcdaniel.github.io//posts/split-ring-computation/" rel="alternate" type="text/html" title="Split Computation on Rings" /><published>2026-09-30T00:00:00-07:00</published> <updated>2026-10-01T11:16:47-07:00</updated> <id>https://mikelmcdaniel.github.io//posts/split-ring-computation/</id> <content type="text/html" src="https://mikelmcdaniel.github.io//posts/split-ring-computation/" /> <author> <name>Mikel Mcdaniel</name> </author> <category term="Math" /> <category term="CS" /> <summary>Idea If two numbers mod 15 can be summed mod 15 and those two numbers can be summed mod 3 and mod 5, can you the ‘sum’ computation be split?… For example, if we want to compute $ 9 + 13 \pmod{15} $, we perform the computations modulo 3 and 5 then reconstruct the result: $ 9 + 13 \equiv 0 + 1 \equiv 1 \pmod{3} $ $ 9 + 13 \equiv 4 + 3 \equiv 2 \pmod{5} $ $ 7 \equiv 1 \pmod{3} \text{ and } ...</summary> </entry> <entry><title>I love my BF Challenges at BSidesSF 2026</title><link href="https://mikelmcdaniel.github.io//posts/i-love-my-bf-bsides-ctf/" rel="alternate" type="text/html" title="I love my BF Challenges at BSidesSF 2026" /><published>2026-03-22T00:00:00-07:00</published> <updated>2026-03-22T00:00:00-07:00</updated> <id>https://mikelmcdaniel.github.io//posts/i-love-my-bf-bsides-ctf/</id> <content type="text/html" src="https://mikelmcdaniel.github.io//posts/i-love-my-bf-bsides-ctf/" /> <author> <name>Mikel Mcdaniel</name> </author> <category term="Math" /> <category term="CS" /> <summary>My friend, iagox86, invited me to write a few challenges for the BSidesSF 2026 CTF so I wrote a few challenges around BrainFuck (BF). Here’s how they work and how to solve them. Context If you’re not familiar with BF, checkout the BF Wikipedia article first or the rest of this won’t make much sense. Many years ago, I wrote a very simple language and compiler that goes from a simple language ...</summary> </entry> <entry><title>BrainFuck Instruction Finder</title><link href="https://mikelmcdaniel.github.io//posts/bf-instruction-finder/" rel="alternate" type="text/html" title="BrainFuck Instruction Finder" /><published>2025-02-10T00:00:00-08:00</published> <updated>2025-02-10T00:00:00-08:00</updated> <id>https://mikelmcdaniel.github.io//posts/bf-instruction-finder/</id> <content type="text/html" src="https://mikelmcdaniel.github.io//posts/bf-instruction-finder/" /> <author> <name>Mikel Mcdaniel</name> </author> <category term="Math" /> <category term="CS" /> <summary>Searching through trillions of code snippets in minutes This is a post about… writing code to generate BF code that can do any computation. If you’re not familiar with BF, this post will explain everything you need. However, I do assume that you’re familiar with Python, C++, and have some general programming background. The main challenge with is that the number of possible BF programs that a...</summary> </entry> <entry><title>String Art Portraits</title><link href="https://mikelmcdaniel.github.io//posts/string-art-portraits/" rel="alternate" type="text/html" title="String Art Portraits" /><published>2023-02-19T00:00:00-08:00</published> <updated>2023-02-19T00:00:00-08:00</updated> <id>https://mikelmcdaniel.github.io//posts/string-art-portraits/</id> <content type="text/html" src="https://mikelmcdaniel.github.io//posts/string-art-portraits/" /> <author> <name>Mikel Mcdaniel</name> </author> <category term="Math" /> <category term="CS" /> <summary>This post is a high-level overview of how I wrote code generate instructions that turns an image into instructions to make string art portraits: Many others have done this and taken it well beyond what I do! Here are a few representative samples: A new way to knit (2016) by petros vrellis which also features images in color Polar Platform Spins Out Intricate String Art Portraits by D...</summary> </entry> <entry><title>Merge Order vs Merge Sort</title><link href="https://mikelmcdaniel.github.io//posts/middle-order-vs-merge-sort/" rel="alternate" type="text/html" title="Merge Order vs Merge Sort" /><published>2022-12-22T00:00:00-08:00</published> <updated>2022-12-22T00:00:00-08:00</updated> <id>https://mikelmcdaniel.github.io//posts/middle-order-vs-merge-sort/</id> <content type="text/html" src="https://mikelmcdaniel.github.io//posts/middle-order-vs-merge-sort/" /> <author> <name>Mikel Mcdaniel</name> </author> <category term="Math" /> <category term="CS" /> <summary>Efficiently Joining Data, Maybe… This post is about replacing the traditional Merge Sort merge step when joining/merging large datasets with a sort of “Merge Order” merge and attempt to calculate the big-O of Merge Order’s runtime. If you can calculate the big-O of Merge Order’s runtime, I’d love to hear from you!: [O \left(\sum_{k = 2}^N \frac{B (B - 1)^{N - k} {N \choose k} k \log_2k}{B^N}...</summary> </entry> </feed>