<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Gabriel Ford</title><link>https://gabefork.github.io/</link><description>Recent content on Gabriel Ford</description><generator>Hugo</generator><language>en</language><lastBuildDate>Sun, 12 Apr 2026 17:58:13 -0400</lastBuildDate><atom:link href="https://gabefork.github.io/index.xml" rel="self" type="application/rss+xml"/><item><title>UMassCTF 2026 OSINT Writeups</title><link>https://gabefork.github.io/posts/umassctf-2026/</link><pubDate>Sun, 12 Apr 2026 17:58:13 -0400</pubDate><guid>https://gabefork.github.io/posts/umassctf-2026/</guid><description>&lt;p>Another year, another UMassCTF. I wrote three OSINT challenges this year, aiming to pick up the harder challenges so my friends could write easier ones. That turned out rather the opposite (ha!), but nonetheless I am quite happy with how my challenges turned out and the general response to them. Next year, given the advent of AI agents (and a general distaste for them from myself), the challenges are going to have to go up a notch yet again.&lt;/p></description></item><item><title>UMassCTF 2025 OSINT Writeups</title><link>https://gabefork.github.io/posts/umassctf-2025/</link><pubDate>Mon, 21 Apr 2025 18:46:20 -0400</pubDate><guid>https://gabefork.github.io/posts/umassctf-2025/</guid><description>&lt;p>Now that UMassCTF 2025 is over, I think it&amp;rsquo;s time to explain myself. It was my first time writing CTF challenges, and I think I did a solid job. I went in wanting to write challenges that were:&lt;/p>
&lt;ul>
&lt;li>Interesting and made you think a bit&lt;/li>
&lt;li>Couldn&amp;rsquo;t be easily reversed image searched (since it&amp;rsquo;s more fun when you have to work for the answer)&lt;/li>
&lt;/ul>
&lt;p>I wasn&amp;rsquo;t able to write as many challenges as I wanted, mainly due to a lack of time in the weeks leading up to the CTF. The challenges I did write were the best of the ideas that I had. Without further ado, let&amp;rsquo;s get into it.&lt;/p></description></item><item><title/><link>https://gabefork.github.io/about/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://gabefork.github.io/about/</guid><description>&lt;h1 id="about">
 About
 &lt;a class="heading-link" href="#about">
 &lt;i class="fa-solid fa-link" aria-hidden="true" title="Link to heading">&lt;/i>
 &lt;span class="sr-only">Link to heading&lt;/span>
 &lt;/a>
&lt;/h1>
&lt;p>Hi, I&amp;rsquo;m Gabe, a current undergraduate student at UMass Amherst working with a focus on computer architecture and graphics programming. I love working closely with hardware, and the weirder the hardware, the better.&lt;/p>
&lt;p>Aside from computer architecture and graphics programming, I am highly active in my school&amp;rsquo;s Cybersecurity Club. I am currently an Infra Team Member focusing on keeping our local infrastructure and hardware up and running. I have also helped organize Capture the Flag competitions and written challenges in the Open Source Intelligence category.&lt;/p></description></item><item><title/><link>https://gabefork.github.io/projects/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://gabefork.github.io/projects/</guid><description>&lt;h1 id="projects">
 Projects
 &lt;a class="heading-link" href="#projects">
 &lt;i class="fa-solid fa-link" aria-hidden="true" title="Link to heading">&lt;/i>
 &lt;span class="sr-only">Link to heading&lt;/span>
 &lt;/a>
&lt;/h1>
&lt;ul>
&lt;li>
&lt;p>&lt;a href="https://sites.google.com/umass.edu/ersp-cics/projects/2024-2025/efficient-vector-databases-for-large-scale-datasets" class="external-link" target="_blank" rel="noopener">Scaling Hierarchical Navigable Small World graphs for nearest
neighbor search&lt;/a>&lt;/p>
&lt;ul>
&lt;li>A year-long research project with the DREAM Lab at UMass Amherst through the ERSP program focusing on scaling an HNSW implementation to multiple nodes.&lt;/li>
&lt;/ul>
&lt;/li>
&lt;li>
&lt;p>&lt;a href="https://github.com/gabefork/pacific" class="external-link" target="_blank" rel="noopener">Pacific&lt;/a>&lt;/p>
&lt;ul>
&lt;li>An implementation of radiance cascades. Won Best Theory and Planning at HackUMass XIII.&lt;/li>
&lt;/ul>
&lt;/li>
&lt;li>
&lt;p>&lt;a href="https://github.com/GameHunter101/HackUmassCelestialSimulator" class="external-link" target="_blank" rel="noopener">Celestial Simulator&lt;/a>&lt;/p>
&lt;ul>
&lt;li>A wgpu-based solar system simulator that uses ray marching as its rendering technique, created for HackUMass XII.&lt;/li>
&lt;/ul>
&lt;/li>
&lt;li>
&lt;p>&lt;a href="https://github.com/gabefork/city-guesser" class="external-link" target="_blank" rel="noopener">City Guesser&lt;/a>&lt;/p></description></item></channel></rss>