shiftingleft

7 ms·

31.
by shiftingleft 4y ago
Not much if you adjust the ISA for it! https://arxiv.org/abs/2007.15919 This paper adds (more or less) a really big branch delay slot to fill the cpu with work while it's waiting for the branch to resolve. Impossi
32.
by shiftingleft 4y ago
How much faster than the speed of light are we going here
33.
by shiftingleft 4y ago
"Mozilla: The DID Core spec has not demonstrated any degree of practical interoperability, instead delegating that to a registry of 50+ methods. The DID architectural approach appears to encourage divergence rather than conv
34.
Mozilla and Google Objections Overruled on “Decentralized Identifiers” by W3C(w3.org)
289 points by shiftingleft 4y ago|187 comments
35.
by shiftingleft 4y ago
Yes, it's great to see the adoption increase!
36.
by shiftingleft 4y ago
Monero has some limited form of privacy that's fairly good in practice: you can't determine which of N accounts is the origin of a transaction, where N is some fixed small number (6 in Monero I believe).
37.
by shiftingleft 5y ago
may i ask; why is your own location data so useful to you?
38.
by shiftingleft 5y ago
Does the M1 Ultra use a chiplet design like the Ryzen series? Otherwise the yields have to be awful.
39.
by shiftingleft 5y ago
> I also haven't seen any work of his using ML, that may just be a buzzword thrown in the PR release. The first article you reference includes something about Support Vector Machines (SVMs).
40.
by shiftingleft 5y ago
> but it’s solved for most by a combination of just using the same passwords That's not what I'd call a "solution"
41.
by shiftingleft 5y ago
what's the advantage of this over existing systems?
42.
by shiftingleft 5y ago
Is there any advantage over existing systems either for the lender or the debtor?
43.
by shiftingleft 6y ago
Archived version: https://web.archive.org/web/20210129191423/https://learn.rob...
44.
by shiftingleft 6y ago
Germany uses ~30% Coal in its energy mix, France less than 2%. Your argument is misleading at best, and targeted misinformation at worst. Since you've repeated the same argument at least 5 times by now, even though others have informed
45.
by shiftingleft 6y ago
Oh, yeah. I can't imagine publishing the entire source code of your entire stack even being possible. What if you have some 3rd party vendor software in there? Are you required to publish their source too?
46.
by shiftingleft 6y ago
I haven't informed myself too much so please call out if/where I'm wrong. In my mind the super quick version of this entire thing seems to be: - GPL requires you to publicize your changes if you distribute the software. - SSP
47.
by shiftingleft 6y ago
WhatsApp also loses all e2e guarantees in the process. WhatsApp backups are not encrypted. Signal on Android does support encrypted backups, however they're not automatically synced with anything. I think on iOS there's a differen
48.
by shiftingleft 6y ago
I think we're talking about different things. I would be interested in a way based on coding theory that solves the problem in the blog-post. Something of a form similar to this one would be a solution to me: def find_missing_numbe
49.
by shiftingleft 6y ago
Thanks a lot for the detailed answer! I'm familiar with some subset of coding and number theory, so you can assume at least some more knowledge (Galois Fields, or basics of RS codes for example). Small nitpick: The Vandermonde matrix a
50.
by shiftingleft 6y ago
Ah, do you mean that solving the problem described in the blog-post helps actually using erasure coding, since it requires knowing which parts are missing?
51.
by shiftingleft 6y ago
You probably mean O(1). Although: that's not true for arbitrarily sized integers either. Multiplication in O(1) implies P = NP (which further implies NP = PSPACE): https://cs.stackexchange.com/a/1661/129151
52.
by shiftingleft 6y ago
I don't see how the problem corresponds to erasure coding. Typically in erasure coding you know the locations of the erasures. Here, you don't know the location. Maybe you can elaborate on how it relates to erasure coding?
53.
by shiftingleft 6y ago
I think in erasure coding you typically know the locations of the erasures: If a disk fails, you know which one failed. However, I don't see how you would know the locations in this problem? Maybe you can elaborate on how this problem
54.
by shiftingleft 6y ago
Could you share a source about register allocation describing optimizations such as the one you described?
55.
by shiftingleft 6y ago
Your note is very important, I think it would be good to give it more emphasis. What works flawlessly, however, is: In [1]: a = None In [2]: b = 0 In [3]: (a is None) ^ (b is None) Out[3]: True Alternatively, as suggested in an
56.
by shiftingleft 6y ago
I think this is a fair assessment, and would like to add that the "time to first plot" is also quite the usability issue. Julia is using LLVM for code-gen has to compile a lot of code before you can actually use stuff like plots.
57.
by shiftingleft 6y ago
I guess whether it's effective to migrate a code base depends a lot on where your costs are. If you pay 500k$ for compute, it might become worthwhile to invest time into rewriting hot paths.
58.
by shiftingleft 6y ago
Quite sad actually
59.
by shiftingleft 6y ago
The Great Filter thesis is that there has to be one or more very low probability events in the Drake Equation. However, as per my other comments, you can update the distributions of your parameters in different ways, such that none of the
60.
by shiftingleft 6y ago
Yeah - but they don't have to be much smaller. Let's use the simple example you reference from the paper. If we just use the mean as point estimates, then indeed we obtain an extremely low probability that there's no other

More ›