Our great sponsors
| wcc | trapcc | |
|---|---|---|
| 4 | 9 | |
| 1,803 | 1,241 | |
| - | - | |
| 0.0 | 0.0 | |
| about 1 year ago | about 11 years ago | |
| C | C | |
| GNU General Public License v3.0 or later | BSD 3-clause "New" or "Revised" License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
wcc
-
Shared Libraries as Executables
rundll32.exe is just a way of doing FFI from as a command -- there are few different options on UNIX-likr systems for that. The most obvious is ctypes.sh [0].
There are, though, even more sophisticated options than just FFI, like the Witchcraft Compiler Collection [1], which includes among other things an interactive shell.
[0] https://github.com/taviso/ctypes.sh
[1] https://github.com/endrazine/wcc
- The Witchcraft Compiler Collection
-
The Cursed Computer Iceberg Meme
witchcraft compiler collection
-
This is my style of coding
https://github.com/endrazine/wcc - the witchcraft compiler can take a binary and turn it into a shared library that can be loaded by another application. It also comes with a suite of tools that can help you probe an application to figure out its APIs and such.
trapcc
- trapcc - computing with traps
-
Subtraction Is Functionally Complete
A variation of this has been done using Intel MMU fault handling. Behold: https://github.com/jbangert/trapcc
This is a proof by construction that the Intel MMU's fault handling mechanism is Turing complete. We have constructed an assembler that translates 'Move, Branch if Zero, Decrement' instructions to C source that sets up various processor control tables. After this code has executed, the CPU computes by attempting to fault without ever executing a single instruction. Optionally, the assembler can also generate X86 instructions that will display variables in the VGA frame buffer and will cause control to be transferred between the native (display) instructions and 'weird machine' trap instructions.
-
Building Processors from the Ground Up
This thread is about hacking something up and not building a product.
For example imagine somebody shares the "one instruction set computer" (https://en.wikipedia.org/wiki/One-instruction_set_computer) project or x86 MMU being turing complete (https://github.com/jbangert/trapcc). Both are clearly just interesting hacks (which may have some interesting implications about security and what does it mean to be "code" etc) and certainly are not intended to be practical products
-
x86 is Turing-complete with no registers
fwiw, linked to from the article:
> As others have shown, we can compute using alphanumeric machine code[1] or English sentences[2], using only the mov instruction[3], or using the MMU[4] as it handles a never-ending double-fault. Here is my contribution to this genre of Turing tarpit: x86 is Turing-complete with no registers.
[1] http://www.phrack.org/issues.html?issue=57&id=15#article
[2] http://www.cs.jhu.edu/~sam/ccs243-mason.pdf
[3] http://www.cl.cam.ac.uk/~sd601/papers/mov.pdf
[4] https://github.com/jbangert/trapcc
- Trapcc – Computing with Traps
-
Insane x86 Turing Machine that does not run any x86 instructions
I think trapcc is what you're thinking about maybe?
-
So, what's your favourite programming language?
MMU gang.
-
The Cursed Computer Iceberg Meme
page fault handling is Turing complete
What are some alternatives?
sandsifter - The x86 processor fuzzer
rust - Empowering everyone to build reliable and efficient software.
cmake-raytracer - Ray tracer written in pure CMake
movfuscator - The single instruction C compiler
dylibify - Transform any ARM macho executable to a dynamic library
Bootstrap - The Bootstrap Book
Metasploit - Metasploit Framework