https://m.youtube.com/watch?v=-VfYjPzj1Xw

I did not know that and could not find anythimg online do you mind posting a link with more Info?

mail.proton.me

mailbox.org

Would be my choices

Another win for c# (they call it SpecFlow there).

In all seriousness, cucumber/SpecFlow is an awsome testing suite!

Whrere are you from?

Because in Germany it is really common.

I have been looking for a new contract for a while now, because my dsl is shit (thanks to my landlord). But all new cable contracts I can find are NATed (ecxept buisness contracts).

Fair, it is a lot harder, but possible (you could vpn your traffick through a vps). Actually one of the reasons I have not changed my terribly slow contract yet.

Not necessairly. In Germany CGNAT is quite common. So if one of OPs devices routes via IPv4, the traffic will be routed to the carriers public facing router. I would not consider that local as it physically leaves the cables you control.

Does your provider give you yoir own (not necessairly fixed, jus no one else having it simultaniously) IPv4-Address? Some keywords to look out for wrt that are NAT, or DS(dual stack)-lite.

Basically the traffic goes all the way out to whatever device has that public IP. It then is routed back.

This would be a problem if OP has a provider who NATed him (which is quite common where he is from), right?

Bow tie looks better imo

I think I was a bit unclear on that, I meant uncompressed rips as in I ripped the relevant media to unkompressed mkvs, I didn’t save the entire disk dump. I also have mostly such rips, but also a bit of media from other sourches ™ which is already compressed. So I suspect my results would be even worse.

Thank you, I didn’t know that, but that was the type of answer I was looking for :D.

I only ripped the relevant media anyways, so no trailers to remove.

A bit offtopic: What theme is that? I was woundering why you would put windows screenshots under a comment about dolphin for a second.

Really? My banks use the best 2fa I’ve seen so far. You have a card-reader which generates a code based on some input values related to the transaction and the physical chip on my bank-card.

(Although they have been pushing PuhsTan (app on phone) a lot recently :/)

I miss tom scot videos

why couldn’t you compute p/q < r/s by checking ps < rq?

That’s what I meant by scaling the fractions. Tbh I kind of forgot that was an option and when I remembered I had allready written the part about comparing floats so I just left it in. But yeah, encoding lengh might be a killer there.

You could also avoid reducing fractions the same way. Like I don’t neecessairly need my fractions to be reduced, if I am just doing a few equality comparisons per fraction. Of course I would have to reduce them at some point to avoid exceding the encoding lentgh in the enumerator and denominator when there is a representation with a short enough encoding available.

I think the bigger problem might be the missing usecases. As another user mentioned, this would still only encode rationals perfectly (assuming no limit on encoding lengh). But I cannot see many usecases where having rationals encoded percisely, but irrationals still with an error is that usefull. Especially considering the cost.

maybe we could solve this by prohibiting the end user from adding or multiplying numbers

I genuently chuckled, thanks :).

It does not even imitate all rationals. For example 1/3.

I’ assume its because implemenring comparisons can’t be done efficiently.

You’d either have to reduce a fraction every time you perform an operation. That would essentially require computing at least one prime decomposition (and the try to divide rhe other number by each prime factor) but thats just fucking expensive. And even that would just give you a quick equality check. For comparing numbers wrt </> you’d then have to actually compute the floating point number with enough percesion or scale the fractions which could easily lead to owerflows (comparing intmax/1 and 1/intmax would amount to comparing intmax^2/intmax to 1/intmax. The emcodinglengh required to store intmax^2 would be twice that of a normal int… Plus you’d have to perform that huge multiplication). But what do you consider enough? For two numbers which are essentially the same except a small epsilon you’d need infinite percision to determine their order. So would that standard then say they are equal even though they aren’t exectly? If so what would be the minimal percision (that makes sense for every concievable case? If not, would you accept the comparison function having an essentially unbounded running time (wrt to a fixed encoding lengh)? Or would you allow a number to be neither smaller, nor bigger, nor equal to another number?

Edit: apparently some languages still have it: https://pkg.go.dev/math/big#Rat

FinalFinalProject_2(new)(final).doc

I googled around a bit and it seems the main concern is being seperate sowftware-wise, not mainly location wise (although thats a nice side effect). So mainly avoiding fun stuff like https://m.slashdot.org/story/112253.