Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
hcs
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
15 ms
·
151.
▲
by
hcs
3y ago
There is this footnote on pg 2: > We might call this the "vampire einstein" problem, as we are seeking a shape that is not accompanied by its reflection Also the glorious > Lemma 2.1. There exists a Spectre.
152.
▲
by
hcs
3y ago
Great read! > Gibson and Stephenson had taught me that the messenger, the mailman, was a vital romantic figure. It seemed weird to me that both Snow Crash and Virtual Light had main characters who were couriers. When I read Virtual Light
153.
▲
by
hcs
3y ago
> dependencies on _write time to the registry_, adding arbitrary retry loops to overcome time resolution For what it's worth, around this time Microsoft's own API (which will only set Edge as default) messed this up occasionall
154.
▲
by
hcs
3y ago
If you're exporting assets for a game, and the swap would be significant, shouldn't it really be generating big or little endian depending on the target? Many audio engines do this, using e.g. RIFX on big endian targets and RIFF o
155.
▲
by
hcs
3y ago
I guess because the implementations aren't intending to support a lot of different input codecs, so there's no benefits to the flexibility of AIFF/AIFC. Also avoids having to deal with an 80-bit extended precision float just
156.
▲
by
hcs
3y ago
Looks like this fixes the issue raised in the last discussion [1] by no longer re-quantizing the decoder state at the start of every frame. I still think it's not worth the extra complexity over a simpler fixed set of second order line
157.
▲
by
hcs
4y ago
Negative 10x
158.
▲
by
hcs
4y ago
https://en.wikipedia.org/wiki/Royal_lives_clause
159.
▲
by
hcs
4y ago
For model checking Alloy might be a better example, it directly builds SAT instances (through the Kodkod constraint solver) that are then solved with a SAT solver. I don't think the standard TLA+ checker (TLC) uses SAT explicitly, thou
160.
▲
by
hcs
4y ago
Given how large the frames are in QOA, it doesn't seem like too much overhead to have the full history and weights stored per frame (if seeking to any frame is required).
161.
▲
by
hcs
4y ago
This bit > What makes QOA work is 1) a reasonably good predictor and 2) storing the scalefactor for a bunch of samples explicitly instead of guessing the right one from context, like ADPCM does. suggests a comparison with DVI/IMA AD
162.
▲
by
hcs
4y ago
> Most GameCube games used their own 8-bit ADPCM format Minor quibble but, at least for music, most GC games used a native 4-bit ADPCM ("DSP", decoded by the DSP, or the ADP/DTK format, like CD-XA ADPCM and also handled in
163.
▲
Replicating Rise4Fun Z3 with z3-WASM
(philipzucker.com)
3 points
by
hcs
4y ago
|
0 comments
164.
▲
Linelith Level Design Timeline
(cwpat.me)
1 points
by
hcs
4y ago
|
0 comments
165.
▲
by
hcs
4y ago
I noticed this a few days ago when following a [pdf] link from HN. It's pdf.js as on desktop, though the UI is not too full-featured yet. It's going to save me a lot of irritation dealing with other PDF apps. Article from a few we
166.
▲
Internal PDF viewer enabled in nightly Firefox Android
(bugzilla.mozilla.org)
1 points
by
hcs
4y ago
|
1 comments
167.
▲
by
hcs
4y ago
Looks like it might work up to 16 MB? # If you have more than 2MB flash, you need to change the flash size by adding -DFLASH_SIZE_MB={one of 2,4,8,16} here. 2MB might be a minimum, as the standard bootcode needs 1MB + 4KB. See my boo
168.
▲
by
hcs
4y ago
The example that comes to my mind is that Square hired Iranian-American Apple II expert Nasir Gebelli to program their Famicom games.
169.
▲
by
hcs
4y ago
I haven't tested but I would guess it's a whole lot faster to compute but will end up sending much more data, given that it only works via exact chunks. A big part of binary patching is finding the largest possible chunks, even if
170.
▲
by
hcs
4y ago
I used to use the W alias whenever I noticed myself doing it on a new setup, but I haven't had to do it recently. I suspect my "slow on the shift" issue was due in part to the lousy keyboards I used to use.
171.
▲
by
hcs
4y ago
Yeah I have one like that (Oxo brand), the sieve seems to work better for me.
172.
▲
by
hcs
4y ago
Previously: https://news.ycombinator.com/item?id=12673739 Oct 2016, 86 comments I'd missed it, glad it came up again!
173.
▲
by
hcs
4y ago
Small round wire sieve that fits on top of a mug, < $20 at the supermarket. I'd bought various devices intended as tea strainers before, but they were hard to clean and didn't let the leaves drain properly. A small thing, but i
174.
▲
by
hcs
4y ago
It's not a Lua VM but the bytecode interpreter in Crafting Interpreters uses upvalues similarly and has some diagrams: https://craftinginterpreters.com/closures.html#upvalues Edit: And yeah I don't think it's
175.
▲
by
hcs
4y ago
My first thought was the Linux kits for PS2 and PS3. https://en.wikipedia.org/wiki/Linux_for_PlayStation_2 https://en.wikipedia.org/wiki/OtherOS I wasn't disappointed, though, this is a prett
176.
▲
by
hcs
4y ago
I once made a little puzzle that involves this idea: https://hcs64.itch.io/fitting-words
177.
▲
Show HN: Speleomorph, an Exploration Puzzle
(hcs64.itch.io)
11 points
by
hcs
4y ago
|
3 comments
178.
▲
by
hcs
4y ago
Oops, yeah I was thinking of RSA, thanks for the correction.
179.
▲
by
hcs
4y ago
A public key signature works by encrypting the hash with the private key, to verify you decrypt the hash with the pubic key and check it against your own hash of the payload. Edit: No argument with your second point, just pointing out the m
180.
▲
by
hcs
4y ago
Neat idea. I'm imagining something like an FPGA or MPPA [1], where you program an interconnect (pipes) between dozens of available cores (processes), which can be configured to do one of a few hardcoded types of stream processing (comm
More ›