remcob

21 ms·

151.
by remcob 8y ago
They are 100Hz, as I found out while trying to do an optics experiment, but they never bothered me directly. I think it has to do with LEDs going completely dark, where fluorescent just has slight fluctuations. Or maybe it is a 50Hz vs 100H
152.
by remcob 8y ago
> No, the diodes don't, the drivers do. You are speaking to a technical audience ;) I've seen 'drivers' that are nothing more than a resistor in series with the LED. So the LED, acting as a half-wave rectifier, causes
153.
by remcob 8y ago
> 1. Lots of LEDs flicker. Shitty ones with twice the frequency of the main current (so 100/120 Hz) While you might not notice this it causes eye strain and can lead to eye fatigue, headaches, migraines. That's with a full rect
154.
by remcob 8y ago
IMHO, the 'reading' gives it away. How would the doctors know it would appear in written form? Could be part of the technique of course. Still, I would change it to the more generic 'receive'.
155.
by remcob 8y ago
> Wireless only appears to be low error rate because the physical layer had to cover up it's shortcomings otherwise TCP's performance became abysmal. It then seems that optimized protocols like QUIC could benefit from disablin
156.
by remcob 8y ago
What are the limitations? The blog mentions that transformations are pushed to the leaves of the tree. Is this always possible? Are there operations that can not be implemented using slices?
157.
by remcob 8y ago
Don't think so. This solves problems in the 2D domain, but the paper solves problems in the 3D domain.
158.
by remcob 8y ago
Rendering a scene is a function that takes lights, camera, geometry, textures as inputs and outputs an image. This function is very complex and hard to invert. But, and this is the interesting thing I got from the article, it is similar eno
159.
by remcob 8y ago
In some sense the ruler-and-compass constructions are even more computable than the natural numbers: Any (first-order) statement in Euclidean geometry is either true or false and there is an algorithm (on a Turing machine) that can compute
160.
by remcob 8y ago
Your argument is completely valid in the current context, which is the only that matters. Just FYI, In other contexts these points are more nuanced: > It's slower to deliver video since you're reliant on upload connections of e
161.
by remcob 8y ago
Filecoin[1] is doing that for storage+bandwidth and Golem is pursuing the CPU/GPU time idea. [1]: https://filecoin.io [2]: https://golem.network
162.
by remcob 8y ago
> The $40 million in penalties will be distributed to harmed investors under a court-approved process. Does that mean the people who got their shorts called? That is kind-of the opposite of being an investor. It would be odd if Tesla wou
163.
by remcob 8y ago
> not using encryption Not a viable option, this would allow anyone to intercept traffic. (To be fair, a lot of wifi routers are broken and will forward you all decrypted traffic from other users anyway on request. Try running WireShark
164.
by remcob 8y ago
My argument was purely theoretical. I fully agree that analog computers currently have more practically attainable advantages over digital computers. I'm also less confident than most people of quantum computers ever overcoming the pra
165.
by remcob 8y ago
But the converse is not true. The laws from Quantum Mechanics can not be derived from E&M. This means that the physics covered by QM is strictly larger than E&M. And as my former prof. R. Jozsa showed, this allows for Quantum algori
166.
by remcob 8y ago
> it compiles not to [...] a single intrinsic EVM opcode for "doing keccak256", Sorry, no. That is exactly what it compiles to. Opcode 0x20 (erroneously called SHA3) computes a keccak256. See the yellow paper. Maybe you meant S
167.
by remcob 8y ago
Some impressive work in this field has been done by Tel Aviv University. They where able to get private keys out of a laptop by merely touching the laptop [1] or placing a smartphone nearby [2]. [1]: http://www.tau.ac.il/~tr
168.
by remcob 8y ago
There is a software solution called blinding. The idea is to 1) scramble your input (message, private key) by multiplying with a random blinding factor, 2) do the crypto math and 3) divide out the random blinding factor. Since all the crypt
169.
by remcob 8y ago
Delay based congestion control is the basis of LEDBAT (RFC6817) as used by BitTorrent over UDP. The claimed advantage of LEDBAT is that it is submissive to TCP, instead of dominating like BBR. This allows BitTorrent to run in the background
170.
by remcob 8y ago
How about BB(BB(10000))? I would call that conventional means, well-defined notation, etc. And I can keep going in this direction, creating ever larger numbers. (In fact, if space permits, I could define this sequence and then take the BB(1
171.
by remcob 9y ago
If you add eye/focus tracking you can selectively render the part in focus in a higher resolution and use lower resolution for peripheral vision. The end result is that you are rendering at exactly the bandwidth that the human eye can
172.
Optimizing transaction settlement(medium.com)
2 points by remcob 9y ago|0 comments
173.
by remcob 9y ago
> Aren't there already things that do this? > Well, yes. There is a project called ditaa that has this functionality. Sort of. But it's written in Java [...] > So I reimplemented it in PHP. [...] Who wants to do the NodeJ
174.
by remcob 9y ago
IMU's are already used to increase the local accuracy of GPS. The problem is that due to double integration (acceleration -> velocity -> position) the errors accumulated badly.
175.
by remcob 9y ago
It would only work for walking planes. :)
176.
by remcob 9y ago
Optimizations based on language semantics (clang) and instruction selection (icc) should be quite complementary, so we could have a best-of-both compiler.
177.
by remcob 9y ago
It's notable that Colin Percival pioneered memory-hard key derivations functions with Scrypt for tarsnap. Scrypt became the proof-of-work function for asic-resistant cryptocurrencies suchs as Litecoin and influenced Ethereum's eth
178.
by remcob 9y ago
First example: x(x - k a) where x = b + 2c Now imagine ‘+’ and ‘-’ have side-effects, like a log message. What would the output be? ‘+-’, ‘++-’ or ‘+-+’? Certainly not the ‘-+’ order as they appear in the code, which is causally i
179.
by remcob 9y ago
For signing, both your private key and a random number k need to be kept secret. The process then involves scalar multiplication, modular inversion and two more multiplications — strictly more work than generating a key-pair.
180.
by remcob 9y ago
Generating the private key is the easy part; Just 77 rolls with a ten-sided die and re-try if it exceeds the prime. Or 256 coin flips, if you prefer binary. It is computing the public key that is so hard.

More ›