orlp

76 ms·

481.
by orlp 4y ago
I haven't, but now I have. I took https://opus-codec.org/static/examples/samples/music_orig.wa... from https://opus-codec.org/examples/ . Then I wrote the following snippet of Python
482.
by orlp 4y ago
> A uniform float in the range [0, 1) has exactly 2^53 possible values (if you generate it in any sensible way). No, there are 2^62 - 2^52 float64 values in [0, 1), so your method (which I assume is to fix the exponent at 0, randomize ma
483.
by orlp 4y ago
You can bootleg your own fast lossless codec by doing delta-encoding on the raw PCM to get a lot of zeros and then feed it through an off-the-shelf fast compressor like snappy/lz4/zstandard/etc. It won't get remotely clo
484.
by orlp 4y ago
> Also, when you are that income level, there are a number of tax benefits you can enjoy - for example the first £40k you put into your pension is before tax - so it effectively reduces your salary (for tax purposes) by £40k. It also red
485.
by orlp 4y ago
O(1) indexing into an array is a much bigger lie in practice than relying on single-word hash values. It breaks down much, much sooner which is why we have multiple levels of caches to try and hide this. In reality random indexing is O(sqrt
486.
by orlp 4y ago
Nowadays everyone and their mother has a smartphone on them. Place down your smartphone and start recording. Move to the switches and flip them as needed. Check back the recording to provide your answer.
487.
by orlp 4y ago
It does not necessarily add a branch to the lookup, look more closely: all current data exists in buf in its entirety. It is duplicated into next_buf. This might be problematic depending on T in C++ as it would need to invoke copy constru
488.
by orlp 4y ago
Not if you use a hash set. This is expected O(n) time to de-duplicate an array of integers while maintaining the original order (more explicitly written than I normally would in Rust for didactical purposes): let mut hash_set = HashSe
489.
by orlp 4y ago
Fun fact: you can make the time of a push unconditionally O(1) at the cost of extra memory as well. This is useful if you really can't afford the unpredictable spike in performance. The trick is to slowly already start copying data int
490.
by orlp 4y ago
LLVM needs a competitor in the generic compiler backend space. There is no pressure, nothing fanning the heat to drive improvement.
491.
by orlp 4y ago
> Quantum Mechanics has been aggressively and extensively tested against measured observations of reality and has not yet found a discrepancy with it That isn't true. Here's a discrepancy: the universe appears to be following t
492.
by orlp 4y ago
This is actually a common implementation for multiplication in the finite field GF(8), using 2x256 byte exp/log lookup tables.
493.
by orlp 4y ago
Well to make the playing field equal it would be 2^19 times the time to check a solution, which is another factor of 36 times a fairly large constant C. So really you're comparing 2^19*C to 32^2.
494.
by orlp 4y ago
O(n^2 * w) where n is the number of equations and w is the number of elements in an equation.
495.
by orlp 4y ago
Just naive Gaussian Elimination works in any field.
496.
by orlp 4y ago
> What could have saved it? Persistent memory was/is a big topic in the database research world. The idea was that you would not need to worry about ACID since all your data is still there in the event of a power loss/crash. It
497.
by orlp 4y ago
It's all smoke and mirrors. The real problem is that ISPs sell the very same thing to multiple people for full price, and when things break because multiple people want to use the thing they paid for at the same time they blame you
498.
by orlp 4y ago
FYI "The Ukraine" is a term pushed by Russian influences to make you think of it as a region (literally translated "the borderlands") as opposed to a sovereign state. The country is just called Ukraine.
499.
by orlp 4y ago
Hey, slotmap author here. Last year has been a bit rough and I didn't have a whole lot of free time and energy to work on projects at the same time. That said, I don't believe any of the open issues on slotmap are of immediate nee
500.
by orlp 4y ago
Hey, slotmap author here. Once I get around to slotmap 2.0 (as noted by my inactivity, I haven't had much of the good free time + energy combination last year), the default behavior will be to leak the memory of a slot after 2^31 alloc
501.
by orlp 4y ago
This paper [1] claims that with their implementation they can get an AQFT (approximate QFT) with sufficient precision to factor RSA-2048 with < 0.01% error probability using 2083 qubits, 364,510 CNOT gates and 196,234 T gates, both of wh
502.
by orlp 4y ago
Yes when I said very atypical I meant compared to the average consumer, not the HN crowd. Much more common here for sure.
503.
by orlp 4y ago
Begs the question: why not ship 2 mixes? Not like audio is a significant chunk of the data of a modern blu-ray movie.
504.
by orlp 4y ago
I know I'm very atypical in this but I like to game as well as run the occasional machine learning stuff. Nvidia has a hard lock on the latter, basically giving me no choice.
505.
by orlp 4y ago
With the financial situation being how it is I, paradoxically, would currently consider donating to Wikipedia to be actively harmful to the future of Wikipedia. The larger its dragon hoard of money grows (which is already way beyond any sor
506.
by orlp 4y ago
That isn't implied. A particle pair collapsing from a superposition of to one of its eigenstates upon measurement, is a change in the particle in one location that instantaneously affects the other for all intents and purposes. This
507.
by orlp 4y ago
That makes sense, I have already edited my comment to say specifically computer graphics since posting since I realized it could have very useful applications in physical modeling, or other scenarios where you specifically care about the co
508.
by orlp 4y ago
Given this definition I think you almost never really want the parallel curve though (at least in computer graphics). Its behavior on the inside of corners is degenerate and not what one is looking for in almost any scenario involving curve
509.
by orlp 4y ago
> why not round up to 212x300 mm? Because the A standard's baseline is A0 which has exactly 1m^2 area. So that nice rounding did happen, just at the baseline scale, and on area. The B series is a tad larger, B0 happens to exactly be
510.
by orlp 4y ago
If you play the game 20 games you'll still be better off pressing the 1 million button 5-10 times, at the start if you don't know in advance how many presses you get, or at the end if you do and haven't won big yet.

More ›