Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
archgoon
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
28 ms
·
211.
▲
by
archgoon
7y ago
It has fallen into disuse in Seattle.
212.
▲
by
archgoon
7y ago
> But even Macron wants to reduce nuclear % in power production of France. What? Why?
213.
▲
Montgomery Curve
(en.wikipedia.org)
3 points
by
archgoon
7y ago
|
0 comments
214.
▲
by
archgoon
7y ago
JS Standards compliant implementations of some math functions: https://tc39.es/ecma262/#sec-math.sin function sin(x) { if (x == -Infinity || x == Infinity) return NaN; return x; } function cos(x) {
215.
▲
by
archgoon
7y ago
Mahdi Bahrami is the developer of the game Engare, a puzzle game where you must reproduce mathematical curves using the trajectory of points on moving objects. https://en.wikipedia.org/wiki/Engare https://ww
216.
▲
by
archgoon
7y ago
They're up!
217.
▲
by
archgoon
7y ago
Odd that the client is written in C, but the server in go. I'm curious as to why the author chose to do that (along with the artisan buffer implementation).
218.
▲
by
archgoon
7y ago
There isn't that much boilerplate with pygame (I've taught middleschool students pygame in the past); I'm not sure if it makes sense to move things into a framework, and have a lot of configuration by convention, when the goa
219.
▲
by
archgoon
7y ago
There is a bit of irony here; as the article mentions, the RSA key that windows uses for updates is safe. Why is that ironic? Well, Trail of Bits also published this article last year: https://blog.trailofbits.com/2019/
220.
▲
by
archgoon
7y ago
So, it sounds like (please correct me if I misunderstood something) the issue is: # cache signing objects and get chain cache, chain = parse_chain_from_cert(full_cert) root = chain[-1] validate_root_authenticity(root) # go up
221.
▲
Exploiting the Windows Cryptoapi Vulnerability
(blog.trailofbits.com)
117 points
by
archgoon
7y ago
|
45 comments
222.
▲
by
archgoon
7y ago
>However, for extreme RSA key sizes (e.g. 4096 bit) NewHope does actually outperform RSA. Yep, it's definitely a scaling thing. If it weren't then we could simply use Daniel Bernstein's (et al) proposal for Post Quantum RS
223.
▲
by
archgoon
7y ago
> Microprocessors reached that high MOS transistor count less than 10 years ago. Note however that quantum computers can potentially benefit from existing lithography processes, so it may not take as long to scale up as we have already d
224.
▲
by
archgoon
7y ago
Sufficiently few that it is beginning to be said by a small number of physicists that it is a point of embarrassment that the Measurement Problem is about as unresolved as when it first came up a hundred years ago. https://www.ny
225.
▲
by
archgoon
7y ago
Haven't looked at the full implementation of BigCache, but typically, a cache would fetch the object and key from the data structure. If the full key doesn't match the requested key, then the cache will respond that the key is not
226.
▲
by
archgoon
7y ago
This will probably get much more traction once an independent group confirms it. I don't believe this article presents any new information on X17 that we haven't already heard.
227.
▲
by
archgoon
7y ago
shuf -n 4 /usr/share/dict/words | tr '\n' ' ' && echo
228.
▲
by
archgoon
7y ago
If you get "tr: Illegal byte sequence" you can prepend 'LC_ALL=C ' before the 'tr' to prevent tr from trying to treat the stream as a unicode sequence.
229.
▲
by
archgoon
7y ago
This would seem to be consistent with the presented data; the bulk of the increase is in the West and Midwest (which I believe picked up a fair amount of the smoke from the fires). The Northeast and South are mostly the same. The article su
230.
▲
by
archgoon
7y ago
> So quantum computing is expected to based on Bra-ket notation? In that case, is it simply based on linear algebra and statistical sampling? Yes. You can simulate a 53 qubit quantum computer with a 2^53 complexed valued vector as input
231.
▲
by
archgoon
7y ago
No. Even if Amazon had worked out an agreement with Google to run arbitrary algorithms on a 53 qubit computer; that would not be enough to run Shors algorithm (which only breaks RSA and Elliptic Curve) on normal keys. This is also pretendin
232.
▲
by
archgoon
7y ago
I'm pretty sure the hard part is still actually building said computers to run on.
233.
▲
by
archgoon
7y ago
Accessibility is a big issue; I'm unsure if imgui has support for that or if it will work with the browsers built-in support for that.
234.
▲
by
archgoon
7y ago
What prevents you from having a build server that uses AMD cpus? Budget or physical space limitations? Power consumption concerns? Too complicated to have different build and test boxes? Large binary and debug symbols that would result in n
235.
▲
by
archgoon
7y ago
Has happened though; Niantic for example.
236.
▲
by
archgoon
7y ago
This seems more like a signal/noise pollution problem. Which also means that false things are harder to correct. Showing something that is blatantly false is much harder when all information sources become jammed.
237.
▲
by
archgoon
7y ago
I remember a decade or so ago, the only way for me to figure out certain material values (this was material science / electrical engineering / chemistry) was to open up MSPaint and manually draw lines on chart data to find interce
238.
▲
If I Touched the Moon, What Would It Feel Like?
(nytimes.com)
1 points
by
archgoon
7y ago
|
0 comments
239.
▲
by
archgoon
7y ago
"But the 2013 Snowden revelations damaged that tenuous relationship yet again. In hindsight the damage wasn’t the result of what the United States was doing, but over the Pentagon’s inability and unwillingness to own up to why it was d
240.
▲
by
archgoon
7y ago
To be fair; in cattle at least, "shits and giggles" is not an entirely inaccurate description of methane production.
More ›