Independent Research Lab

GRIM
LABS

by obed.gyamfi

Security research, embedded systems, and applied computation. Bridging silicon, software, and protocol layers — from transistor physics to consensus mechanisms.

Scroll
001 — About

Profile

UNIT: HUMAN
Fig. 01

Grim Labs is a public, independent research and engineering lab dedicated to building, testing, and refining ideas over the long term.

We explore innovative solutions across technology and science, documenting our work openly to engage collaborators and share insights with the broader community.

Our goal is to make research and experimentation accessible, meaningful, and impactful for everyone involved.

DOMAINS
04
YEARS
1+
PROJECTS
1+
002 — Domains

Research
Domains

01

Cybersecurity

Vulnerability research, penetration testing, binary analysis across network, web, and embedded attack surfaces.

02

Embedded Systems

Firmware development, PCB design, hardware hacking, circuit analysis, and microcontroller programming.

03

AI & Computation

Machine learning, computational theory, mathematical foundations, and applied algorithm design.

04

Full-Stack & Web3

Scalable architectures, smart contract development, DeFi protocols, and modern web platforms.

003 — Knowledge

Technical
Cartography

Security
  • Web application pentesting
  • Network security assessment
  • Vulnerability research
  • Binary exploitation
  • Reverse engineering
  • OSINT
Development
  • Full-stack web (React / Next.js)
  • API design & implementation
  • Cloud infrastructure
  • TypeScript / Python / Go
  • Docker / Linux admin
  • Git workflows
AI / ML
  • Model development & training
  • ML system deployment
  • Data pipeline engineering
  • Computational theory
  • Applied mathematics
  • Algorithm design
Hardware
  • Firmware development
  • PCB design (KiCad)
  • Circuit analysis
  • JTAG / SWD debugging
  • Embedded Linux
  • RF basics
004 — Projects

Selected
Works

004 — Writings

Research
Notes

MAR 12, 2026·10 mins

[TEST BLOG] - The Prime Counting and the Zeros of ζ(s)

This post develops the connection between the prime counting function π(x)\pi(x) π(x) and the non-trivial zeros of ζ(s)\zeta(s) ζ(s), culminating in the explicit formula and what the Riemann Hypothesis asserts about the error term.

Read Article
Feb 10[TEST BLOG] - Introduction to Embedded Programming: Getting Started with Microcontrollers
8 minutes
Feb 10[TEST BLOG] - Understanding Syscalls: How Programs Talk to the Kernel
1 min