A 37-Year-Old OpenBSD Kernel Vulnerability Has Been Successfully Exploited

A 37-year-old OpenBSD kernel vulnerability, Big Fish, was exposed and fully exploited.
OpenBSD is known for being "secure by default," but security researchers recently disclosed a kernel vulnerability, Big Fish, that lay dormant for 37 years and was successfully fully exploited. The technical impact of this incident lies not only in how long the vulnerability existed, but also in the fact that it was turned into an attack chain capable of actually threatening systems, showing that even long-audited core code can still contain deep blind spots. The article notes that code age does not equal audit completeness, and that some vulnerabilities have extremely unusual triggering conditions that routine review cannot cover. For systems that rely on security reputation, a single vulnerability can shake user trust; for system administrators, promptly following official patches and security advisories is the most direct response.
A Vulnerability Older Than Most Developers
In the field of operating system security, OpenBSD has always presented itself with a hardline stance of "secure by default." However, security researchers recently disclosed a kernel vulnerability that lay dormant for a full 37 years—and successfully achieved complete exploitation. That is almost long enough for the vulnerability to be older than quite a few currently active developers.
The vulnerability has been codenamed Big Fish, and the related discussion sparked heated debate on Hacker News (comment section). From a timescale perspective, when the flaw was introduced, the internet had not yet truly become commercialized, and the bug simply lay "asleep" in the codebase for nearly four decades.

Where Exactly Does the Difficulty of Exploitation Lie
Finding a bug that has existed for decades in core system software is shocking enough, but what truly raised eyebrows in the security community was the "successful exploitation."
The exploitability of kernel vulnerabilities has always been considered one of the most technically demanding aspects of security research. Finding a flaw that has slept for many years is already rare, but turning that flaw into an actually controllable exploit chain means the vulnerability is not merely "present"—it can genuinely threaten system security.
Based on the information disclosed by the researchers, this vulnerability is related to memory or privilege handling at the kernel level. The specific vulnerability details and technical path are explained in the original report, but its core significance lies in this: even code that has long been audited and repeatedly scrutinized by countless security researchers can still contain overlooked deep-seated problems.
Exploitation and vulnerability discovery are two completely different levels of difficulty. Discovering a bug usually only requires triggering abnormal behavior, such as a crash, assertion failure, or out-of-bounds memory read/write; "exploitation," however, requires an attacker to turn that abnormality into a controllable path to code execution or privilege escalation. In the kernel context, this is especially difficult: kernel space and user space are isolated, attackers cannot directly invoke system functions, and they must rely on techniques such as Heap Spraying, ROP (Return-Oriented Programming), or data-oriented attacks to construct a complete exploit chain under restricted address space and mitigation mechanisms. Modern kernels also generally enable defenses such as KASLR, SMEP, SMAP, and stack protection, further raising the bar. Therefore, the fact that a vulnerability can be "successfully exploited" means the researchers not only understood the flaw itself, but also broke through multiple layers of mitigations in the target system—which usually requires months or even years of repeated experimentation.
What This Means for the Security Community
This case once again reminds the industry: code age does not equal completeness of security auditing. The OpenBSD project is known for strict code review and proactive security hardening, but a 37-year timespan shows that the triggering conditions of certain vulnerabilities may be extremely unusual, making them difficult for routine audits to cover.
From an industry perspective, the implications of this incident are multifaceted:
- Code lifecycle management requires a longer-term perspective; assuming that "old code has already been audited enough" is dangerous;
- The exploitation threshold for kernel-level vulnerabilities may be lowering, as security research tools and methods continue to advance;
- Blind spots in security auditing may exist in any system, no matter how high its security reputation.
For system administrators running OpenBSD, promptly following official patches and security advisories is the most direct way to respond.
There is no positive correlation between code age and audit coverage. Auditing of large codebases often follows a "hotspot-first" principle: modules that are frequently modified, widely called, or have previously had problems receive more attention, while code that is stable, rarely changed, and located on peripheral paths is easily skipped. Code from 37 years ago may have been logically simple at the time with few callers, but as the system evolved, it may have come to be indirectly referenced by new subsystems, and its triggering conditions changed accordingly. In addition, early C code generally lacked modern secure coding standards, and hazards such as pointer arithmetic, integer overflow, and missing bounds checks were not regarded as defects back then. When such code is connected to the modern attack surface decades later, historical legacy issues are truly exposed. This also explains why "archaeological" vulnerability discovery often concentrates on extreme boundary conditions and rare call paths, rather than the routine flows that everyday audits can cover.
Re-examining Old Systems and Security Reputation
The Big Fish incident is not only a technical breakthrough, but also a blow to the concept of "security reputation." A system's security image is built on long-term community trust, but the discovery of a single vulnerability is enough to cast doubt on that trust.
Of course, discovering and fixing vulnerabilities is itself a sign of a healthy security ecosystem in operation. What is truly worrying is not the existence of a vulnerability, but whether it is discovered and handled in time.
From a longer-term perspective, this kind of "archaeological" vulnerability discovery may continue to appear. As security research tools mature and researchers pay deeper attention to low-level code, more problems sleeping in historical code may surface. For developers, perhaps the most practical reminder from this case is: never assume a line of code is safe just because it is very old.
Security reputation is a form of social trust based on historical track record, not a quantifiable security guarantee. OpenBSD's reputation comes from its long-standing commitment to proactive auditing, disabling unnecessary services by default, and a strict code admission process. This reputation has practical value in user decision-making: it lowers selection costs and makes administrators inclined to believe that "a system tested by time is more reliable." However, reputation also brings a halo effect: users may therefore lower their vigilance toward specific vulnerabilities, or assume that official audits have already exhausted all possibilities. The Big Fish incident does not negate OpenBSD's overall security practices, but reveals a structural fact—any system that relies on human auditing is limited by the auditor's time, tools, and imagination. The correct way to use reputation is to treat it as "a reference for risk probability," not "the elimination of risk."
Related articles

Random Pruning of the DPO Computation Graph: 1.4x Training Speedup and Lower Peak Memory
DPO training too slow and memory-hungry? This paper proposes a random pruning framework for the DPO computation graph, sampling independently across position, sequence, and branch dimensions; branch pruning achieves a 1.426x step-time speedup and cuts training time by about 30%, with in-depth attribution of memory and time gains.

Why Does JEPA Underperform MLM in Longitudinal EHR Representation Learning?
New study compares JEPA and MLM for longitudinal EHR representation learning on MIMIC-IV: three JEPA variants train stably without collapse but underperform MLM; target size, not heterogeneity, drives prediction error.

Transfer Learning + Visible Light Communication: A New Approach to Energy-Efficient Indoor Positioning
A study proposes a transfer learning-based visible light communication indoor positioning method, achieving 47% accuracy improvement on the BOSCH factory dataset, 67.5% model efficiency under high noise, and introducing the ME composite metric for energy-efficient positioning in energy-constrained industrial IoT scenarios.