To clarify, this is the "Verifying your connection is secure" captcha before the site is even displayed, not a reCAPTCHA after the site is loaded.

I've tried clean browser profiles with no difference, on my normal profile I just use uBlock, Tree Style Tabs (FF)/Tabs Outliner (Chrome), and Tampermonkey for some sites (but not the ones affected by the captcha loop, in this case).

It seems that Cloudflare increased some kind of proof of work level in their captchas around the start of this week, since every time one shows up it drains all of my CPU for 20 seconds before giving up and looping, or occasionally, after 10 minutes of refreshing and redoing the captcha, letting me through.

It doesn't even have the decency to ask for an interactive challenge after clicking the checkbox, it just wastes CPU cycles... I'm sure the real bots love that.

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

Points: 3

# Comments: 4

[1]: https://gynvael.coldwind.pl/?id=754

Causing memory leaks is possible in safe Rust even without any arcane invocations, you can construct a cycle of Rc counted objects. There's even a perfectly safe Box::leak in the standard library that gives you a &'static reference to any object by leaking it. Preventing leaks is outside of the scope of Rust's safety system.

I don't find either style better than the other, the only time I notice anything is when I switch between style conventions (e.g. switch between JS and Rust or C++), because I need to break the habit of typing one way rather than the other.

Still, I find readability of the two styles pretty much identical at all times once you get used to both.

Day 4 strongly reminds me of the True Lab music from the Undertale soundtrack [1].

[1]: https://www.youtube.com/watch?v=y49b8aiQVBg - Undertale OST: 83 - Here We Are

Coverage guided QuickCheck has been on my mind for a while, I believe it would greatly improve fuzzing experience and allow to easily and thoughroughly check/fuzz things that aren't parsers/decoders/deserializers or functions that operate on strings in general.

With IPFS, you can effortlessly link from one tree to another, already existing tree.

In BitTorrent, you have to include a .torrent file, or an infohash in some file, but no software that I know of will easily follow that link.

This linking ability is an extremely useful property, that allows you to cheaply create a copy of a merkle tree, with a subset of the data replaced. The tree will operate identically to one created from scratch.

You also don't need to hold all the data to "patch" the tree, which I imagine is useful in this Hadoop filesystem.

Unfortunately there is no real API for operating on torrents. You could say WebTorrent is pushing in the right direction to fix this, but there doesn't seem to be much adoption for it.

The existing IPFS implementation involves a lot of overhead in memory, CPU use, and latency [and as you can see in the MapReduce bar graph, it's slower], but overall, it improves performance when bandwidth is the bottleneck.

IPFS is pretty similar to BitTorrent, just more practical.

Essentially:

    function do_something() {
      if (true) {
        var x = 42;
        let y = 42;
      }
      console.log(x); // 42
      console.log(y); // Reference error: y is not defined
    }

    for (var i = 0; i < 5; i++) {
      setTimeout(function () { console.log(i); }); // => 5, 5, 5, 5, 5
    }

    for (let i = 0; i < 5; i++) {
      setTimeout(function () { console.log(i); }); // => 0, 1, 2, 3, 4
    }

Googling is ineffective due to an NES game called Mappy.

All the HTML takes 2-4 kB on average, but you might not get much use from the site in a terminal :)

[1]: https://apod.nasa.gov/apod/archivepix.html

  1/10 m -> 0.1 / m
  1|10 m -> 0.1 m
  27 ^ 2/3 -> 243
  27 ^ 2|3 -> 9