Research
›Amundson Framework
G(n) = n^(n+1) / (n+1)^n
The Amundson constant A_G converges to 1/e as n→∞. Computed to 10 million digits. 536/536 identity tests passing. Framework published at BlackRoad-OS-Inc/amundson-constant.
50+ proven identities connecting A_G to e, pi, gamma, and the prime counting function. LaTeX paper (13pp) + full framework document available.
›Ternary Computing
-1, 0, +1 balanced ternary
BlackBox Protocol uses ternary routing: 1=arrived, 0=waiting, -1=already answered (cancel pending). The 1/(2e) term from the Amundson expansion is the irreducible information gap — the minimum latency floor for any mesh network.
›BlackBox Protocol
Multi-network mesh: Tor / IPFS / BitTorrent / WebRTC / Bitcoin
Tested full mesh: 7 nodes, 5 protocols, 2.19s round-trip. Tor hidden services on 3 Pis. n/(1+1/n)^n = n/e + 1/(2e) + O(1/n). Next: IPFS nodes, BitTorrent DHT, mesh.js browser SDK.