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

  • Home
  • SEARCH
  • 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 3426382
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 18, 20262026-05-18T06:42:32+00:00 2026-05-18T06:42:32+00:00

I am implementing a simple DHT using the Chord protocol in Java. The details

  • 0

I am implementing a simple DHT using the Chord protocol in Java. The details are not important but the thing I’m stuck on is I need to hash strings and then see if one hashed string is “less than” another.

I have some code to compute hashes using SHA1 which returns a 40 digit long hex string (of type String in Java) such as:

69342c5c39e5ae5f0077aecc32c0f81811fb8193

However I need to be able to compare two of these so to tell, for example that:

0000000000000000000000000000000000000000

is less than:

FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF

This is the complete range of values as the 40 digit string is actually representing 40 hex numbers in the range 0123456789ABCDEF

Does anyone know how to do this?

Thanks in advance.

  • 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-18T06:42:33+00:00Added an answer on May 18, 2026 at 6:42 am

    The values 0..9 and A..F are in hex-digit order in the ASCII character set, so

    string1.compareTo(string2)
    

    should do the trick. Unless I’m missing something.

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

Sidebar

Related Questions

I'm implementing a simple Facebook Like button on a voting site but want an
I'm writing a simple private messenger using Django and am implementing message threading. Each
My team is short on time in implementing a simple shape editor. We have
I'm implementing a service that has several different ways it can be accessed: Using
I've been implementing the Forms Authentication in ASP.NET with C# (v3.5). I created a
I have a fairly simple expression parser that uses the Linq.Expression namespace. Input is
I am implementing a complex search module with result page support paging. Most of
Long version: What would be the essential elements/components of a workflow to be implemented
I find it sometimes annoying that I have to initialise all POD-types manually. E.g.
I had an idea for an app that would require me to implement these

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.