Hacker Newsnew | past | comments | ask | show | jobs | submit | mhei's commentslogin

In this context, SLA = Stereolithography


I wonder if they actually trained Cheetah on a different or the same dataset they are benchmarking on.


Thanks for comment. We don't train on the dataset being tested on. I am fairly certain the other engines don't as well.


Try "make foo" instead of "make"


Ah, that works!


(Rot13 as not to spoil the riddle)

Ubj nobhg n grgenurqeba? Begubtencuvp cebwrpgvba nybat gur yvar pbaarpgvat nal rqtr zvqcbvag gb gur bccbfvgr rqtr zvqcbvag tvirf n fdhner, lvryqvat 3 fhpu cebwrpgvbaf (cyhf gurve bccbfvgr pbhagrecnegf). Abg fher vs gurer ner bgure fhpu funcrf (vtabevat gevivny zbqvsvpngvbaf bs gur grgenurqeba) - qvq lbh znantr gb svther guvf cneg bhg?


A tetrahedron looks like a square from three orthogonal directions, same as a cube. It's possible to get more.


I'm thoroughly impressed by your geometric abilities! I didn't know that, and took me a while to check. Any hints on the puzzle, and as a sidequestion, what tools do you use to figure this kind of question? Just imagination, vector algebra, elementary trigonometry?


Huh? There's nothing to be impressed about. You can stick a tetrahedron inside a cube so it creates the same square shadows in all three directions: https://i.stack.imgur.com/oAUnH.gif

I know a lot of math, but for this puzzle, drawing stuff on paper is enough. Here's a hint: if you cut off one corner of the cube, all shadows are still square. How much can you cut? Can you cut some corners strategically to make at least one new square shadow while keeping all the old ones? How many square shadows can you get?



Could it help to have a point-like light source from a good angle that gives you a sharp shadow? Then it may be possible to judge distance based on the distance between the tip and its shadow.


Haven't thought of that. I will investigate, thanks for the tip!


second to last paragraph:

> All tests were run on both ubuntu 17.04, 4.10.0-37, as well as on arch, 4.12.8-2. We got the same results on both machines.


That wasn't there half an hour ago :-).

That LWN article was from June 2017 and 4.10 was released in February, so I think that means these tests predate any of the changes it discusses.


Arch linux 4.12.8-2 came out in August.


I feel the pagination method demonstrated here is advantageous in that regard, eliminating vertical motion while allowing to see parts of two "pages" at the same time:

http://www.magicscroll.net/

I would love to have that on my ebook reader, may need to hack that together some time to try. I dislike switching back and forth between two pages as is sometimes necessary; in this regard, this even seems better to me than a regular book.


Or possibly the other way round? 0hh1.com was registered in 2014 according to whois info, the puzzles on this site go back to 2011. (I'm not claiming this is proof, of course)


They're older than that, this kind of puzzle is called a Takuzu or Binairo and was invented in 2009 by a pair of Belgians: https://fr.wikipedia.org/wiki/Takuzu


Also, the list of puzzles on the site goes to March 2011.

I think this is a nice case of taking something interesting and making it more approachable, perhaps even fun.


The problematic patch only seems to be introduced in mainline 4.2, not 3.19, compare:

http://lxr.free-electrons.com/source/net/core/datagram.c?v=3...

http://lxr.free-electrons.com/source/net/core/datagram.c?v=4...

http://lxr.free-electrons.com/source/net/core/datagram.c?v=4...

I am just trying to completely understand the bug, I wonder if it really was unexploitable before the patch. Got any source for that?

EDIT: sorry, misunderstood your message / mixed up commits, I was looking into when 89c22d8c3b27 hit mainline, which causes the vulnerable code path.


Why "problematic"? The Al Viro change mentioned in the fix is https://github.com/torvalds/linux/commit/227158db160449b6513.... The commit says this makes the bug not exploitable since the new helper function handles correctly the edge case. The fix still needs to be applied to avoid computing the checksum twice.


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: