nonsecret traffic is a great band or album name |
| |
15054. scene (87.121.72.23) –
Yesterday 18:06:31
[ 2025 BEGONE! ]
Tom, if I were to insert an inspirational quote from you into my paper, what would you choose? |
| |
15053. Paul Brauner (212.51.151.177) –
06 Jan 11:59:58
[ 2025 BEGONE! ]
Get well and keep the surprise videos coming! |
| |
Also, paging through the comments again I see several old friends wanting to play on their Mac computers that aren't 15 years old. The I do care about this, but I don't have any access to a Mac that I can use for this kind of thing, and the OS X build has always been mysterious to me. I will give it a shot (VMWare?) when I have time to work on Escape, though. |
| |
Tom, I can confirm that the server seems to be working now. Thank you for your work debugging the issue. |
| |
noname: Thanks for the bug report! Seems I made a mistake when migrating to a new server. New uploads were being stored in the wrong place. I think it should be working now (I saw what you saw and now it works for me).
Glad to see people still playing this game! 30 years this summer, if we survive that long. |
| |
Anon: Secrecy is certainly sometimes important, and I agree that having a lot of encrypted traffic does normalize it, which is good! My main beef has to do with the certificate management and complexity of a constantly moving target. I wish it were more like SSH where I could just turn it on in a totally self-sufficient way (e.g. self-signed certificates). I understand the issues with MITM, etc., of course.
LRT: Yes, I enjoyed Blasphemous! #2 is on the list. |
| |
15048. Leak (86.56.190.147) –
01 Jan 08:30:07
[ 2025 BEGONE! ]
Get better, hopefully in a un-complicated way! :) |
| |
15047. My Computer (162.199.147.155) –
31 Dec 2025 21:43:28
[ 2025 BEGONE! ]
Get well soon! |
| |
I played through Blasphemous and Blasphemous 2 recently. Very good combat and pretty good Metroidvania. Probably more Vania than Metroid, but the combat is extremely fun. |
| |
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 |
| |
|
|
| |
15040. A.Hadidi (141.225.245.92) –
12 Dec 2025 16:34:04
[ And now I am 46 ]
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 :) |
| |