sflanker

This is a totally different class of software than what that post is ranting about. Charles is a local developer tool intended for temporary use when debugging. It only inspects TLS connections if 1) you enable that feature and 2) you add the domain being connected to the list to be inspected.

That being said, the mechanism is the same. Charles generates a root certificate that it uses to issue certificates for each domain in intercepts a TLS connection for and you need to install that root certificate in your OS such that your clients will trust that certificate. If you have a client that doesn’t use the Mac OS certificate store you may have to do some extra per client configuration.

I also despise “security” tools that intercept and inspect TLS traffic (such as ZAcaler for example), but I find a Charles to be very useful for what it does and the TLS inspection support is easy to use and really helpful/necessary in some cases.

The main link for this post doesn’t make sense. This might’ve better suited for a Show HN type post.

Presumably she is young enough to have completely missed out on Myst, which will be very dated now but was groundbreaking at the time and is most definitely a work of art.

These puzzle games are all very distinctive and beautiful in my opinion:

- Limbo - Manifold Garden - Monument Valley

I think on its face the question “can video games be art?” Is both absurd and obviously answered. The question are their games your partner will enjoy playing and want to spend time on is obviously totally different.

The EU’s oppressive regulations are based an absurd lack of understanding of how technology works. If consumers find an aspect of the protocol bothersome they have the power to use a browser or extension that makes it possible to block or disable it. We do not need a nanny state government imposing fines and threats on legitimate well intentioned websites. IMHO: Good riddance to this broken regulation.

Same. I find perplexity to be much better for researching technical topics than Google or other classical search engines. I have only had occasional accuracy issues (like it suggesting something from a feature request that hasn’t been implemented rather than official documentation), but the reference links makes it easy to verify.

Tangentially interesting: while leveraging Perplexity to try and find the blog post in question this post and your StackOverflow question already pollute the results it draws from and causes it to abort any more detailed search for such a blog post. I find this mildly amusing.

Oh duh, this is inherent in binary counting. When y is equal to one any even x will be a zero. The when y is equal to 2 you get groups of zeros two at a time 0, 1; 4, 5; 8, 9; etc. The pattern repeats in lengthening, self similar way as the values of y increase leaving ever lager gaps and sequences of zeros (with the top edges of the triangles corresponding to powers of two, which give long sequences of zeros or non zeros respectively.

I always think of this pattern geometrically so it’s weird to see it pop out in simple math.

If somebody can explain why bitwise ands generate serpinski triangles I would sure like to know.

(y * 4 & x *4) % (frameCount / 10 % 300)