remexre

6 ms·

31.
Scaling Latent Reasoning via Looped Language Models(arxiv.org)
84 points by remexre 9mo ago|15 comments
32.
by remexre 9mo ago
How would algebraic types work with SLIME? If I remove a constructor from my algebraic type, what happens to values of that type that are built with that constructor that're stored in globals? In the same way that non-hygienic macros i
33.
by remexre 9mo ago
> get into "unsafe" states on purpose see, this seems like something that's nice to actually put into the types; a Ptr<Foo> is a real pointer that all the normal optimizations can be done to, but cannot be null or ot
34.
by remexre 10mo ago
This only covers what's in https://wiki.osdev.org/Bare_Bones , but in Rust, right?
35.
by remexre 10mo ago
For each token generated, you only send one token’s worth between layers; the previous tokens are in the KV cache.
36.
by remexre 10mo ago
How's [0] or [1] for historical sources? It's not surprising that Google doesn't turn these up, the golden era of this complaining was pre-WWW. [0]: https://www.ee.torontomu.ca/~elf/hack/realmen.html
37.
by remexre 11mo ago
how would you encode a program like function f<T>(x: T) { return x; } function g(x: number) { return { a: f(x), b: f(x.toString()) }; } in sat? if that's easy, how about length and f in: function append<T&gt
38.
Fzz Buzz Without I, I,;, or:?(remexre.com)
3 points by remexre 11mo ago|0 comments
39.
by remexre 11mo ago
I wonder how well Proton would work for it...
40.
by remexre 11mo ago
Not counting, of course, the 30,177 suicides by American veterans in the wake of the global war on terror. https://costsofwar.watson.brown.edu/sites/default/files/pape...
41.
by remexre 11mo ago
Beyond the Git history, is there any write-up of the different capability designs you've gone with? I'm interested in implementing a safe low-level language with less static information around than C has (e.g. no static pointer-in
42.
by remexre 11mo ago
Test suites: https://github.com/riscv-software-src/riscv-tests Formal model: https://github.com/riscv/sail-riscv
43.
by remexre 11mo ago
Are there even close to 2% of Debian users using a DEC Alpha?
44.
by remexre 1y ago
isn't std::unordered_map famously slow, and you really want the hashmap from abseil, or boost, or folly, or [...]
45.
by remexre 1y ago
It does feel like somebody forgot that "from the first sentence or two of the email, you can tell what it's about" was already a rule of good writing...
46.
by remexre 1y ago
My theory was that strategically, Google wants to make AVIF ubiquitous to promote adoption of decoders for it in mobile devices; AVIF losing to JXL is a "whatever" on Google's part, but AV1 losing to H265 means another decade
47.
by remexre 1y ago
Encryption and reliable transport.
48.
by remexre 1y ago
> These so-called dynamic types are merely the equivalent of tags in a discriminated union/variant type. That's far more true in a language like JavaScript or Scheme than in an "everything is an object" language like
49.
by remexre 1y ago
Funny question since you bring up JTAG and RISC-V -- do you have a cheapish RISC-V device you'd recommend that actually exposes its JTAG? The Milk-V Duo S, Milk-V Jupiter, and Pine64 Oz64 all seem not to expose one; IIRC, the Jupiter e
50.
by remexre 1y ago
To pick on graphics, since I'm more familiar with that domain, the problem isn't that this tutorial is about software rasterization, it's that the tutorial is a raytracer that doesn't do shading, textures, shadows, or an
51.
by remexre 1y ago
Does that result in working NSS?
52.
by remexre 1y ago
> Maybe RISC-V? RISC-V is specified as a RISC (and allows very space-/power-efficient lower-end designs with the classic RISC design), but designed with macro-op fusion in mind, which gets you closer to a CISC decoder and EUs. It&#x
53.
by remexre 1y ago
The difference between parse and validate is function parse(x: Foo): Bar { ... } const y = parse(x); and function validate(x: Foo): void { ... } validate(x); const y = x as Bar; Zod has a parser API, not a va
54.
by remexre 1y ago
They're dependent loads, so probably not except for the last level of page tables (and that's just be "prefetching" -- doing 4/8/etc walks in parallel, not 1 walk in less time).
55.
by remexre 1y ago
The scraper breaking every time a new version of Anubis is deployed, until new anti-Anubis features are implemented, is the point; if the scrapers were well-engineered by a team that cared about the individual sites they're scraping, t
56.
by remexre 1y ago
https://danluu.com/branch-prediction/ is a good illustrated overview of a few algorithms.
57.
by remexre 1y ago
> unless that crawl is unreasonably expensive or takes it down for others This _is_ the problem Anubis is intended to solve -- forges like Codeberg or Forgejo, where many routes perform expensive Git operations (e.g. git blame), and scra
58.
by remexre 1y ago
Alfred Hitchcock's movies aren't missing from Netflix because Netflix couldn't afford to pay for their production.
59.
by remexre 1y ago
Are there any implementations of this lambdas proposal on top of any production-quality compilers? Or are there some updates on how this is doing in committee?
60.
by remexre 1y ago
Am I missing where the GitHub link is for this, or did the author not release sources? It'd be fun to reproduce this on a different machine, and play around with other architectures and optimizers that weren't mentioned in the art

More ›