GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing netacoding.com — Netacoding | Cybersecurity, Assembly & Network Research
Dedicated to Low-Level Research and Cybersecurity Tools. Analyze internet protocols, master Assembly language, and use our professional-grade security toolkit for daily operations.
47 posts
·
... stars
·
JM00NJ
AGI
Embodied-AI
Current LLM scaling is hitting a ceiling — not because compute is scarce, but because text is a description of the world, not an experience of it. Real AGI requires embodied perception, intrinsic curiosity as a core drive, and self-directed exploration. Release 2000 robots with no task. Some will find their own path. The ones that arrive cannot be copied — their weights are the product of lived experience, not training data.
OSI
Networking
OSI gives you 7 clean layers and tells you every packet goes through all of them in order. Modern networking disagrees. This post proposes a replacement model built around how systems actually behave: OS Kernel as its own layer, Proxy/Middleware as a first-class citizen, floating layers for protocols that shift placement based on deployment (TLS, eBPF, mTLS), and stack profiles for DPDK bypass, eBPF extension, and sidecar mesh. Positions taken on DoH, AF_XDP, io_uring, TOE offloads, and hardware crypto.
x64-Assembly
XOR
XOR encryption in assembly is three operations: open a file, XOR each byte against a key in a tight loop, write the output. The fixed-key version is eight instructions per iteration; the rolling-key version adds one — add r15b, 0x11 — which updates the key every cycle and wraps automatically at 0xFF because r15b is 8-bit. Both versions decrypt with the same code. The real lesson is a pointer bug that every assembly programmer hits: mov rdx, [buffer] dereferences the label, turning file data into a memory address and segfaulting; lea rdx, [buffer] takes the address itself.
SHA-256
Cryptanalysis
SHA-256 output distribution is not featureless. CDP projects each 64-hex-digit output to a scalar weight W ∈ [434,555] across 961 classes, revealing a Cycle-1 (476↔438 fixed point), an 8-node Cycle-2, and strongly asymmetric basin topology. The 38.6x scalar pre-filter achieves zero false negatives. Compound triple constraint delivers 42.55x rainbow chain speedup — 16.6x beyond the published literature best of 2.56x. OpenCL implementation included.
HTTP3
QUIC
Sending an RFC 9114 §4.1 trailer HEADERS frame to production HTTP/3 infrastructure triggers state machine failures across two independent CDN edge implementations and the quiche client library. Server-side: 60-second goroutine hang (CDN-A) and 12,200ms QPACK decoder stall with 24.9× worker amplification (CDN-B). Client-side: permanent zombie stream leak in quiche driving Network Service memory from 6 MB to 339 MB before OOM. All three share the same root cause: the second HEADERS frame on a request stream reaches a code path with no defined handler. The threat model inversion — server pushing a malformed trailer toward client — transforms a server-side bug class into a drive-by browser memory exhaustion attack.
WebTransport
QUIC
A malformed trailer HEADERS frame (END_STREAM=0) on a WebTransport CONNECT stream leaves quiche’s stream state machine permanently stuck: trailers_decompressed_=true but fin_received()=false, causing IsDoneReading() to return false forever. The stream is never removed from stream_map_, ShouldKeepConnectionAlive() holds the QUIC connection open, and Edge sends PING keepalives every ~15s indefinitely. A single webpage can open thousands of these zombie connections with no server-side limit, exhausting Network Service memory and crashing the browser. Both MSRC and Chrome VRP declined to track as security issues. |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |