GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — GitHub - ProgrammerKR/HashX: HashX is a high-performance 512-bit hashing algorithm optimized for speed, security, and scalability. It features multi-threading, advanced mixing, and HMAC-style security, ensuring strong collision resistance and a powerful avalanche effect. Ideal for checksums, indexing, data integrity, and non-cryptographic applications.

BranchesTags
Open more actions menu

Latest commit

 

History

27 Commits
27 Commits

Folders and files

NameName
Last commit message
Last commit date
.github/ISSUE_TEMPLATE
.github/ISSUE_TEMPLATE
 
 
CODE_OF_CONDUCT.md
CODE_OF_CONDUCT.md
 
 
CONTRIBUTING.md
CONTRIBUTING.md
 
 
LICENSE
LICENSE
 
 
README.md
README.md
 
 
SECURITY.md
SECURITY.md
 
 
benchmark_results.md
benchmark_results.md
 
 
main.py
main.py
 
 

Repository files navigation

⚔ HashX – High-Performance 512-bit Hashing Algorithm

The simplest & fastest open-source hashing library!



HashX is an ultra-fast, efficient, and secure 256-bit hashing algorithm designed for data integrity verification, indexing, checksums, and non-cryptographic applications.

Built with multi-threading, optimized bitwise operations, and an advanced mixing function, HashX delivers exceptional speed, collision resistance, and scalability.

šŸš€ Features & Enhancements

āœ… High-Speed Processing – Optimized bitwise operations and low-level transformations.
āœ… Multi-Threaded Execution – Parallel chunk processing for increased speed.
āœ… 512-bit Strong Hash Output – Reduces collisions while maintaining efficiency.
āœ… Advanced Mixing Function – Inspired by MurmurHash3 for better diffusion.
āœ… Bitwise Rotation Optimization – Faster and more secure state transformations.
āœ… Lightweight & Scalable – Low memory usage, works on large data sets.
āœ… Strong Avalanche Effect – Small input changes drastically modify the hash.
āœ… Cross-Platform & Extensible – Works seamlessly in Python, with future support planned for C/Rust.


šŸ“„ Installation

Clone the repository:

git clone https://github.com/ProgrammerKR/HashX.git

Navigate to the directory:

cd HashX

šŸ› ļø Usage

Python Example

from hashx import HashX

hasher = HashX()
print(hasher.hash("Hello, World!"))  # Example usage

Output

3F2A9D7B89C4E6A5D12F1E4B67A3C9D5E8F7B2A6C3D1E0F4B6A2D9C7E3F5A5B1

āš™ļø How It Works

  1. Initialization – Hash state consists of 4 unique parts, seeded for strong uniqueness.
  2. Chunk Processing – Data is split into 64-bit blocks, processed in parallel threads.
  3. Bitwise Mixing & Rotation – Advanced scrambling ensures strong randomness.
  4. Finalization Rounds – Enhanced diffusion eliminates weak patterns.
  5. Output Generation – 512-bit hexadecimal hash is returned.

šŸ”¬ Benchmarking

HashX has been tested against SHA-256, BLAKE3, xxHash, and MurmurHash3 for speed and efficiency.

Benchmark Results

For detailed benchmark results, check the full report:
šŸ“Š Benchmark Results

šŸ› ļø Future Plans

  • C and Rust Implementation for ultra-fast performance.
  • GPU Acceleration using CUDA/OpenCL.
  • Cryptographic Security Mode for password hashing.

šŸ“¢ Have questions or feedback?

  • šŸ’¬ Join discussions here
  • šŸ› Found a bug? Report here

šŸ¤ Contributing

Contributions are welcome! Feel free to fork the repo, submit issues, or create pull requests.

šŸ› ļø How to Contribute?

  1. Fork the Repository (Click the "Fork" button at the top of the repo).
  2. Clone your Fork
    git clone https://github.com/your-username/HashX.git
  3. Create a New Branch
    git checkout -b improve-docs
  4. Make Changes (Edit README.md and add documentation updates).
  5. Commit & Push
    git add README.md
    git commit -m "Improved documentation & usage examples"
    git push origin improve-docs
  6. Create a Pull Request (Go to the original repo and submit a PR).

šŸ“œ License

This project is open-source and available under the MIT License.

About

HashX is a high-performance 512-bit hashing algorithm optimized for speed, security, and scalability. It features multi-threading, advanced mixing, and HMAC-style security, ensuring strong collision resistance and a powerful avalanche effect. Ideal for checksums, indexing, data integrity, and non-cryptographic applications.

Topics

algorithmchecksumcryptographydata-integrityencryptionfast-algorithmhash-functionhashing-algorithmhashxhigh-performanceintegrity-checklightweightnext-gen-hashingopensourcepassword-hashingpassword-securitypythonsecure-codingsecure-hashingsecurity

Resources

Readme
MIT license

Code of conduct

Code of conduct

Contributing

Contributing

Security policy

Security policy
Activity

Stars

3 stars

Watchers

1 watching

Forks

1 fork
Report repository

Releases

Packages

Contributors

Languages

You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800Ɨ600. No cookies required.