concurrent_prime_sieve
v0.3.3 GrowingTools for generating filters and collections with primes concurrently. Rust implementation of the Sieve of Atkin. This implementation runs in O( sqrt(max_num) + section_size ) (where section_size = max_num - min_num). Integrated with primal for increased speed in some cases.
Quick Verdict
- ✕Not updated for 9+ years
- !Pre-1.0: API may have breaking changes
- ✓Tiny footprint (7KB, 3 deps)
- ✓Permissive license (MIT)
Security
Deep Insights
55 downloads in the last 30 days (2/day), up 77% from the previous period.
Despite being 9+ years old, concurrent_prime_sieve hasn't reached 1.0 yet. Expect potential API changes between versions.
Only 3 direct dependencies. Lean dependency tree means faster builds and lower supply chain risk.
At 7KB, concurrent_prime_sieve is lightweight. Small crate size correlates with focused, well-scoped functionality.
Health Breakdown
Recency, release consistency, active ratio
Yanked ratio, deps, size, maturity, features
Reverse deps, ownership, ecosystem
Downloads, momentum, growth trend
Docs, repo, license, metadata
