Open Source Debuggers

HT is a file editor/viewer/analyzer for executables. The goal is to combine the low-level functionality of a debugger and the usability of IDEs. We plan to implement all (hex-)editing features and support of the most important file formats.

The Open Log Engine is a powerful tool for advanced logging in games or programs. It easily allows you to make logging outputs in your program and analyse them afterwards with the Open Log Viewer, which provides you a powerful filtering system.

The classes in stdfuncs.inc.php provide general functions you can use while developping a PHP Application / Website or whatever. - Debugging - Time measurment - Sorting and Grouping - JSON Encoding - XML-Reading - FileSystem - Date handling

The p1451-1 project is a communication protocol dissector plugin for WireShark (formerly Ethereal). This plugin is limited to dissection of IEEE 1451.1 on-the-wire messages. It currently supports header parsing of basic 1451.1 packets and argument arrays

Shadowsocks-libev is a lightweight secured SOCKS5 proxy for embedded devices and low-end boxes. Shadowsocks-libev is written in pure C and depends on libev. It's designed to be a lightweight implementation of shadowsocks protocol, in order to keep the resource usage as low as possible. Snap is the recommended way to install the latest binaries. You can build shadowsocks-libev and all its dependencies by script. The latest shadowsocks-libev has provided a redir mode. You can configure your Linux-based box or router to proxy all TCP traffic transparently, which is handy if you use an OpenWRT-powered router. Although shadowsocks-libev can handle thousands of concurrent connections nicely, we still recommend setting up your server's firewall rules to limit connections from each user. We strongly encourage you to install shadowsocks-libev from jessie-backports-sloppy.

Not working yet. To deal with the Halting Problem, computing and data are navigated using debugger ops: linearForward and treeForward, which navigate an astronomically large bit string where 1 is ( and 0 is ). All pairs are derived from (). For example, true is represented as ((()())()), and false is (()(()())). It appears related to the church encoding of lambda where T chooses first parameter and F chooses second, of a pair. Continuations are nearly finished code and are represented as a pair of stack and queue. The stack is a linked list of pair of true or false and object pushed on the stack. The queue is also such a linked list but is paired oppositely so previous queue state goes on the left and next object queued on the right of the new pair, so when the queue is navigated in sequence of that astronomically long bitstring (thats exponential of reusing objects in the acyclicNet), the Nav32 (using linearForward and treeForward for random access) first sees the oldest object queued