Skip to content

Instantly share code, notes, and snippets.

View opsec-ee's full-sized avatar
👣
Working together

opsec-ee opsec-ee

👣
Working together
  • eSentinel
  • U.S.A
View GitHub Profile
/*
* @file ee_div_table.c
* @version 2.4.0
* @author (code) H. Overman (ee) <opsec.ee@pm.me>
* @author LeeMetaXTRON
* @license MIT -- Copyright (c) 2025 H. Overman (ee)
* @brief Divisibility truth table: MOD zeros = clean choke points.
*
* Euman = ∫(optimization/time) △ performance
*
@opsec-ee
opsec-ee / Notation_as_Engineering.md
Last active April 28, 2026 17:37
Notation as Engineering

Notation as Engineering: What the Hardware Already Knows

H. Overman (ee) Independent Security & Systems Research — Euman Language Ecosystem Companion paper to PPO 6.5 (released 2026-04-27)


"The hardware was working perfectly. That was the problem."

@opsec-ee
opsec-ee / _reader-macros.md
Created March 16, 2026 23:21 — forked from chaitanyagupta/_reader-macros.md
Reader Macros in Common Lisp

Reader Macros in Common Lisp

This post also appears on lisper.in.

Reader macros are perhaps not as famous as ordinary macros. While macros are a great way to create your own DSL, reader macros provide even greater flexibility by allowing you to create entirely new syntax on top of Lisp.

Paul Graham explains them very well in [On Lisp][] (Chapter 17, Read-Macros):

The three big moments in a Lisp expression's life are read-time, compile-time, and runtime. Functions are in control at runtime. Macros give us a chance to perform transformations on programs at compile-time. ...read-macros... do their work at read-time.

@opsec-ee
opsec-ee / polymorphic-2.c
Last active March 22, 2026 02:26
JSON Polymorphic Dispatch — Graph Coloring Edition (magician ready)
/*
* @file polymorphic-2.c
* @version 2.2.0
* @author H. Overman <opsec.ee@pm.me>
* @brief JSON Polymorphic Dispatch — Graph Coloring Edition
* SoA layout, BTB dealiasing, group-direct loops,
* graph coloring reorder, 4-state gate system.
*
* Copyright (c) 2025 H. Overman <opsec.ee@pm.me>
* CC-BY-NC 4.0 non-commercial license
@opsec-ee
opsec-ee / grphcolr.c
Created January 24, 2026 23:59
Graph Coloring in C
/* Author: H. Overman 2026 */
/* n/a "toy" */
#include <stdbool.h>
#include <stdint.h>
#include <string.h>
#include <stdio.h>
#include <time.h>
@opsec-ee
opsec-ee / bijective_maths.a
Created January 20, 2026 02:56
bijective_maths
do {
value = feistel_encrypt(value);
} while (value >= N);
```
### 4. Proof: Cycle-Walking Preserves Bijection
**Theorem:** f: S → S is a bijection.
**Proof:**
/*
* ISAAC CSPRNG v4.0 — Full Architecture Rewrite
* License: Public Domain (following original ISAAC license)
*
* Euman = integral(optimization/time) delta performance
*
* Based on Bob Jenkins' ISAAC (1993) — Public Domain algorithm.
* This implementation: Proprietary optimizations, C23, Euman IFP.
*
* =======================================================================
/*
* lzw.c
* Euman = ∫(optimization/time) △ performance
*
* @file lzw.c @version 2.1.0
* @author H. Overman (ee)
* @created 2026-03-20
* @modified 2026-03-20
* @by H. Overman (ee)
* @brief LZW compression / decompression. C23
// https://rosettacode.org/wiki/Huffman_coding - solved in C
#include <stdio.h>
#include <string.h>
#include <sys/time.h>
typedef struct timeval timepoint_t;
static inline timepoint_t get_time(void) {
struct timeval t; gettimeofday(&t, NULL); return t;
}
/*
* @file prime_ee.c
* @version 3.5.6 (final)
* @author H. Overman (ee) <opsec.ee@pm.me>
* @license MIT -- Copyright (c) 2025 H. Overman (ee)
* @brief Erdos-Selfridge Prime Categorization Engine.
* Sieve 1M primes, categorize by recursive depth of p+1
* factorization, store in RAMstore for O(1) lookup.
*
* 8 runs. (CLOCK_MONOTONIC, -O3 -march=native -flto)