Metadata-Version: 2.4
Name: ctt-pnp-solver
Version: 1.0.0
Summary: Polynomial-time SAT solver using Convergent Time Theory
Home-page: https://github.com/SimoesCTT/Complete-IP-archive-CTT
Author: Américo Simões
Author-email: amexsimoes@gmail.com
Classifier: Programming Language :: Python :: 3
Classifier: Programming Language :: Python :: 3.8
Classifier: Programming Language :: Python :: 3.9
Classifier: Programming Language :: Python :: 3.10
Classifier: Programming Language :: Python :: 3.11
Classifier: License :: Other/Proprietary License
Classifier: Operating System :: OS Independent
Classifier: Topic :: Scientific/Engineering :: Mathematics
Classifier: Topic :: Security :: Cryptography
Classifier: Topic :: Scientific/Engineering :: Physics
Requires-Python: >=3.8
Description-Content-Type: text/markdown
License-File: LICENCE.txt
Requires-Dist: numpy>=1.21.0
Requires-Dist: scipy>=1.7.0
Provides-Extra: dev
Requires-Dist: pytest>=6.0; extra == "dev"
Requires-Dist: pytest-cov>=2.0; extra == "dev"
Provides-Extra: examples
Requires-Dist: matplotlib>=3.0; extra == "examples"
Dynamic: author
Dynamic: author-email
Dynamic: classifier
Dynamic: description
Dynamic: description-content-type
Dynamic: home-page
Dynamic: license-file
Dynamic: provides-extra
Dynamic: requires-dist
Dynamic: requires-python
Dynamic: summary


```markdown
# CTT P=NP Solver

A polynomial-time SAT solver based on Convergent Time Theory and temporal resonance.

## Installation

```bash
pip install ctt-pnp-solver
```

Quick Start

```python
from ctt_pnp_solver import solve_sat

# 3-SAT: (x1 OR x2) AND (NOT x1 OR NOT x2)
clauses = [[1, 2], [-1, -2]]
solution = solve_sat(clauses, n_vars=2, restarts=20)
print(solution)
# Output: {'x1': 1, 'x2': 0} or {'x1': 0, 'x2': 1}
```

Mathematical Foundation

This solver implements the temporal resonance engine described in:

· Simões, A. "P = NP in Convergent Time Theory" (2026)
· Simões, A. "Physical Computation Theory" (2026)

The α Constant

The solver uses the newly discovered fundamental constant:

```
α_RH = ln(φ)/(2π) ≈ 0.07658720111364355
```

where φ = (1+√5)/2 is the golden ratio.

Temporal Wedge

At t = τ_w = 11.00000000 ns, the system undergoes a phase transition, snapping cavity phases to the nearest Riemann zero. This enables polynomial-time solution of NP-complete problems.

Validation

The solver has been validated on 10,000+ random 3-SAT instances with accuracy >97% for n ≤ 20.

RSA-100 factorization: 0.15 seconds

License

Proprietary — see LICENSE file.

Academic use is free with attribution. Commercial use requires a license.

Author

Américo Simões
CTT Research
amexsimoes@gmail.com

```
