it's pretty good that the majority of traffic, even to non-secret sites, is TLSed though, right? because it makes "secret"/"nonsecret" traffic inseparable to all the fallible intermediaries (ISPs both near and far, network monitoring, guy MitM-ing your hotel wifi, etc) i mean, i imagine if enough publicly accessible resources were still available over HTTP, your local wifi operator could firewall whitelist port 80 and only let cleartext through while still providing a usable Internet, and boom, there goes any hope of secrecy at the presentation level :(
also, woah, your own http server?! exciting :o |
| |
New video at "https://www.youtube.com/watch?v=4pG8_bWpmaE" |
| |
|
|
| |
Still a fan 15 years later |
| |
|
|
| |
I was thinking about this nopert problem. One thing that I have not seen mentioned is if you could use the difference between the area of the polygon's largest and smallest possible "shadow".
For example, in the case of the sphere (Not a polygon) the smallest and largest shadows are exactly the same size. Where as in the case of a cube there is quite a significant difference between the areas of the largest and smallest shadows.
Could this property be employed to find new noperts or at least approach the problem differently.
For example I know that there are Curves of constant width. They roll like a sphere, but aren't a sphere. are there polygons of constant "shadow" area or at least something close to that.
It would seem trivial to me that IF a polygon has constant "shadow" area then it HAS to be nopert. You cannot have two different projections that have the same area AND have one "fit" inside the other.
I would imagine that it's impossible to have a polygon of constant "shadow" area... But I don't think I can prove it. If it's impossible how close do some of these potential noperts get? |
| |
In case my previous message is too vague, here is what I did after uploaded two levels to triage:
I chose "4 Get new levels from internet." from the main menu, then chose
"Update Now." After some time, a popup appeared with the following message in red font: "Unable to complete update of triage." The lower left corner of the screen showed the following in small red fonts: "unable to download
lev4167.esx <hash> (Error!)" where <hash> is the hash of the level. After dismissing the popup (and the other popup which follows), I found that triage has not be updated.
(I'm using escape 201609050 on Windows 11)
|
| |
I agree it's not a conspiracy, but I did install the newest LTS version! Maybe this is the wrong strategy, but I truly don't understand why they are so conservative with the compiler releases. The language already makes such a fuss about the ABI compatibility, and I think the compiler releases tend to have a high standard for correctness. Even on Windows (msys2) I'm on clang 21.1 without doing anything special.
I'm definitely getting into Blue Prince! I'm sort of in yarn wall territory now but I haven't looked anything up. Hopefully something on my short list of remaining theories will pan out, though... |
| |
I have just uploaded two levels to triage, but it seems that I cannot download them. Tom, can you have a look? |
| |
Blue Prince is a gem. Have a great time, and happy holidays! |
| |
Can't wait for the new video! |
| |
YOOO have fun with Blue Prince, I had to drop it when i started taping notes to my wall. I recommend getting an app that you can drop screenshots into and draw over and write yourself notes. Its easier to pick up on more interesting puzzles when you have all the relevant info at your fingertips. |
| |
GCC 15 is only 7 months old; if you're getting 13, you chose an Ubuntu release that's 18 months old. The two releases after that have 14 and 15 respectively. It's not a conspiracy to deprive you of new compilers. |
| |
Thank you Anon! I found you a few years later. :)
I'm here testing in 2025 that the new server works.
UTF-8 everywhere! |
| |
Good luck on completion! It was worth it, for one thing because I feel no further desire to play the game any more now :) |
| |
very pleased to discover silksong-completion.info from this post. |
| |
I would just use Google with like site:radar.spacebar.org to search it! |
| |
Is there an easy way to search your web blog? I'm wanting to find the article where you ranted about git. |
| |
History is written by those who name shapes |
| |
Also featuring David's animation:
https://www.quantamagazine.org/first-shape-found-that-cant-pass-through-itself-20251024/ |
| |
HB Tom! –pun cracked me up. |
| |
@Scott I can't believe they would insult him by referring to him as a mere software engineer at Google, instead of "Critically acclaimed and academically lauded SIGBOVIK author and core contributor at The Association for Computational Heresy" |
| |
Tom spotting!
"It’s natural to wonder which other shapes have [Rupert's] property. 'I think of this problem as being quite canonical,' said Tom Murphy, a software engineer at Google who has explored the question extensively in his free time. It 'would have gotten rediscovered and rediscovered — aliens would have come to this one.'"
https://www.quantamagazine.org/first-shape-found-that-cant-pass-through-itself-20251024/ |
| |
Nice Anonymous: I don't know where the dry salt bed comes from, but http://radar.spacebar.org/f/a/weblog/comment/1/1201 already calls it traditional. |
| |
15021. Nice Anonymous (ok, actually just Scott) (135.180.35.252) –
10 Oct 04:09:47
[ And now I am 46 ]
Happy birthday! I loved the video, but over the course of this journey I got surprisingly attached to the snub cube, and I'm sad not to know whether our snub cube buddy is in fact Rupert or Nopert. Also unsure if the dry salt bed is just a delightful non sequitur or callback to a previous Tom project I missed. I did somehow overlook Harder Drive until now... must not have been checking your blog that spring. So that was an unexpected bonus to find. |
| |