Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 6816883
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 26, 20262026-05-26T20:58:46+00:00 2026-05-26T20:58:46+00:00

I would like to hash images, which have been converted to byte arrays. The

  • 0

I would like to hash images, which have been converted to byte arrays. The faster the process, the better, so I was wondering how much of a 300000 element byte array I really need to feed into the hash function (sha1 in this case) to get a unique hash string? Does anybody know if, in image binaries, the first x chunk is all meta data? Is there a magic index number that I can use instead of the full length of the byte array? Ex. only hash the first [5000].

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-26T20:58:47+00:00Added an answer on May 26, 2026 at 8:58 pm

    My opinion is that this is a matter of the probability of having a unique hash for each image. If you use only the first 5000 bytes of a 300000 bytes image, then two images only differing in their lower part would probably have the same hash. This is not necessarily a matter of sha1.

    You could also distribute your 5000 bytes evenly over the 300000 bytes.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have multiple images stored at URLs like: /uploads/hash/IMAGE001.jpg . Using jQuery UI's sortable()
I have a hash of images that i'd like to output via a html
I would like to add a hash into an array using Ruby version 1.8.7:
I would like to traverse the HASH but one by one. Not in Random
I would like to generate the mysql-password hash from js. I know the method
I would like to know , considering that Clojure uses 32-bit hash for its
with the hash below, I would like the clients array's reference : my $this
I have a table with 2 different types (image and video). I would like
If I have an array and hash like these #!/usr/bin/perl use warnings; use strict;
I would like to define a hash table with a swappable hash function. The

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.