this post was submitted on 26 Dec 2024
221 points (98.7% liked)
Asklemmy
44205 readers
1050 users here now
A loosely moderated place to ask open-ended questions
Search asklemmy π
If your post meets the following criteria, it's welcome here!
- Open-ended question
- Not offensive: at this point, we do not have the bandwidth to moderate overtly political discussions. Assume best intent and be excellent to each other.
- Not regarding using or support for Lemmy: context, see the list of support communities and tools for finding communities below
- Not ad nauseam inducing: please make sure it is a question that would be new to most members
- An actual topic of discussion
Looking for support?
Looking for a community?
- Lemmyverse: community search
- sub.rehab: maps old subreddits to fediverse options, marks official as such
- [email protected]: a community for finding communities
~Icon~ ~by~ ~@Double_[email protected]~
founded 5 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
This is what allows pifs to work!
Thats very cool. It brings to mind some sort of espionage where spies are exchanging massive messages contained in 2 numbers. The index and the Metadata length. All the other spy has to do is pass it though pifs to decode. Maybe adding some salt as well to prevent someone figuring it out.
I'm a layman here and not a mathematician but how does it store the complete value of pi and not rounded up to a certain amount? Or do one of the libraries generate that?
You generate it when needed, using one of the known sequences that converges to Ο. As a simple example, the
pi()recipe here shows how to compute Ο to arbitrary precision. For an application like pifs you can do even better and use the BBP formula which lets you directly calculate a specific hexadecimal digit of Ο.Thanks. I love these kind of fun OpenSource community projects/ideas/jokes whatever. The readme reminds me of ed
I want that project continues so hard. Sounds amazing
I can't tell if this is a joke or real code... like for this sentence below.
The cat is back.
Will that repo seriously run until it finds where that is in pi? However long it might take, hours, days, years, decades, and then tell you, so you can look it up quickly?
Yes.
Sure. It'll take a very long while though. We can estimate roughly how long - encoded as ASCII and translated to hex your sentence looks like
54686520636174206973206261636b. That's 30 hexadecimal digits. So very roughly, one of each16^3030-digit sequences will match this one. So on average, you'd need to look about16^30 * 30 β 4e37digits into Ο to find a sequence matching this one. For comparison, something on the order of 1e15 digits of pi were ever calculated.Not very quickly, it's still
n log ntime. More importantly, information theory is ruthless: there exist no compression algorithms that have on average a >1 compression coefficient for arbitrary data. So if you tried to use Ο as compression, the offsets you get would on average be larger than the data you are compressing. For example, your data here can be written written as 30 hexadecimal digits, but the offset into pi would be on the order of 4e37, which takes ~90 hexadecimal digits to write down.