FenderBender -- on MersenneForum.org "Determine Squares" -- came up with using Bloom filter to detect Quadratic non-residues modulo small primes in order to reject what inputs are certainly not square roots. This reduces, by > 99%, the amount of actual square root calc's done and therefore is more efficient and faster.

Search fur 32-bit vs 64-bit, hash values that make "perfect" Bloom filter. Variety of (simple) hash functions, requiring 2, 3, 4 or 5 hash values. Hideously vast search space. Non-differentiable, so no gradient descent algo's.

Features

  • Bloom filter
  • parallel-for

Project Activity

See All Activity >

License

GNU General Public License version 3.0 (GPLv3)

Follow hash_val_4_Bloom

hash_val_4_Bloom Web Site

Other Useful Business Software
Forever Free Full-Stack Observability | Grafana Cloud Icon
Forever Free Full-Stack Observability | Grafana Cloud

Our generous forever free tier includes the full platform, including the AI Assistant, for 3 users with 10k metrics, 50GB logs, and 50GB traces.

Built on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
Create free account
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of hash_val_4_Bloom!

Additional Project Details

Operating Systems

Linux

User Interface

Command-line

Programming Language

C#

Related Categories

C# Scientific Engineering

Registered

2024-04-26