jbangert/trapcc
Computing with traps observed · 2026-08-28
Health v2 · maintenance only
32/100
- Activity 0
- Release rhythm 35
- Longevity 100
Flags: no_releases
How is this computed?
round(0.45*activity + 0.35*rhythm + 0.20*longevity); archived -> min(score, 10) — computed 2026-09-03. Adoption (stars, forks) is never an input.
- gap_med: n/a
- age_days: 4994
- days_rel: n/a
- days_push: 4887
- n_releases_24m: 0
Adoption not part of the score
1324 stars · 49 forks observed · 2026-08-28
What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded
trapcc is a proof-by-construction that Intel MMU fault handling is Turing complete: an assembler translates 'Move, Branch if Zero, Decrement' programs into C that sets up processor control tables so the CPU computes purely via traps without executing instructions. It targets x86 bare metal or Bochs and can interleave trap-based computation with native display code.
Use cases
- demonstrate turing completeness of mmu fault handling
- obfuscate code so debuggers break
- research weird machines and hidden state computation
- distinguish bochs emulator from real hardware
- run programs with zero executed instructions on x86
When to choose
- studying weird machines or trap-based computation
- building anti-debugging or obfuscation research
- exploring x86 mmu and page fault behavior
When to avoid
- building production software
- needing portable or maintained tooling
- running on non-x86 hardware or modern vms
Facets
library · maturity maintenance
compiler interpreter programming-language reverse-engineering security security compilers operating-systems cpp embedded weird-machine mmu-traps turing-completeness code-obfuscation x86 proof-of-concept bochs research algorithms linux
1 source
- readme: https://github.com/jbangert/trapcc · fetched 2026-08-28 · 4f0224201a91
Member repositories
| Repository | Role | Health v2 |
|---|---|---|
| jbangert/trapcc | main | 32 |
For agents
Data as of 2026-08-30T08:39:29.467469+00:00 · Report a problem