Register a SA Forums Account here!
JOINING THE SA FORUMS WILL REMOVE THIS BIG AD, THE ANNOYING UNDERLINED ADS, AND STUPID INTERSTITIAL ADS!!!

You can: log in, read the tech support FAQ, or request your lost password. This dumb message (and those ads) will appear on every screen until you register! Get rid of this crap by registering your own SA Forums Account and joining roughly 150,000 Goons, for the one-time price of $9.95! We charge money because it costs us money per month for bills, and since we don't believe in showing ads to our users, we try to make the money back through forum registrations.
 
  • Post
  • Reply
Khorne
May 1, 2002

normal contact posted:

Even if pi contained every finite sequence of digits (which isn’t proven yet), there’s no guarantee that these two numbers would take up less space than any other compression method.
It likely would if the sequence were long enough. You only need the start position and a length, and there are tons of clever ways to store the start position in very few bytes. I'm not up to date on compression methods, but if you literally don't even have to store any data at all which would be like your compressed file passing a small 4-1024 byte hash to a web api to get the uncompressed data. The question is how efficiently your computer can get to that sequence in pi from the calculated index, but that's not space related.

I hope somebody quotes me and blows my mind with some current compression technology that can do something similar.

edit; I am very wrong.

Khorne fucked around with this message at 22:46 on Mar 22, 2018

Adbot
ADBOT LOVES YOU

Salt Fish
Sep 11, 2003

Cybernetic Crumb

Khorne posted:

You only need the start position and a length, and there are tons of clever ways to store the start position in very few bytes.

Citation needed.

Khorne
May 1, 2002

Salt Fish posted:

Citation needed.
Very few is kinda relative here. You need to be able to accurately represent two positive integers. The start position and the length.

There are endless ways to do this. You could even use the pi-compression algorithm iteratively if you wanna be cheeky about it, but you could also just use normal compression that we use today.

XK
Jul 9, 2001

Star Citizen is everywhere. It is all around us. Even now, in this very room. You can see it's fidelity when you look out your window or when you watch youtube

Khorne posted:

It likely would if the sequence were long enough. You only need the start position and a length, and there are tons of clever ways to store the start position in very few bytes. I'm not up to date on compression methods, but if you literally don't even have to store any data at all which would be like your compressed file passing a small 4-12 byte hash to a web api to get the uncompressed data. The question is how efficiently your computer can get to that sequence in pi from the calculated index, but that's not space related.

I hope somebody quotes me and blows my mind with some current compression technology that can do something similar.

It's literally impossible to compress data when every encodeable value is equally likely.

Khorne
May 1, 2002

XK posted:

It's literally impossible to compress data when every encodeable value is equally likely.
I get that both finding the right position for the sequence and even having that sequence available is not practical.

Technically, if pi behaved that way, there would be "correct" start positions that are larger than the data being compressed. Although I am unsure how the math works out for first occurrences, but for nth occurrences it would have to be the case.

Khorne fucked around with this message at 22:17 on Mar 22, 2018

XK
Jul 9, 2001

Star Citizen is everywhere. It is all around us. Even now, in this very room. You can see it's fidelity when you look out your window or when you watch youtube

Khorne posted:

I get that both finding the right position for the sequence and then having that sequence available is not practical.

I'm not saying it's impractical, I'm saying it's impossible.

Thought exercise: Let's limit ourselves to encoding a start point from 0-7. That requires 3 bits. How do you compress that to less than 3 bits? Go to 2 bits, how do you represent 8 possible different pieces of data when you only have 4 different encodings? You can't without your compressed offsets becoming indistinguishable from each other.

Mozi
Apr 4, 2004

Forms change so fast
Time is moving past
Memory is smoke
Gonna get wider when I die
Nap Ghost
just decrease the font size, duh

Khorne
May 1, 2002

XK posted:

I'm not saying it's impractical, I'm saying it's impossible.

Thought exercise: Let's limit ourselves to encoding a start point from 0-7. That requires 3 bits. How do you compress that to less than 3 bits? Go to 2 bits, how do you represent 8 possible different pieces of data when you only have 4 different encodings? You can't without your compressed offsets becoming indistinguishable from each other.
Oh. I thought you meant the pi stuff.

Way1: Floating point. Because we're dealing with a sequence in pi and ignoring the complexities of finding the correct start, you could compress as a structure of: "fp representation, exact length, first n bytes that won't match any sequence between the fp's start and the actual start." or "fp, integer or fp to add to fp after it's cast to int, exact length, first n bytes"
Way2: Naive compression. The start position will be sufficiently long, on the scale of kbs/mbs/gbs/potentially "infinitely" long I guess, so you compress recurring sequences. To do this you could compress to n bytes = 1 byte, and if byte >1 is non-null it represents some entry.

And the ways branch out from those ideas. But obviously, if your start position is larger than the data then it's all pointless.

edit: I guess both methods would work in some cases but definitely wouldn't work in a general sense.

Khorne fucked around with this message at 22:45 on Mar 22, 2018

Pochoclo
Feb 4, 2008

No...
Clapping Larry
Don't you guys have contactless in the colonies?

Also lol the bitcoin price graph is gonna end up looking like a loving seesaw isn't it.

Salt Fish
Sep 11, 2003

Cybernetic Crumb

Khorne posted:

Very few is kinda relative here. You need to be able to accurately represent two positive integers. The start position and the length.

There are endless ways to do this. You could even use the pi-compression algorithm iteratively if you wanna be cheeky about it, but you could also just use normal compression that we use today.

The integer is larger than the original content. Try to even think of a trivial case where you're not encoding the literal value of pi. How about the letter A for example, do this process for A.

Khorne
May 1, 2002

Salt Fish posted:

The integer is larger than the original content. Try to even think of a trivial case where you're not encoding the literal value of pi. How about the letter A for example, do this process for A.
Yeah. I get this problem, too. :(

toiletbrush
May 17, 2010

Khorne posted:

Very few is kinda relative here. You need to be able to accurately represent two positive integers. The start position and the length.

There are endless ways to do this. You could even use the pi-compression algorithm iteratively if you wanna be cheeky about it, but you could also just use normal compression that we use today.
:ssh: winzip has a secret option to iteratively zip your zip files :ssh:

mathematicians hate this secret trick!

XK
Jul 9, 2001

Star Citizen is everywhere. It is all around us. Even now, in this very room. You can see it's fidelity when you look out your window or when you watch youtube

Khorne posted:

Oh. I thought you meant the pi stuff.

Way1: Floating point. Because we're dealing with a sequence in pi and ignoring the complexities of finding the correct start, you could compress as a structure of: "fp representation, exact length, first n bytes that won't match any sequence between the fp's start and the actual start." or "fp, integer or fp to add to fp after it's cast to int, exact length, first n bytes"
Way2: Naive compression. The start position will be sufficiently long, on the scale of kbs/mbs/gbs/potentially "infinitely" long I guess, so you compress recurring sequences and use a dictionary.

And the ways branch out from those ideas.

Yes, I was talking about encoding the starting offset. The issues of "sequence inside pi" thing are even worse.

It's literally impossible to compress the starting offset. Provably impossible.

Khorne
May 1, 2002

Salt Fish posted:

The integer is larger than the original content. Try to even think of a trivial case where you're not encoding the literal value of pi. How about the letter A for example, do this process for A.
A is literally 7, len 2 and represents 65.

You can represent 1592 as 3,4.

This kind of ignores the issue of the format needing to denote lengths or have a delimiter of some kind, too. It won't even be the same size for trivial examples.

You could represent the entirety pi as 0,0 if you wanted 0 to be an otherwise invalid length. :getin:

Khorne fucked around with this message at 22:33 on Mar 22, 2018

Burt Sexual
Jan 26, 2006

by Jeffrey of YOSPOS
Switchblade Switcharoo
Wtf is this nerd poo poo

wilderthanmild
Jun 21, 2010

Posting shit




Grimey Drawer
In bitcoin news: City of Atlanta's computer systems are being held ransom for bitcoin.

This is good for bitcoin?

Khorne
May 1, 2002

XK posted:

Yes, I was talking about encoding the starting offset. The issues of "sequence inside pi" thing are even worse.

It's literally impossible to compress the starting offset. Provably impossible.
This is actually true and simple to figure out. Oops.

Khorne fucked around with this message at 22:46 on Mar 22, 2018

klafbang
Nov 18, 2009
Clapping Larry

Khorne posted:

It likely would if the sequence were long enough. You only need the start position and a length, and there are tons of clever ways to store the start position in very few bytes. I'm not up to date on compression methods, but if you literally don't even have to store any data at all which would be like your compressed file passing a small 4-1024 byte hash to a web api to get the uncompressed data. The question is how efficiently your computer can get to that sequence in pi from the calculated index, but that's not space related.

I hope somebody quotes me and blows my mind with some current compression technology that can do something similar.

You cannot. The field that proves this is called information theory.

Essentially, you'd need at least 2^n starting positions to encode all sequences of length n. You need n bits to encode numbers up to 2^n.

Some offsets or bitpatterns you could encode more efficiently at the cost of encoding other less efficiently. Regular compression essentially does this in a clever way (for simple examples, see run-length encoding or hamming coding) so what you want to represent has a short representation, but using positions of pi makes the encoding random, so it's a toss-up whether you win or lose.

Which is still better than bitcoin, where you can only lose, so there's that.

toiletbrush
May 17, 2010
pi doesn't even have all the digits from 0-9 until 33 digits in, so it can't even represent single digit numbers efficiently. it gets worse from there.

Khorne
May 1, 2002

klafbang posted:

Some offsets or bitpatterns you could encode more efficiently at the cost of encoding other less efficiently. Regular compression essentially does this in a clever way (for simple examples, see run-length encoding or hamming coding) so what you want to represent has a short representation, but using positions of pi makes the encoding random, so it's a toss-up whether you win or lose.
Obviously we just use a byte or twenty to represent which encoding method we're using and just use lots of win:lose methods and choose the most winning for the start position!

After thinking about things and some quick reading I was very, very wrong. I've never really dealt with encoding directly. Especially not in a theoretical sense. Thanks for the posts guys, I learned something in the bitcoin thread.

toiletbrush posted:

pi doesn't even have all the digits from 0-9 until 33 digits in, so it can't even represent single digit numbers efficiently. it gets worse from there.
I'm going to mention this fact in casual conversation at some point in the future and be "that guy".


edit: I like this post about why it sucks. But also, there are simple reasons like "there are plenty of algorithms better than the digits of pi". I've also skimmed an information theory textbook and learned quite a lot.

Khorne fucked around with this message at 23:05 on Mar 22, 2018

Sentient Data
Aug 31, 2011

My molecule scrambler ray will disintegrate your armor with one blow!
The pi compression topic make me nostalgic since it's one of the first things I thought of when getting deeper into qbasic in middle school, and I bet that like 90% of all computer touchers had the same idea when they were kids

Khorne
May 1, 2002

Sentient Data posted:

The pi compression topic make me nostalgic since it's one of the first things I thought of when getting deeper into qbasic in middle school, and I bet that like 90% of all computer touchers had the same idea when they were kids
This post made me realize I've thought of it before, I can even recall the computer I was sitting at in the 90s, and realized you can't do it. Yet somehow sitting here right now I argued you could in the hopes people would post mathematical proof you can't. Welp. Older & dumber.

Pretty sure I dismissed it on the grounds of calculating pi stuff to be impractical in itself. I never really thought about the realities of the offset.

Khorne fucked around with this message at 23:10 on Mar 22, 2018

Risc1911
Mar 1, 2016

Local Japanese media outlet Nikkei reported March 22 that Hong Kong-based Binance, which is currently the world’s largest exchange by trade volume, was to be ordered to shut down operations in Japan for failing to register with the Financial Services Authority (FSA).
https://www.bloomberg.com/news/articles/2018-03-22/bitcoin-falls-after-report-that-binance-faces-warning-in-japan

QuarkJets
Sep 8, 2008

Khorne posted:

This post made me realize I've thought of it before, I can even recall the computer I was sitting at in the 90s, and realized you can't do it. Yet somehow sitting here right now I argued you could in the hopes people would post mathematical proof you can't. Welp. Older & dumber.

Pretty sure I dismissed it on the grounds of calculating pi stuff to be impractical in itself. I never really thought about the realities of the offset.

Yet you should be congratulated because you've put more thought and effort into the idea than most cryptocurrency creators put into theirs

And when you found your idea wanting you discarded it instead of insisting that it would revolutionize everything

klafbang
Nov 18, 2009
Clapping Larry

Sentient Data posted:

The pi compression topic make me nostalgic since it's one of the first things I thought of when getting deeper into qbasic in middle school, and I bet that like 90% of all computer touchers had the same idea when they were kids

I once invented encryption by xor-ing with a one-time pad generated using a seeded PRNG. Luckily, Satoshi invented real cryptography shortly thereafter.

100 HOGS AGREE
Oct 13, 2007
Grimey Drawer

Risc1911 posted:

Local Japanese media outlet Nikkei reported March 22 that Hong Kong-based Binance, which is currently the world’s largest exchange by trade volume, was to be ordered to shut down operations in Japan for failing to register with the Financial Services Authority (FSA).
https://www.bloomberg.com/news/articles/2018-03-22/bitcoin-falls-after-report-that-binance-faces-warning-in-japan

:laffo:

this thread makes me laugh out loud in real actual life more than any other thread on Something Awful

let it mellow
Jun 1, 2000

Dinosaur Gum

Burt Sexual posted:

Wtf is this nerd poo poo

bitcoin

Shinjobi
Jul 10, 2008


Gravy Boat 2k

Risc1911 posted:

Local Japanese media outlet Nikkei reported March 22 that Hong Kong-based Binance, which is currently the world’s largest exchange by trade volume, was to be ordered to shut down operations in Japan for failing to register with the Financial Services Authority (FSA).
https://www.bloomberg.com/news/articles/2018-03-22/bitcoin-falls-after-report-that-binance-faces-warning-in-japan

This is good for bitcoin.

Thranguy
Apr 21, 2010


Deceitful and black-hearted, perhaps we are. But we would never go against the Code. Well, perhaps for good reasons. But mostly never.

normal contact posted:

Even if pi contained every finite sequence of digits (which isn’t proven yet), there’s no guarantee that these two numbers would take up less space than any other compression method.

For any nontrivial text those two numbers almost certainly take more space than could be possibly held if every atom of the universe were converted to the most dense storage medium theoretically possible.

Comfy Fleece Sweater
Apr 2, 2013

You see, but you do not observe.

Khorne posted:

This post made me realize I've thought of it before, I can even recall the computer I was sitting at in the 90s, and realized you can't do it. Yet somehow sitting here right now I argued you could in the hopes people would post mathematical proof you can't. Welp. Older & dumber.

Pretty sure I dismissed it on the grounds of calculating pi stuff to be impractical in itself. I never really thought about the realities of the offset.

Imagine.... meanwhile a man named Satoshi Nakamoto sat at a computer and gave humanity a new way to live and prosper through the blockchain. Makes u think

I would blow Dane Cook
Dec 26, 2008
https://twitter.com/maxwelltani/status/976926310445584386

Now that he is no longer relevant, Steve Bannon has to find a new bunch of weirdos to ingratiate himself with.

Bip Roberts
Mar 29, 2005

Risc1911 posted:

Local Japanese media outlet Nikkei reported March 22 that Hong Kong-based Binance, which is currently the world’s largest exchange by trade volume, was to be ordered to shut down operations in Japan for failing to register with the Financial Services Authority (FSA).
https://www.bloomberg.com/news/articles/2018-03-22/bitcoin-falls-after-report-that-binance-faces-warning-in-japan

Japan banning bit nonce!

Fur20
Nov 14, 2007

すご▞い!
君は働か░い
フ▙▓ズなんだね!

Bip Roberts posted:

Japan banning bit nonce!

it's racist of japan to ban beyonce just because she's chinese imo

Burt Sexual
Jan 26, 2006

by Jeffrey of YOSPOS
Switchblade Switcharoo

I would blow Dane Cook posted:

https://twitter.com/maxwelltani/status/976926310445584386

Now that he is no longer relevant, Steve Bannon has to find a new bunch of weirdos to ingratiate himself with.

This dude just seems to live tweet other news outlets stories and has acne.

XK
Jul 9, 2001

Star Citizen is everywhere. It is all around us. Even now, in this very room. You can see it's fidelity when you look out your window or when you watch youtube

Khorne posted:

This is actually true and simple to figure out. Oops.

I could really blow your mind with my "All positive numbers added together equal -(1/12)" post.

Rock Puncher
Jul 26, 2014
https://twitter.com/cz_binance/status/976997061156519937


so.. confirmed?

GRINDCORE MEGGIDO
Feb 28, 1985


So yea, pedocoins.

Jombo
Feb 20, 2009
I am beginning to think that instead of the massive, hour-long crash we have all been waiting for the hodlers and fodlers will just be cashing out over the months and years as they grow weary of the realisation they will never become the titans of industry they so desire for leaving their computers on all night.

*sigh*

Jombo
Feb 20, 2009

klafbang posted:

You cannot. The field that proves this is called information theory.

Essentially, you'd need at least 2^n starting positions to encode all sequences of length n. You need n bits to encode numbers up to 2^n.

Some offsets or bitpatterns you could encode more efficiently at the cost of encoding other less efficiently. Regular compression essentially does this in a clever way (for simple examples, see run-length encoding or hamming coding) so what you want to represent has a short representation, but using positions of pi makes the encoding random, so it's a toss-up whether you win or lose.

Which is still better than bitcoin, where you can only lose, so there's that.

What you need to do is jerk of two dicks since you have two hands... and what if you lined up the dicks so the up-stroke on one dick is the down-stroke on the other dick! FOUR DICKS!

Adbot
ADBOT LOVES YOU

SelenicMartian
Sep 14, 2013

Sometimes it's not the bomb that's retarded.

Jombo posted:

What you need to do is jerk of two dicks since you have two hands... and what if you lined up the dicks so the up-stroke on one dick is the down-stroke on the other dick! FOUR DICKS!
Then, try this
https://i.imgur.com/Un2DKD1.mp4

  • 1
  • 2
  • 3
  • 4
  • 5
  • Post
  • Reply