robryk @robryk@qoto.org

@moonbolt FYI this way of boosting is slightly different: if the original poster's server is blocking yours, then you'll see a boost of their post, but you won't see their post in the thread.

Not complaining, but wanted to let you know if e.g. someone confusedly asks you what you are boosting.

@arkadiusz_wieczorek Kiedyś słyszałem, że problem niewidocznych uszkodzeń był spowodowany kaskami z obudową plastikową przyklejoną do styropianu (bo mogła się odkleić w miejscu udrzenia i uczynić wgniecenie w styoropianie niewidocznym); w kaskach gdzie ten styropian jest robiony w formie zawierającej już "obudowę" ten problem ponoć miał nie występować. Czy to w miarę zgadza się z tym co wiesz? @kuba

@arkadiusz_wieczorek No właśnie. Dawanie ludziom mandatów za nieposiadanie kasków nie powoduje, że ludzie upuszczone kaski będą wymieniać. @kuba

@kuba Nie rozumiem, czemu naturalną reakcją na "ktoś się zabił robiąc X bez Y" jest "czy nie nakazać używania Y podczas robienia X i X'?" Trochę rozumiem takie podejście tylko w przypadku osób ubezwłasnowolnionych (w tym dzieci), bo wyznacza "minimalne standardy ostrożności" które wiążą ich opiekunów.

W pozostałych przypadkach nie rozumiem sensu produkowania obowiązku, którego niewypełnienie jest karane, bez względu na przyczynę. Będzie to raczej prowadziło do standardowego unikania policji i dawało częsty pretekst do mandatów. Jeśli chcemy spowodować, żeby jak najwięcej ludzi używalo Y, warto raczej spowodować, żeby nie było to bardzo utrudnione (wynajmuję hulajnogę: skąd wziąć kask?), albo uczynić łatwo dostępnymi informacje o tym czemu Y pomaga, jak Y używać, etc.

@timorl Huh? So who's actually marrying? Both of them?

@kuba W sensie †?

@freemo How would you measure the 15 weeks? (The IIUC standard approach of "since last period" would make it mean something like 11-15 in most cases.)

@kuba
TIL że utworzenie kopii pisma:

a) usuwa adresatów,
b) pozwala na użycie standardowej wyszukiwarki adresatów, nawet jeśli dane pismo ma własną.

@Makdaam

When it's raining, how much water in the air is in form of liquid compared with water in the of water vapor?

#riddle #physics #estimation

@enigmatico

> while encryption attempts to make everything look like completely random garbage

This is not true, as long as you aren't asking encryption not to increase the length of message. If you also ask for that, I agree.

> compression will only attempt to remove repetitions to decrease the size of the file.

_No_. Compression is trying to make size the smallest. If the probability distribution over the output is not uniform[1], you could make it even smaller. Granted, doing that will cost CPU time (on both compression and decompression side likely).

Have you tried any compression scheme that was optimized purely for compression ratio, as opposed to some "middle" point of the pareto frontier between ratio and (de)compression runtime performance? For example, winning entries of http://mattmahoney.net/dc/text.html

[1] In a way (if we ignore concerns of runtime performance), compression and prediction/modeling are the same problem: if we have a compressor, it provides us with a model of probabilities over inputs (it assigns probability 2^|comp(x)| where |y| is length of y). If we have a model that assigns probabilities, we can create a compression scheme such that |comp(x)| = log(p(x)) by the Kraft's inequality.

Obviously, that assumes that the logarithsm above are integers. That is an approximation that gets as close to equality as you wish by increasing the input length (more precisely, let's assume that the input is an i.i.d. sequence of symbols; then taking a long enough i.i.d sequence of symbols with the same distribution brings us arbitrarily close to equality there).

@enigmatico

This isn't really correct.

A well-compressed file will have the same property.

If I take an encrypted file and interleave it with zeroes, this is still a well-encrypted version of the original file (you decrypt by removing extraneous zeroes and doing original decryption). What you are saying is true for encryption that has ciphertexts of the same length as plaintexts.

std::borrow::Cow is a very useful way to provide a value that can be copied on demand _for types that can be cloned_. In many cases it would make sense to:
- for cloneable types accept Cow<T>,
- for other types accept T.

We could make this work with Cow<B>, using a very weird construct (have B be essentially equivalent to Infeasible, but implement ToOwned with Owned = the_type_we_want). Is there a less cumbersome way?

#rust

@niconiconi
Aside: It's surprising (at least to me) that ATM works (at some speed) over basically anything, for example over a salty wet string: https://www.revk.uk/2017/12/its-official-adsl-works-over-wet-string.html

@rogatywieszcz Strzelam, że ktoś publikuje listy do adblocka które to robią (bo nie ty jeden tego pewnie chcesz, a adblock jest bardzo naturalnym mechanizmem do tego celu).

Nawet masz wtedy gotowe interfejsy użytkownika do doblokowywania rzeczy, które zostały pominięte.

@juliank
Don't you get some pretty weird behaviour in such clients, given that all the copies of the same message are thought to be different messages by the client (e.g. when you read one of them, others remain unread until you sync)?

@djsumdog @wikihow

@juliank Uh... what's the difference between accessing and downloading? You mean clients that literally have no local cache at all?

@djsumdog @wikihow

@niconiconi I am tickled that the Russian "Start" button says "launch".