Here is a parallel argument for you. The history of science has been one discovery after another which leaves us with new, increasingly complex unanswered questions about phenomena. It is reasonable to think that if/when we reduce consciousness through science we will find that there are more increasingly complex unanswered metaphysical gaps.

This has to be one of the most dumbfounding pseudo-philosophical sentences I've ever read. Metaphysics by definition is unfalsifiable and unscientific; it exists on a parallel plane from empiricism and is derived only through intuition, reason, and for the religious revelation. If this guy's claim for material consciousness simply rests on an intuitive argument from induction, it suffices as a counter argument to say "If I am mistaken, I am".

Bambu absolutely could create a system where their printers both communicate with the cloud and local devices, they just don't want to do the difficult software engineering necessary because it is difficult. This is not theoretical either; I work on production devices with hybrid cloud and local functionality. Engineering around a zero-trust threat model (as in you assume the user can and will tamper with the device) is completely doable.

For instance, using a push-only RPC model where only the cloud can initiate a request is one zero-trust strategy that can be used for ensuring a predictable network load on cloud infrastructure, which seems to be their main concern.

Comments URL: https://news.ycombinator.com/item?id=47914027

Points: 3

# Comments: 0

spf_avg = alpha * cur_spf + (1.0f - alpha) * spf_avg;

For alpha value you can use the formula:

alpha = 2/(n+1)

Which will give smoothing comparable to an n sample moving average. This is the same formula used for n-day exponential moving averages for stocks.

As the article points out, this is a sample based window which is not as good as a time based window, but it's also dead simple to implement.

Edit:

Just spit balling because I haven't thought about this problem in a while and asked AI to give a foruma for EMA with variable duration events, so take it with a grain of salt. Maybe for a time based window you could use a dynamic alpha (forgetting factor) with the following formula:

alpha = 1-e^-(cur_spf/window_secs)

I can completely understand using Tailscale for enterprise networks, but it seems very overengineered for my personal VPN needs.

Edit: Noticed some sibling comments asking effectively the same thing as me. I've been meaning to write a blog post covering the basic networking knowledge needed to DIY with just Wiregaurd. My impression is that many people don't realize just how easy it is or don't have the requisite background information.

I struggle to see the point of your comment. The blog post in question does not say that the paper in question claims to be faster in practice. It simply is examining if the new algorithm has any application in network routing; what is wrong with that?

Did you even read the document? Claiming that Wikipedia has implemented all of these suggestions in the past is just plainly false. If you disagree with the documents contents, why don't you provide a substantive argument instead of just belittling efforts at changing the status quo?