![]() ![]() There are also some harder questions with this. ![]() ![]() Thus they’d have to do the comparison on-device which would mean that every single photo in iCloud would have to be downloaded to the device and hashed for comparison, which defeats one of the purposes of iCloud Photo Library (to free up storage as it fills up without needing to worry about losing one’s photos). They can’t do this server-side because they can’t (well, they say they can’t) read the photos server-side. The chances of this happening across a photo library are slim, particularly for SHA-1, but even one deleted photo could obviously be really bad. The flipside that a couple of the most widely used hashing algorithms for tasks like this, MD5 and SHA-1, have documented “collisions,” where two inputs will produce the same output, which should theoretically never happen in a hashing algorithm. The most convenient way to remove duplicate photos would be to hash the photo files and look for duplicate hashes. ![]()
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |