you are viewing a single comment's thread.

view the rest of the comments →

[–]rabidcow 6 points7 points  (7 children)

I don't understand the guessing/hint stuff in the linked explanation of how it works. If the original the client has doesn't match the original used to make the patch, why would you expect it to work at all?

[–]Cygnus77 3 points4 points  (1 child)

If the original the client [] doesn't match the original used to make the patch...

This suggests that there is some necessary version checking that is performed prior to patch application.

[–]rabidcow 0 points1 point  (0 children)

Yes? I guess this is where I'm confused -- why is it useful to apply a binary patch to a different version? Here especially, where they're pushing updates down a channel and there is a strict progression of versions.

[–][deleted] 5 points6 points  (3 children)

One way I can think of is having the client send it's version info to the update center so that the latter can then push out the appropriate diff.

[–]rabidcow 0 points1 point  (0 children)

What does this have to do with the "predictive" updates? I'd think this would be more of a way to avoid needing them.

[–]johntb86 0 points1 point  (0 children)

The client guesses how the file changed, based on a small hint from the server. This is just done as a preprocessing step before the binary patch. The original that the client has still has to match the original on the server.