Looking at the schedule towards Tokyo for Monday, April 27th: Tokuyama has: 4 16 car Nozomi trains to Tokyo 19 8 car Kodoma/Sakura trains to Shin-Osaka 9 8 car Kodoma/Sakura to Okayama

Hamamatsu has: 31 16 car Kodoma to Tokyo 19 16 car Hikari to Tokyo

Keep in mind the fastest Kodoma seems to only take around 1 hr 40 mins to Tokyo, and the fastest Hikaru is only 1 hr 20 mins.

I'm sure it's nice getting a 1 seat ride to Tokyo from Tokuyama if you can get on one of the 4 Nozomis, and unfortunate you can't get a one seat ride past Shin-Osaka from Hanamatsu, but the service levels seem pretty proportionate to me.

[0] https://web.archive.org/web/20010111052400/http://www.csse.m...

[1] https://metacpan.org/release/DCONWAY/Lingua-Romana-Perligata...

This is in contrast to the original rowhammer attack, which issues accesses such that target rows are repeatedly opened and closed to trigger bitflips in neighboring rows.

By stretching out the row open time to 30ms (!), the authors claim they are able to reliably trigger bitflips with a single row opening in 13% of tested rows at 50°C[1]. Some rows in certain chips can be flipped with access times of under 10ms[2].

At more realistic row open times of 7.8 - 70us, there seems to be a 1/x relationship between row open time and number of activations required, they cumulative amount of time the row needs to be held open for to trigger a flip seems to remain fairly constant (around 50ms total from my very approximate estimations). Note that the attack needs to be executed in under 64 ms total, otherwise the automatic DRAM refresh will reset any progress made.

The authors demonstrate this attack with a userspace program that maps a 1 GB hugepage to be able to directly manipulate the lower 30 physical address bits[3], although they don't seem to provide the row open times they end up being able to achieve in practice.

The attack code itself: https://github.com/CMU-SAFARI/RowPress/blob/main/demonstrati...

https://arxiv.org/pdf/2306.17061.pdf [1] pg 5. obsv. 2 [2] pg 6. obsv. 6 [3] pg 11. sec 6.1

It's present in the uBlock Origin filter list settings under Annoyances but not enabled by default. HN readers may also find some of the other default disabled filter lists interesting such as the AdGuard URL Tracking Protection list which strips tracking parameters from URLs.

[0] https://easylist.to/#easylist-cookie-list

I don't believe TF2 has any sort of phone number system that I'm aware of. If there is one, it doesn't seem to function very well given the bot invasion over the last few years.

I can't speak to dota 2 as I've never played it.

[0] https://help.steampowered.com/en/faqs/view/00EF-D679-C76A-C1...

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

Points: 57

# Comments: 18

    fn process_file(p: Path) -> Result {
        let file = File::open(p)?; //Return err if file can't be opened
        let mut out = String::new();
        file.read_to_string(&mut out)?; // Return err if read fails
        out
    }

[0] https://doc.rust-lang.org/nightly/unstable-book/language-fea...

[1] https://github.com/rust-lang/rust/issues/31436

https://en.wikipedia.org/wiki/Unorganized_Borough%2C_Alaska

https://youtu.be/YIWFNVb7whk

https://en.wikipedia.org/w/index.php?title=Talk:Utah_monolit...?

While I believe that it would be better for society if the court sides with Google, I personally think that APIs can be a creative work, and thus would have copyright protection under the law. However one of Google's arguments is that Oracle is trying to use copyright to acquire a patent-like right, referencing the case of Baker v. Selden[0]. Despite being from 1879(!) I found this case to be especially relevant and I'm quite interested to see how the court will consider it into their opinion.

In his arguments, Oracle's lawyer argues that declaring code is not distinguishable from implementing code and thus deserves all the same copyright protections. As a programmer I find this argument quite unconvincing, as there is clearly a technical distinction in many systems, see: .h files, dynamic linking, etc.

[0] https://en.wikipedia.org/wiki/Baker_v._Selden

This isn't the case, there are tracing garbage collectors implemented as libraries [1][2], and there is consideration being made for supporting tracing GC in the language and stdlib [0]. As well as reference counted GC having been available in stdlib for a long time [3] (similar to C++'s std::shared_ptr)

[0] https://github.com/rust-lang/rfcs/blob/master/text/1398-kind...

[1] https://manishearth.github.io/blog/2016/08/18/gc-support-in-...

[2] https://boats.gitlab.io/blog/post/shifgrethor-i/

[3] https://doc.rust-lang.org/std/rc/index.html

Such as in your elevator example, make it so that the operation of the elevator is tested with a heavy load approaching the desired safety factor, and evaluating the performance under this heavier than normal load? The idea being that the only way to "cheat" is to design a better elevator that can still meet the requirements.

Of course the reason this isn't done is because of the extra cost of performing a more comprehensive test, but given how much students are paying for education, surely we could make some improvements over the status quo.

I can't help but draw comparisons to SpaceX's starship development process vs that of the more traditional aerospace manufacturers. There isn't any way for the engineers to cheat because their work is tested under the target conditions and either passes[0] or fails[1][2]. The goal being to achieve the most efficient design that still meets requirements.

[0] https://twitter.com/elonmusk/status/1259344535991140352

[1] https://www.youtube.com/watch?v=QlDBjHa0NkU

[2] https://www.youtube.com/watch?v=wFXQ5SRCy74

[0]https://www.raptorcs.com/content/BK1B01/intro.html

However from the comments here it seems to be less involved than that to get past the challenge, does anyone else know what the actual test is?