Skip to content

Navigation Menu

Sign in
Sign up

no-way-labs

███╗ ██╗ ██████╗ ██╗ ██╗ █████╗ ██╗ ██╗
████╗ ██║██╔═══██╗ ██║ ██║██╔══██╗╚██╗ ██╔╝
██╔██╗ ██║██║ ██║ ██║ █╗ ██║███████║ ╚████╔╝
██║╚██╗██║██║ ██║ ██║███╗██║██╔══██║ ╚██╔╝
██║ ╚████║╚██████╔╝ ╚███╔███╔╝██║ ██║ ██║
╚═╝ ╚═══╝ ╚═════╝ ╚══╝╚══╝ ╚═╝ ╚═╝ ╚═╝
 ██╗ █████╗ ██████╗ ███████╗
 ██║ ██╔══██╗██╔══██╗██╔════╝
 ██║ ███████║██████╔╝███████╗
 ██║ ██╔══██║██╔══██╗╚════██║
 ███████╗██║ ██║██████╔╝███████║
 ╚══════╝╚═╝ ╚═╝╚═════╝ ╚══════╝
──────────────────────────────────────────────────
 mapping the obstruction

Pinned Loading

  1. residue residue Public

    Hamiltonian decomposition of Z_m^3 Cayley digraphs for all m > 2 — a complete solution to Knuth's "Claude's Cycles," found by LLM agents under a structured exploration prompt. Constructions, proofs...

    TeX 27 4

  2. routing-absorption routing-absorption Public

    Sparse attention trained end-to-end absorbs the routing signal into Q/K/V, so learned gates barely beat random ones ('routing absorption'). Modal experiment code and the paper showing post-hoc KL d...

    Python

  3. minimum-state-product minimum-state-product Public

    Minimum state products on Dijkstra's self-stabilizing token ring — exact values for n = 3 through 9 and a large-n conjecture supported through n = 10. Paper, sorry-free Lean 4 formalization, Python...

    Python 5

  4. recurrent-memory-scaffold recurrent-memory-scaffold Public

    Orthogonalizing an mLSTM's memory read is a removable training scaffold, not a memory gain — paper, code, and per-seed results.

    Python

Repositories

Loading
Type
Select type
Language
Select language
Sort
Select order
Showing 9 of 9 repositories

Top languages

Loading...

Most used topics

Loading...

AltStyle によって変換されたページ (->オリジナル) /