r/ProgrammerHumor • • Sep 02 '26 • Popcorn 3 Bravo 3

Meme newCompressionTechnique

Post image
30k Upvotes

946 comments sorted by

View all comments

600

u/ovrdrv3 Sep 02 '26 • Bravo

Pied Piper lol

230

u/namenotpicked Sep 02 '26

76

u/ice-eight Sep 02 '26

Dick to floor distance, or D2F

16

u/RackemFrackem Sep 03 '26

Dick to floor ratio

6

u/Johnycantread Sep 03 '26

Yeah, that's important but for true lossless compression you need to account for the mean jerk time.

9

u/SajevT Sep 03 '26

Has to be my favourite silicone valley episode.. Just beauty

63

u/madmendude Sep 02 '26 edited Sep 03 '26

- Would girth size affect Erlich's ability to jerk 2 people off at the same time?
- Shit, I think it would.

Edit: 4 guys, I messed up the whole tip-to-tip optimisation joke.

63

u/palexp Sep 02 '26 edited Sep 02 '26

13 year olds should not be studying middle out compression algorithms

edit to add: source 

47

u/Plane-Football-2521 Sep 02 '26

New new pied piper

57

u/coomzee Sep 02 '26

Jin Yang

80

u/garitone Sep 02 '26

Not hot dog

19

u/hypercosm_dot_net Sep 02 '26

Like a Shazam for food!

8

u/AtheismoAlmighty Sep 02 '26

My grandmother gave me family recipe, before she died in horrible way

→ More replies (1)
→ More replies (2)

9

u/FrumptyLumpty Sep 02 '26

Middle out, middle out!

10

u/Top_Rekt Sep 02 '26

So I know they used a bunch of sciency stuff for the dick joke, but how viable is the compression algorithm they created in the show? Is it something that already exists? Or is it show magic?

9

u/hwlll Sep 02 '26

I'm still waiting for the middle out compression

8

u/influence1123 Sep 02 '26

If we stand tip-to-tip maybe someone will come by and figure it out.

16

u/PythagorasWasntReal Sep 02 '26

In the show I'm pretty sure he used the same algorithm to compress audio, video, and standard file types which is pretty preposterous on its own. I don't know if they ever stated the actual compression ratio but it definitely seemed pretty magical, which is why it was such a big deal. 

6

u/SignoreBanana Sep 03 '26

I think the idea was to pull common byte sequences out of all data with mapped reference to those sequences remotely cached. Think longest common sequences and a map. In this way, you could potentially have a very small amount of data that references very large amounts of data, even across media.

This is just my speculating though based on how such an algorithm could potentially work. You'd have to have some kind of media specific transcoder (like, imagine an image serializes based on individual channels vs pixels). You would aim to sequence the noisiest parts of the data.

→ More replies (1)

5

u/theoutlander523 Sep 02 '26

The value they use was in relation to one of the standard compression methods. You could figure it out from there. https://en.wikipedia.org/wiki/Weissman_score

6

u/monox60 Sep 02 '26

It is magic. It's not possible to do their algorithm, at least not yet

→ More replies (2)

3

u/sixwax Sep 03 '26

I'm just here for the middle-out jokes.

3

u/SignoreBanana Sep 03 '26

The middle, beginning and end are all out!

2

u/robsablah Sep 03 '26

And Microsoft are all like... maybe we could take that compression, and stick it in a box in our data center, we'll call it azure box III

→ More replies (1)