<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Posts on Low Latency Log</title><link>https://loonins.github.io/lowlatencylog/posts/</link><description>Recent content in Posts on Low Latency Log</description><generator>Hugo -- gohugo.io</generator><language>en-us</language><lastBuildDate>Mon, 19 Oct 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://loonins.github.io/lowlatencylog/posts/index.xml" rel="self" type="application/rss+xml"/><item><title>Reverse shell in C</title><link>https://loonins.github.io/lowlatencylog/posts/reverse-shell/</link><pubDate>Mon, 19 Oct 2026 00:00:00 +0000</pubDate><guid>https://loonins.github.io/lowlatencylog/posts/reverse-shell/</guid><description>&lt;h1 id="whats-a-reverse-shell"&gt;What&amp;rsquo;s a reverse shell?&lt;/h1&gt;
&lt;p&gt;A reverse shell is a remote command-line session where the target machine connects outward to an attacker-controlled listener, rather than the attacker connecting directly into the target. Once connected, the attacker can type commands that execute on the target and see their output.&lt;/p&gt;
&lt;h2 id="how-does-it-work"&gt;How does it work?&lt;/h2&gt;
&lt;ol&gt;
&lt;li&gt;The attacker starts listening on a port.&lt;/li&gt;
&lt;li&gt;The target runs a program that opens a TCP connection to the attacker&amp;rsquo;s listener.&lt;/li&gt;
&lt;li&gt;The target redirects the stdin, stdout and stderr of the program to the connection.&lt;/li&gt;
&lt;li&gt;The attacker terminal becomes an interactive shell on the target.&lt;/li&gt;
&lt;/ol&gt;
&lt;h1 id="whats-a-socket"&gt;What&amp;rsquo;s a socket?&lt;/h1&gt;
&lt;p&gt;When two processes need to communicate, they need some way to exchange data. On an operating system, this is usually done through a syscall that exposes the underlying communication mechanism.&lt;/p&gt;</description></item><item><title>Thread Synchronization</title><link>https://loonins.github.io/lowlatencylog/posts/thread_sync/</link><pubDate>Thu, 18 Jun 2026 00:00:00 +0000</pubDate><guid>https://loonins.github.io/lowlatencylog/posts/thread_sync/</guid><description>&lt;p&gt;Threads sometimes need to access shared resources at the same time. This part of code is called a &lt;strong&gt;critical section&lt;/strong&gt;. This causes race conditions and is a nightmare to debug. The technique used to solve this problem is &lt;strong&gt;Thread Synchronization&lt;/strong&gt;.&lt;/p&gt;
&lt;p&gt;In my last post, I implemented solutions using flags and Peterson&amp;rsquo;s algorithm, but they &lt;strong&gt;don&amp;rsquo;t work reliably on newer machines&lt;/strong&gt;. Since software alone can&amp;rsquo;t solve the issue, &lt;strong&gt;hardware support is needed&lt;/strong&gt;.&lt;/p&gt;</description></item><item><title>Calculating Number of Primes using Multithreading</title><link>https://loonins.github.io/lowlatencylog/posts/prime-no-multithreading/</link><pubDate>Tue, 16 Jun 2026 00:00:00 +0000</pubDate><guid>https://loonins.github.io/lowlatencylog/posts/prime-no-multithreading/</guid><description>&lt;p&gt;In the last post, I wrote about how to create threads and problems caused by them (race conditions).&lt;/p&gt;
&lt;p&gt;In this post, I&amp;rsquo;ll show how to calculate the number of primes using multithreading. The idea is simple:&lt;/p&gt;
&lt;ol&gt;
&lt;li&gt;Use an algorithm to check if a number is prime&lt;/li&gt;
&lt;li&gt;Increment a counter if it is&lt;/li&gt;
&lt;li&gt;Run multiple threads on different ranges&lt;/li&gt;
&lt;li&gt;Sum up the total primes&lt;/li&gt;
&lt;/ol&gt;
&lt;p&gt;Let&amp;rsquo;s look at the code.&lt;/p&gt;
&lt;h2 id="the-code"&gt;The Code&lt;/h2&gt;
&lt;div class="highlight"&gt;&lt;pre tabindex="0" class="chroma"&gt;&lt;code class="language-c" data-lang="c"&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt;&lt;span class="k"&gt;typedef&lt;/span&gt; &lt;span class="k"&gt;struct&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;start&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;end&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt;&lt;span class="p"&gt;}&lt;/span&gt; &lt;span class="n"&gt;Range&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt;&lt;span class="k"&gt;volatile&lt;/span&gt; &lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;counter&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt;&lt;span class="kt"&gt;bool&lt;/span&gt; &lt;span class="nf"&gt;isPrime&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt; &lt;span class="o"&gt;&amp;lt;=&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="nb"&gt;false&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="mi"&gt;2&lt;/span&gt; &lt;span class="o"&gt;||&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="mi"&gt;3&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="nb"&gt;true&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt; &lt;span class="o"&gt;%&lt;/span&gt; &lt;span class="mi"&gt;2&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt; &lt;span class="o"&gt;||&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt; &lt;span class="o"&gt;%&lt;/span&gt; &lt;span class="mi"&gt;3&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="nb"&gt;false&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="k"&gt;for&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;5&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;&amp;lt;=&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;+=&lt;/span&gt; &lt;span class="mi"&gt;6&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt; &lt;span class="o"&gt;%&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt; &lt;span class="o"&gt;||&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt; &lt;span class="o"&gt;%&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="mi"&gt;2&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="nb"&gt;false&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="p"&gt;}&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="nb"&gt;true&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt;&lt;span class="p"&gt;}&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt;&lt;span class="kt"&gt;void&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt;&lt;span class="nf"&gt;primeLoop&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="kt"&gt;void&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt;&lt;span class="n"&gt;arg&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="n"&gt;Range&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt;&lt;span class="n"&gt;r&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;Range&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="n"&gt;arg&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="k"&gt;for&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;r&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;start&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;&amp;lt;&lt;/span&gt; &lt;span class="n"&gt;r&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;end&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="o"&gt;++&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nf"&gt;isPrime&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="n"&gt;counter&lt;/span&gt;&lt;span class="o"&gt;++&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="c1"&gt;// &amp;lt;-- BUG: Not atomic!
&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="p"&gt;}&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="p"&gt;}&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="nb"&gt;NULL&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt;&lt;span class="p"&gt;}&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;The &lt;code&gt;isPrime&lt;/code&gt; function checks if a number is prime, and &lt;code&gt;primeLoop&lt;/code&gt; increments the global &lt;code&gt;counter&lt;/code&gt; for each prime it finds in its range.&lt;/p&gt;</description></item><item><title>Peterson's Solution to Race Conditions</title><link>https://loonins.github.io/lowlatencylog/posts/peterson_solution/</link><pubDate>Tue, 16 Jun 2026 00:00:00 +0000</pubDate><guid>https://loonins.github.io/lowlatencylog/posts/peterson_solution/</guid><description>&lt;p&gt;In the last couple of posts, I&amp;rsquo;ve discussed race conditions and what causes them, in pursuit of understanding multithreading.&lt;/p&gt;
&lt;p&gt;Today, I want to look at an old solution to this problem: &lt;strong&gt;Peterson&amp;rsquo;s Algorithm&lt;/strong&gt;. But first, let&amp;rsquo;s understand why our &amp;ldquo;obvious&amp;rdquo; solutions don&amp;rsquo;t actually work.&lt;/p&gt;
&lt;h2 id="whats-a-critical-section"&gt;What&amp;rsquo;s a Critical Section?&lt;/h2&gt;
&lt;p&gt;A &lt;strong&gt;critical section&lt;/strong&gt; is any part of code where shared data might be accessed while being concurrently modified by multiple threads.&lt;/p&gt;
&lt;p&gt;Let&amp;rsquo;s understand this by looking at code:&lt;/p&gt;</description></item><item><title>What I Learned About Data Races By Writing a pthread Race Demo in C</title><link>https://loonins.github.io/lowlatencylog/posts/pthread-race-condition-demo/</link><pubDate>Mon, 15 Jun 2026 22:08:00 +0530</pubDate><guid>https://loonins.github.io/lowlatencylog/posts/pthread-race-condition-demo/</guid><description>&lt;p&gt;I&amp;rsquo;ve been learning more about operating systems and concurrency in C. I came across an interesting idea called &lt;a href="https://en.wikipedia.org/wiki/Race_condition#Data_races"&gt;data races&lt;/a&gt; in the context of multi-threaded programming.&lt;/p&gt;
&lt;p&gt;The idea is that two or more threads can access the same memory location at the same time, and if there&amp;rsquo;s no synchronization, the result is &lt;strong&gt;undefined&lt;/strong&gt;.&lt;/p&gt;
&lt;p&gt;In this post, I&amp;rsquo;ll write a small C program that demonstrates data races.&lt;/p&gt;
&lt;h2 id="what-are-threads"&gt;What Are Threads?&lt;/h2&gt;
&lt;p&gt;Each program executes as a separate &lt;strong&gt;process&lt;/strong&gt;, and each process has its own memory space.&lt;/p&gt;</description></item><item><title>About Me</title><link>https://loonins.github.io/lowlatencylog/posts/hello-world/</link><pubDate>Wed, 10 Jun 2026 00:00:00 +0000</pubDate><guid>https://loonins.github.io/lowlatencylog/posts/hello-world/</guid><description>&lt;p&gt;I’m Sourish, a second-year IT student at IIIT Allahabad. I spend most of my time somewhere between systems, security, and low-level programming, basically anything that forces me to confront what the machine is actually doing instead of what I think it’s doing.&lt;/p&gt;
&lt;p&gt;I like taking things apart. Sometimes that means stepping through binaries in a debugger, sometimes it means reading source code line by line, and sometimes it just means breaking something and sitting with the mess until it starts to make sense. Clean abstractions are useful, but they hide too much. The interesting parts are where they fail—where assumptions leak, where undefined behavior creeps in, where a small oversight turns into a vulnerability.&lt;/p&gt;</description></item></channel></rss>