Skip to content

Latest commit

 

History

62 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Luther's Algorithm: Algorithmic Complexity & Mathematical Research

Maintainer: Martin Luther (elon00)
Research Focus: Computational Number Theory, Sieve Complexity, and Arithmetic Invariants
Status: Formal Mathematical Specification & Benchmarked Harness

1. Scope & Research Methodology

This repository documents algorithmic research in computational arithmetic and number-theoretic sieves:

  • Formal Complexity: Time complexity bounded by O(N log log N), space complexity O(N).
  • Claim Discipline: Unsupported marketing, speculative scale, and unverified commercial audit claims have been replaced with verifiable mathematical proofs and reproducible test harnesses.
  • Verification Environment: Clean local execution in pure Python / Rust with zero external network dependencies.

2. 5-Second Standalone Quickstart

Run the deterministic algorithmic benchmark:

python scripts/benchmark_algorithm.py

3. Mathematical Specifications

Dimension Specification Verification Method
Complexity Class O(N log log N) Sieve Measured Runtime Benchmark
Integrity Proof SHA3-256 Transcript Digest Deterministic State Output
Maturity Research & Algorithm Prototype Local Unit & Regression Tests

Releases

Packages

Contributors

Languages