A Generic Low-Level Solver for NP-Hard Instances (N=63) on Commodity 64-Bit Silicon Breaking the Tractability Barrier:

⚠️ Author’s Note (Language and Tooling Disclosure) The author is a native Spanish speaker. A Large Language Model (LLM) was used exclusively for academic translation, grammar, and formatting, with the sole purpose of communicating the results clearly and efficiently to the international research community.All algorithmic design, implementation, experimental methodology, and results are entirely human-derived and original. Abstract / Description This work presents and validates a silicon-native computational architecture for addressing NP-Hard optimization problems, with a specific focus on the Hamiltonian Path Problem on directed (unilateral) graphs, which constitute one of the most restrictive and computationally demanding problem classes due to asymmetric edge constraints and reduced combinatorial symmetry. Unlike conventional approaches that treat the CPU as a high-level software execution platform, the proposed system models the processor as a physical substrate of logic gates, leveraging strictly bitwise operations and hardware-level nondeterminism arising from real silicon behavior. Key Results • Execution PerformanceDirected Hamiltonian Path instances with N = 63(search space ≈ 10⁸⁷) were solved in 0.116 seconds on a standard commercial mobile processor. • Algorithmic MechanismThe method incorporates hardware race conditions, capacitive noise, and L1 cache timing jitter as controlled entropy sources to facilitate escape from local optima, effectively exploiting non-ideal physical characteristics of silicon rather than abstract randomness. • Problem ClassAll reported results correspond to directed (unilateral) graphs, which are strictly harder than undirected variants due to directionality constraints and reduced path equivalence. • Implementation and PortabilityThe implementation is written in pure C / C-style C++, requires zero dynamic memory allocation, and is suitable for deployment on bare-metal microcontrollers, embedded platforms, and DSP architectures with limited memory availability. Reproducibility and Review The author welcomes independent verification, critical review, and replication attempts.All feedback is appreciated. ✉️ Contact: [email protected]

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-02-13
DOI
https://doi.org/10.5281/zenodo.18636347
Primary Topic
Parallel Computing and Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Generic Low-Level Solver for NP-Hard Instances (N=63) on Commodity 64-Bit Silicon Breaking the Tractability Barrier:

Andrés Sebastián Pirolo
Zenodo (CERN European Organization for Nuclear Research)
Parallel Computing and Optimization Techniques
article

A Generic Low-Level Solver for NP-Hard Instances (N=63) on Commodity 64-Bit Silicon Breaking the Tractability Barrier:

Andrés Sebastián Pirolo
article en

Abstract

⚠️ Author’s Note (Language and Tooling Disclosure) The author is a native Spanish speaker. A Large Language Model (LLM) was used exclusively for academic translation, grammar, and formatting, with the sole purpose of communicating the results clearly and efficiently to the international research community.All algorithmic design, implementation, experimental methodology, and results are entirely human-derived and original. Abstract / Description This work presents and validates a silicon-native computational architecture for addressing NP-Hard optimization problems, with a specific focus on the Hamiltonian Path Problem on directed (unilateral) graphs, which constitute one of the most restrictive and computationally demanding problem classes due to asymmetric edge constraints and reduced combinatorial symmetry. Unlike conventional approaches that treat the CPU as a high-level software execution platform, the proposed system models the processor as a physical substrate of logic gates, leveraging strictly bitwise operations and hardware-level nondeterminism arising from real silicon behavior. Key Results • Execution PerformanceDirected Hamiltonian Path instances with N = 63(search space ≈ 10⁸⁷) were solved in 0.116 seconds on a standard commercial mobile processor. • Algorithmic MechanismThe method incorporates hardware race conditions, capacitive noise, and L1 cache timing jitter as controlled entropy sources to facilitate escape from local optima, effectively exploiting non-ideal physical characteristics of silicon rather than abstract randomness. • Problem ClassAll reported results correspond to directed (unilateral) graphs, which are strictly harder than undirected variants due to directionality constraints and reduced path equivalence. • Implementation and PortabilityThe implementation is written in pure C / C-style C++, requires zero dynamic memory allocation, and is suitable for deployment on bare-metal microcontrollers, embedded platforms, and DSP architectures with limited memory availability. Reproducibility and Review The author welcomes independent verification, critical review, and replication attempts.All feedback is appreciated. ✉️ Contact: [email protected]

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 71%
Parallel Computing and Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.