russell@unturf.com
9410816bdc
New section between Portal and EML universality proof. Brief explanation of the bend primitive + a worked code example showing: - tiny inputs stay local (cost below threshold) - heavy inputs ship to a GPU worker (cost above threshold) - one tier-portable (bend …) macro, with bend-call as the asm form Mentions the measured 1.5–10× wins against host hashlib on the SHAKE256 fan-out workload, calls out the ~100 MB break-even threshold so visitors know when bend pays off. Cites the cuda-fanout README + integration design for callers who want the wire contract and per-tier hosting story. License: AGPLv3, matching the rest of the site. |
||
|---|---|---|
| .. | ||
| fonts/chunkfive | ||
| 404.html | ||
| index.html | ||
| lumbda-logo-green.png | ||
| lumbda-logo.png | ||
| lumbda-whitepaper.html | ||
| lumbda-whitepaper.pdf | ||
| robots.txt | ||
| style.css | ||
