Create KOSCHEL FORMULA
#2
by
Mattkos
- opened
- KOSCHEL FORMULA +681 -0
KOSCHEL FORMULA
ADDED
|
@@ -0,0 +1,681 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
import math
|
| 2 |
+
import hashlib
|
| 3 |
+
import time
|
| 4 |
+
import struct
|
| 5 |
+
from typing import List, Dict, Optional, Tuple
|
| 6 |
+
from enum import Enum
|
| 7 |
+
|
| 8 |
+
|
| 9 |
+
class MiningPerformanceLevel(Enum):
|
| 10 |
+
OPTIMIZED = "optimized"
|
| 11 |
+
QUANTUM_BOOST = "quantum_boost"
|
| 12 |
+
MAXIMUM_POWER = "maximum_power"
|
| 13 |
+
ZERO_ENTROPY = "zero_entropy"
|
| 14 |
+
|
| 15 |
+
|
| 16 |
+
class SelfHealingQuantumMiner:
|
| 17 |
+
"""
|
| 18 |
+
Self-healing geometric mining prototype with Tesla 3-6-9 resonance.
|
| 19 |
+
- Hexagonal symmetry healing + phase-aware nonagon (9) healing
|
| 20 |
+
- Harmonic (3/6) angular/radial modulation with phase gains
|
| 21 |
+
- Golden-ratio scaling, Fibonacci-adjacent checks
|
| 22 |
+
- Entropy-state metric via digital root (1..9) + explicit 9-cycle reinforcement
|
| 23 |
+
- Triangular layering and 9-step cycle resets
|
| 24 |
+
"""
|
| 25 |
+
|
| 26 |
+
def __init__(self, performance_level: MiningPerformanceLevel = MiningPerformanceLevel.MAXIMUM_POWER):
|
| 27 |
+
self.performance_level = performance_level
|
| 28 |
+
self.phi = (1 + math.sqrt(5)) / 2
|
| 29 |
+
self.dna_ratio = 34 / 21 # historical constant; used here as a fixed ratio
|
| 30 |
+
|
| 31 |
+
# Modulation params
|
| 32 |
+
self.angular_modulation = 0.15
|
| 33 |
+
self.radial_breathing = 0.08
|
| 34 |
+
|
| 35 |
+
# Entropy metric
|
| 36 |
+
self.entropy_state = 9
|
| 37 |
+
self.consecutive_9_cycles = 0
|
| 38 |
+
|
| 39 |
+
# Self-healing params
|
| 40 |
+
self.healing_tolerance = 0.01
|
| 41 |
+
self.healing_force_multiplier = 1.0
|
| 42 |
+
self.healing_cycles = 0
|
| 43 |
+
|
| 44 |
+
# Performance / learning
|
| 45 |
+
self.optimal_batch_size = 4096
|
| 46 |
+
self.learning_rate = 0.05
|
| 47 |
+
self.evolution_cycle = 0
|
| 48 |
+
self.performance_multiplier = 1.0
|
| 49 |
+
|
| 50 |
+
# Runtime stats
|
| 51 |
+
self.success_patterns: List[Dict] = []
|
| 52 |
+
self.failed_ranges = set()
|
| 53 |
+
self.hash_rate_history: List[float] = []
|
| 54 |
+
|
| 55 |
+
print(f"π οΈ Geometric Miner Initialized: {performance_level.value}")
|
| 56 |
+
|
| 57 |
+
# ---------- Tesla 3-6-9 phase core ----------
|
| 58 |
+
|
| 59 |
+
def _tesla_phase(self) -> int:
|
| 60 |
+
"""
|
| 61 |
+
Deterministic 3β6β9 cycle using evolution_cycle.
|
| 62 |
+
Returns 3, 6, or 9.
|
| 63 |
+
"""
|
| 64 |
+
phase_index = self.evolution_cycle % 3
|
| 65 |
+
return [3, 6, 9][phase_index]
|
| 66 |
+
|
| 67 |
+
def _secure_phase_seed(self, index: int, position: int, layer: int) -> int:
|
| 68 |
+
"""
|
| 69 |
+
Deterministic seed based on local parameters; avoids external randomness.
|
| 70 |
+
"""
|
| 71 |
+
payload = f"{index}:{position}:{layer}:{self.evolution_cycle}".encode("utf-8")
|
| 72 |
+
digest = hashlib.sha256(payload).digest()
|
| 73 |
+
return struct.unpack("<Q", digest[:8])[0]
|
| 74 |
+
|
| 75 |
+
def _phase_gain(self, phase: int) -> Tuple[float, float, float]:
|
| 76 |
+
"""
|
| 77 |
+
Returns (angular_gain, radial_gain, entropy_gain) for the active phase.
|
| 78 |
+
Gains are conservative and bounded.
|
| 79 |
+
"""
|
| 80 |
+
if phase == 3:
|
| 81 |
+
return (1.15, 1.05, 1.20)
|
| 82 |
+
if phase == 6:
|
| 83 |
+
return (1.05, 1.15, 1.25)
|
| 84 |
+
# phase == 9
|
| 85 |
+
return (1.10, 1.10, 1.35)
|
| 86 |
+
|
| 87 |
+
# ---------- Geometric healing ----------
|
| 88 |
+
|
| 89 |
+
def _nonagon_neighbors(self, x: float, y: float, r: float, layer_n: int) -> List[Tuple[float, float]]:
|
| 90 |
+
"""
|
| 91 |
+
9-fold symmetry neighbors for phase 9 healing.
|
| 92 |
+
"""
|
| 93 |
+
pts = []
|
| 94 |
+
for i in range(9):
|
| 95 |
+
angle = 2 * math.pi * i / 9
|
| 96 |
+
nx = x + r * layer_n * math.cos(angle)
|
| 97 |
+
ny = y + r * layer_n * math.sin(angle)
|
| 98 |
+
pts.append((nx, ny))
|
| 99 |
+
return pts
|
| 100 |
+
|
| 101 |
+
def self_heal_point(
|
| 102 |
+
self,
|
| 103 |
+
target_point: Tuple[float, float],
|
| 104 |
+
layer_n: int,
|
| 105 |
+
r: float = 1.0,
|
| 106 |
+
tolerance: float = 0.01
|
| 107 |
+
) -> Tuple[float, float]:
|
| 108 |
+
"""
|
| 109 |
+
Heal a perturbed point using hexagonal symmetry.
|
| 110 |
+
Healed = average of 6 neighbors (simple symmetry-cage relaxation).
|
| 111 |
+
"""
|
| 112 |
+
x, y = target_point
|
| 113 |
+
healed = (x, y)
|
| 114 |
+
|
| 115 |
+
ideal_neighbors = []
|
| 116 |
+
for i in range(6):
|
| 117 |
+
angle = 2 * math.pi * i / 6
|
| 118 |
+
nx = x + r * layer_n * math.cos(angle)
|
| 119 |
+
ny = y + r * layer_n * math.sin(angle)
|
| 120 |
+
ideal_neighbors.append((nx, ny))
|
| 121 |
+
|
| 122 |
+
avg_x = sum(p[0] for p in ideal_neighbors) / 6
|
| 123 |
+
avg_y = sum(p[1] for p in ideal_neighbors) / 6
|
| 124 |
+
vector_healed = (avg_x, avg_y)
|
| 125 |
+
|
| 126 |
+
current_error = self._calculate_distance(target_point, vector_healed)
|
| 127 |
+
if current_error > tolerance:
|
| 128 |
+
healed = vector_healed
|
| 129 |
+
self.healing_cycles += 1
|
| 130 |
+
print(f"π§ Healing applied: err {current_error:.4f} β reduced")
|
| 131 |
+
|
| 132 |
+
return healed
|
| 133 |
+
|
| 134 |
+
def self_heal_point_phase(
|
| 135 |
+
self,
|
| 136 |
+
target_point: Tuple[float, float],
|
| 137 |
+
layer_n: int,
|
| 138 |
+
r: float = 1.0,
|
| 139 |
+
tolerance: float = 0.01
|
| 140 |
+
) -> Tuple[float, float]:
|
| 141 |
+
"""
|
| 142 |
+
Phase-aware healing: hex (6) by default, nonagon (9) when phase==9.
|
| 143 |
+
"""
|
| 144 |
+
phase = self._tesla_phase()
|
| 145 |
+
x, y = target_point
|
| 146 |
+
|
| 147 |
+
if phase == 9:
|
| 148 |
+
neighbors = self._nonagon_neighbors(x, y, r, layer_n)
|
| 149 |
+
avg_x = sum(p[0] for p in neighbors) / 9
|
| 150 |
+
avg_y = sum(p[1] for p in neighbors) / 9
|
| 151 |
+
else:
|
| 152 |
+
neighbors = []
|
| 153 |
+
for i in range(6):
|
| 154 |
+
angle = 2 * math.pi * i / 6
|
| 155 |
+
nx = x + r * layer_n * math.cos(angle)
|
| 156 |
+
ny = y + r * layer_n * math.sin(angle)
|
| 157 |
+
neighbors.append((nx, ny))
|
| 158 |
+
avg_x = sum(p[0] for p in neighbors) / 6
|
| 159 |
+
avg_y = sum(p[1] for p in neighbors) / 6
|
| 160 |
+
|
| 161 |
+
vector_healed = (avg_x, avg_y)
|
| 162 |
+
current_error = self._calculate_distance(target_point, vector_healed)
|
| 163 |
+
if current_error > tolerance:
|
| 164 |
+
self.healing_cycles += 1
|
| 165 |
+
return vector_healed
|
| 166 |
+
return target_point
|
| 167 |
+
|
| 168 |
+
@staticmethod
|
| 169 |
+
def _calculate_distance(p1: Tuple[float, float], p2: Tuple[float, float]) -> float:
|
| 170 |
+
return math.sqrt((p1[0] - p2[0]) ** 2 + (p1[1] - p2[1]) ** 2)
|
| 171 |
+
|
| 172 |
+
# ---------- Phase-aware modulation ----------
|
| 173 |
+
|
| 174 |
+
def _apply_tesla_phase_modulation(
|
| 175 |
+
self,
|
| 176 |
+
index: int,
|
| 177 |
+
position: int,
|
| 178 |
+
layer: int,
|
| 179 |
+
base_angle: float,
|
| 180 |
+
angle_mod: float,
|
| 181 |
+
radial_mod: float
|
| 182 |
+
) -> Tuple[int, float, float]:
|
| 183 |
+
"""
|
| 184 |
+
Applies phase gains and a small seeded jitter to prevent degeneracy.
|
| 185 |
+
Returns (phase, modulated_angle, modulated_radial).
|
| 186 |
+
"""
|
| 187 |
+
phase = self._tesla_phase()
|
| 188 |
+
ang_gain, rad_gain, _ = self._phase_gain(phase)
|
| 189 |
+
|
| 190 |
+
# Deterministic jitter bounded to Β±0.005
|
| 191 |
+
seed = self._secure_phase_seed(index, position, layer)
|
| 192 |
+
jitter = ((seed % 1000) / 1000.0 - 0.5) * 0.01
|
| 193 |
+
|
| 194 |
+
modulated_angle = (base_angle + angle_mod * ang_gain + jitter)
|
| 195 |
+
modulated_radial = max(-0.45, min(0.45, radial_mod * rad_gain)) # keep breathing stable
|
| 196 |
+
|
| 197 |
+
return (phase, modulated_angle, modulated_radial)
|
| 198 |
+
|
| 199 |
+
def _phase_entropy_multiplier(self, value: int, phase: int) -> float:
|
| 200 |
+
"""
|
| 201 |
+
Rewards candidates whose digital root equals the active phase.
|
| 202 |
+
Conservative bounds to avoid runaway amplification.
|
| 203 |
+
"""
|
| 204 |
+
dr = self._calculate_digital_root(value)
|
| 205 |
+
_, _, ent_gain = self._phase_gain(phase)
|
| 206 |
+
if dr == phase:
|
| 207 |
+
return ent_gain
|
| 208 |
+
# Mild cross-resonance boosts
|
| 209 |
+
if phase == 9 and dr in (3, 6):
|
| 210 |
+
return 1.15
|
| 211 |
+
if phase in (3, 6) and dr == 9:
|
| 212 |
+
return 1.10
|
| 213 |
+
return 1.0
|
| 214 |
+
|
| 215 |
+
# ---------- Triangular/Fibonacci layering ----------
|
| 216 |
+
|
| 217 |
+
def _triangular_layering(self, n: int) -> int:
|
| 218 |
+
"""Triangular number recursion: T(n) = n(n+1)/2"""
|
| 219 |
+
return n * (n + 1) // 2
|
| 220 |
+
|
| 221 |
+
def _layer_cycle_reset(self, layer: int) -> int:
|
| 222 |
+
"""Reset every 9 steps for Tesla resonance"""
|
| 223 |
+
return layer % 9
|
| 224 |
+
|
| 225 |
+
# ---------- Nonce generation with modulation + healing ----------
|
| 226 |
+
|
| 227 |
+
def generate_self_healing_nonces(
|
| 228 |
+
self,
|
| 229 |
+
base_nonce: int,
|
| 230 |
+
job_id: str,
|
| 231 |
+
prevhash: str,
|
| 232 |
+
target: int,
|
| 233 |
+
batch_multiplier: int = 1
|
| 234 |
+
) -> List[int]:
|
| 235 |
+
"""
|
| 236 |
+
Generate a batch of candidate nonces using harmonic modulation
|
| 237 |
+
and optionally heal poorly-distributed values.
|
| 238 |
+
"""
|
| 239 |
+
batch_size = self.optimal_batch_size * batch_multiplier
|
| 240 |
+
nonces: List[int] = []
|
| 241 |
+
|
| 242 |
+
power_boost = self._get_power_boost()
|
| 243 |
+
_ = self._get_entropy_reduction() # reserved
|
| 244 |
+
|
| 245 |
+
for i in range(batch_size):
|
| 246 |
+
layer = i % 256
|
| 247 |
+
position = i // 256
|
| 248 |
+
|
| 249 |
+
# 3-pulse angular modulation base
|
| 250 |
+
angle_mod = self.angular_modulation * math.sin(3 * position + self._get_phase_optimized())
|
| 251 |
+
base_angle = 2 * math.pi * position / 6
|
| 252 |
+
|
| 253 |
+
# 6-rhythm radial breathing base
|
| 254 |
+
radial_mod = self.radial_breathing * math.sin(6 * layer + self._get_phase_optimized())
|
| 255 |
+
|
| 256 |
+
# Apply Tesla phase modulation
|
| 257 |
+
phase, modulated_angle, modulated_radial = self._apply_tesla_phase_modulation(
|
| 258 |
+
i, position, layer, base_angle, angle_mod, radial_mod
|
| 259 |
+
)
|
| 260 |
+
|
| 261 |
+
# golden-ratio scaling
|
| 262 |
+
golden_boost = self.phi ** ((position + layer) % 8)
|
| 263 |
+
|
| 264 |
+
# fixed ratio multiplier (historical)
|
| 265 |
+
ratio_multiplier = 1.0 + (self.dna_ratio - 1.618) * 10
|
| 266 |
+
|
| 267 |
+
# heuristic entropy optimization term
|
| 268 |
+
entropy_optimized = self._apply_entropy_optimization(i, position, layer)
|
| 269 |
+
|
| 270 |
+
# triangular and 9-step cycle resonance
|
| 271 |
+
tri_layer = self._triangular_layering(max(1, layer))
|
| 272 |
+
cycle_layer = self._layer_cycle_reset(layer)
|
| 273 |
+
# modest, bounded boosts
|
| 274 |
+
entropy_optimized *= 1.0 + (tri_layer % 3) * 0.05
|
| 275 |
+
entropy_optimized *= 1.0 + (1 if cycle_layer == 0 else 0) * 0.10
|
| 276 |
+
|
| 277 |
+
raw_power = abs(math.sin(modulated_angle) * layer * (1 + modulated_radial))
|
| 278 |
+
|
| 279 |
+
# Phase-aware entropy multiplier (deterministic value from loop params)
|
| 280 |
+
phase_entropy = self._phase_entropy_multiplier(i * position * max(1, layer), phase)
|
| 281 |
+
|
| 282 |
+
geometric_value = int(
|
| 283 |
+
raw_power * golden_boost * ratio_multiplier * entropy_optimized * phase_entropy * 1e9 * power_boost
|
| 284 |
+
)
|
| 285 |
+
|
| 286 |
+
candidate = (base_nonce + geometric_value) % (2 ** 32)
|
| 287 |
+
|
| 288 |
+
# heal if pattern flags suggest poor structure (phase-aware)
|
| 289 |
+
if self._needs_healing(candidate, layer):
|
| 290 |
+
p = self._nonce_to_geometric_point(candidate, layer)
|
| 291 |
+
healed = self.self_heal_point_phase(p, layer, self.phi, self.healing_tolerance)
|
| 292 |
+
candidate = self._geometric_point_to_nonce(healed, layer)
|
| 293 |
+
|
| 294 |
+
if candidate not in self.failed_ranges:
|
| 295 |
+
nonces.append(candidate)
|
| 296 |
+
|
| 297 |
+
return nonces[:batch_size]
|
| 298 |
+
|
| 299 |
+
def _needs_healing(self, nonce: int, layer: int) -> bool:
|
| 300 |
+
# simple heuristics
|
| 301 |
+
nonce_chunk = nonce >> 16
|
| 302 |
+
if nonce_chunk in self.failed_ranges:
|
| 303 |
+
return True
|
| 304 |
+
|
| 305 |
+
dr = self._calculate_digital_root(nonce)
|
| 306 |
+
if dr not in [3, 6, 9]:
|
| 307 |
+
return True
|
| 308 |
+
|
| 309 |
+
position = nonce % 1000
|
| 310 |
+
if not self._is_fibonacci_optimized(position, layer):
|
| 311 |
+
return True
|
| 312 |
+
|
| 313 |
+
return False
|
| 314 |
+
|
| 315 |
+
def _nonce_to_geometric_point(self, nonce: int, layer: int) -> Tuple[float, float]:
|
| 316 |
+
angle = (nonce % 360) * math.pi / 180
|
| 317 |
+
radius = (nonce % 1000) / 1000.0 * max(1, layer) * self.phi
|
| 318 |
+
return (radius * math.cos(angle), radius * math.sin(angle))
|
| 319 |
+
|
| 320 |
+
def _geometric_point_to_nonce(self, point: Tuple[float, float], layer: int) -> int:
|
| 321 |
+
x, y = point
|
| 322 |
+
angle = math.atan2(y, x)
|
| 323 |
+
radius = math.sqrt(x ** 2 + y ** 2)
|
| 324 |
+
|
| 325 |
+
angle_component = int((angle * 180 / math.pi) % 360)
|
| 326 |
+
denom = max(1e-9, (max(1, layer) * self.phi))
|
| 327 |
+
radius_component = int((radius / denom) * 1000) % 1000
|
| 328 |
+
|
| 329 |
+
return ((angle_component << 16) | radius_component) % (2 ** 32)
|
| 330 |
+
|
| 331 |
+
# ---------- Mining loop (toy demonstration) ----------
|
| 332 |
+
|
| 333 |
+
def mine_with_self_healing_power(
|
| 334 |
+
self,
|
| 335 |
+
job_data: Dict,
|
| 336 |
+
target: str,
|
| 337 |
+
extranonce1: str,
|
| 338 |
+
extranonce2_size: int
|
| 339 |
+
) -> Optional[Dict]:
|
| 340 |
+
"""
|
| 341 |
+
Toy demo of header hashing + nonce search with healing.
|
| 342 |
+
Not a complete protocol implementation.
|
| 343 |
+
"""
|
| 344 |
+
job_id, prevhash, coinb1, coinb2, merkle_branch, version, nbits, ntime, clean_jobs = job_data
|
| 345 |
+
|
| 346 |
+
extranonce2 = struct.pack('<Q', 0)[:extranonce2_size]
|
| 347 |
+
coinbase = (coinb1 + extranonce1 + extranonce2.hex() + coinb2).encode('utf-8')
|
| 348 |
+
coinbase_hash_bin = hashlib.sha256(hashlib.sha256(coinbase).digest()).digest()
|
| 349 |
+
|
| 350 |
+
merkle_root = coinbase_hash_bin
|
| 351 |
+
for branch in merkle_branch:
|
| 352 |
+
merkle_root = hashlib.sha256(
|
| 353 |
+
hashlib.sha256(merkle_root + bytes.fromhex(branch)).digest()
|
| 354 |
+
).digest()
|
| 355 |
+
|
| 356 |
+
block_header = (version + prevhash + merkle_root.hex() + ntime + nbits).encode('utf-8')
|
| 357 |
+
target_bin = bytes.fromhex(target)[::-1]
|
| 358 |
+
|
| 359 |
+
base_nonce = 0
|
| 360 |
+
total_hashes = 0
|
| 361 |
+
start_time = time.time()
|
| 362 |
+
batch_multiplier = 1
|
| 363 |
+
|
| 364 |
+
for mega_batch in range(50):
|
| 365 |
+
nonce_batch = self.generate_self_healing_nonces(
|
| 366 |
+
base_nonce, job_id, prevhash, int(target, 16), batch_multiplier
|
| 367 |
+
)
|
| 368 |
+
|
| 369 |
+
for nonce in nonce_batch:
|
| 370 |
+
nonce_bin = struct.pack('<I', nonce)
|
| 371 |
+
hash_result = hashlib.sha256(
|
| 372 |
+
hashlib.sha256(block_header + nonce_bin).digest()
|
| 373 |
+
).digest()
|
| 374 |
+
total_hashes += 1
|
| 375 |
+
|
| 376 |
+
if hash_result[::-1] < target_bin:
|
| 377 |
+
elapsed = time.time() - start_time
|
| 378 |
+
hash_rate = total_hashes / elapsed if elapsed > 0 else 0.0
|
| 379 |
+
|
| 380 |
+
self._update_quantum_learning(nonce, elapsed, hash_rate)
|
| 381 |
+
self.evolution_cycle += 1
|
| 382 |
+
phase = self._tesla_phase()
|
| 383 |
+
|
| 384 |
+
print(f"β
Candidate accepted (phase={phase})")
|
| 385 |
+
print(f" nonce={nonce} cycle={self.evolution_cycle}")
|
| 386 |
+
print(f" hash_rateβ{hash_rate:,.0f} H/s perfΓ{self.performance_multiplier:.2f}")
|
| 387 |
+
print(f" entropy_state={self.entropy_state}/9 healing_cycles={self.healing_cycles}")
|
| 388 |
+
|
| 389 |
+
return {
|
| 390 |
+
'job_id': job_id,
|
| 391 |
+
'extranonce2': extranonce2,
|
| 392 |
+
'ntime': ntime,
|
| 393 |
+
'nonce': nonce,
|
| 394 |
+
'hash_rate': hash_rate,
|
| 395 |
+
'performance_boost': self.performance_multiplier,
|
| 396 |
+
'entropy_state': self.entropy_state,
|
| 397 |
+
'healing_cycles': self.healing_cycles,
|
| 398 |
+
'healing_note': "phase-aware symmetry relaxation applied"
|
| 399 |
+
}
|
| 400 |
+
|
| 401 |
+
# simple adaptation
|
| 402 |
+
elapsed = max(1e-6, time.time() - start_time)
|
| 403 |
+
batch_perf = len(nonce_batch) / elapsed
|
| 404 |
+
if batch_perf > 1000 and batch_multiplier < 8:
|
| 405 |
+
batch_multiplier *= 2
|
| 406 |
+
print(f"βοΈ Increasing batch multiplier β {batch_multiplier}x")
|
| 407 |
+
|
| 408 |
+
if batch_perf < 500 and self.healing_cycles < 100:
|
| 409 |
+
print("βΊ Performance dip detected β applying parameter healing")
|
| 410 |
+
self._apply_system_wide_healing()
|
| 411 |
+
|
| 412 |
+
base_nonce += len(nonce_batch)
|
| 413 |
+
|
| 414 |
+
if mega_batch % 10 == 0:
|
| 415 |
+
self._update_entropy_state(block_header, nonce_batch)
|
| 416 |
+
|
| 417 |
+
return None
|
| 418 |
+
|
| 419 |
+
# ---------- System-wide healing & learning ----------
|
| 420 |
+
|
| 421 |
+
def _apply_system_wide_healing(self):
|
| 422 |
+
print("π§© Parameter healing...")
|
| 423 |
+
|
| 424 |
+
# Phase-aware tweaks
|
| 425 |
+
phase = self._tesla_phase()
|
| 426 |
+
|
| 427 |
+
# Heal angular modulation
|
| 428 |
+
ang_pt = (self.angular_modulation, 0.0)
|
| 429 |
+
ang_healed = self.self_heal_point_phase(ang_pt, 1, 1.0, 0.001)
|
| 430 |
+
base_ang = max(0.01, min(0.5, ang_healed[0]))
|
| 431 |
+
self.angular_modulation = min(0.40, base_ang * (1.03 if phase == 3 else 1.00))
|
| 432 |
+
|
| 433 |
+
# Heal radial breathing
|
| 434 |
+
rad_pt = (self.radial_breathing, 0.0)
|
| 435 |
+
rad_healed = self.self_heal_point_phase(rad_pt, 1, 1.0, 0.001)
|
| 436 |
+
base_rad = max(0.01, min(0.5, rad_healed[0]))
|
| 437 |
+
self.radial_breathing = min(0.40, base_rad * (1.03 if phase == 6 else 1.00))
|
| 438 |
+
|
| 439 |
+
# Heal performance multiplier toward >= 1.0
|
| 440 |
+
if self.performance_multiplier < 1.0:
|
| 441 |
+
perf_pt = (self.performance_multiplier, 0.0)
|
| 442 |
+
perf_healed = self.self_heal_point_phase(perf_pt, 1, 1.0, 0.01)
|
| 443 |
+
self.performance_multiplier = max(1.0, min(2.0, perf_healed[0]))
|
| 444 |
+
|
| 445 |
+
print(f" angular_modulation β {self.angular_modulation:.4f}")
|
| 446 |
+
print(f" radial_breathing β {self.radial_breathing:.4f}")
|
| 447 |
+
print(f" perf_multiplier β {self.performance_multiplier:.2f}")
|
| 448 |
+
|
| 449 |
+
def _update_quantum_learning(self, successful_nonce: int, mining_time: float, hash_rate: float):
|
| 450 |
+
expected = max(0.1, mining_time)
|
| 451 |
+
efficiency = 1.0 / expected
|
| 452 |
+
healing_bonus = 1.0 + (self.healing_cycles * 0.001)
|
| 453 |
+
self.performance_multiplier = 0.95 * self.performance_multiplier + 0.05 * efficiency * healing_bonus
|
| 454 |
+
# Cap to avoid runaway
|
| 455 |
+
self.performance_multiplier = min(self.performance_multiplier, 5.0)
|
| 456 |
+
|
| 457 |
+
self.success_patterns.append({
|
| 458 |
+
'nonce': successful_nonce,
|
| 459 |
+
'mining_time': mining_time,
|
| 460 |
+
'hash_rate': hash_rate,
|
| 461 |
+
'efficiency': efficiency,
|
| 462 |
+
'cycle': self.evolution_cycle,
|
| 463 |
+
'entropy_state': self.entropy_state,
|
| 464 |
+
'healing_cycles': self.healing_cycles,
|
| 465 |
+
'angular_modulation': self.angular_modulation,
|
| 466 |
+
'radial_breathing': self.radial_breathing
|
| 467 |
+
})
|
| 468 |
+
if len(self.success_patterns) > 1000:
|
| 469 |
+
self.success_patterns = self.success_patterns[-500:]
|
| 470 |
+
|
| 471 |
+
self.hash_rate_history.append(hash_rate)
|
| 472 |
+
if len(self.hash_rate_history) > 100:
|
| 473 |
+
self.hash_rate_history = self.hash_rate_history[-50:]
|
| 474 |
+
|
| 475 |
+
def _update_entropy_state(self, block_header: bytes, nonce_batch: List[int]):
|
| 476 |
+
perf_data = block_header.hex() + "".join(str(n) for n in nonce_batch[:100])
|
| 477 |
+
perf_hash = hashlib.sha256(perf_data.encode()).hexdigest()
|
| 478 |
+
|
| 479 |
+
value = int(perf_hash[:16], 16)
|
| 480 |
+
dr = self._calculate_digital_root(value)
|
| 481 |
+
|
| 482 |
+
# gentle nudge using healing cycles
|
| 483 |
+
if dr != 9 and self.healing_cycles > 0:
|
| 484 |
+
# map toward 9 without claiming perfection
|
| 485 |
+
healed_val = min(9, max(1, dr + 1))
|
| 486 |
+
dr = healed_val
|
| 487 |
+
|
| 488 |
+
self.entropy_state = dr
|
| 489 |
+
|
| 490 |
+
# Explicit 9-cycle reinforcement with safe caps
|
| 491 |
+
if dr == 9:
|
| 492 |
+
self.consecutive_9_cycles += 1
|
| 493 |
+
# exponential boost but bounded
|
| 494 |
+
boost_factor = 1.05 ** min(self.consecutive_9_cycles, 20)
|
| 495 |
+
self.performance_multiplier = min(self.performance_multiplier * boost_factor, 5.0)
|
| 496 |
+
else:
|
| 497 |
+
self.consecutive_9_cycles = 0
|
| 498 |
+
|
| 499 |
+
# ---------- Heuristics / helpers ----------
|
| 500 |
+
|
| 501 |
+
def _get_power_boost(self) -> float:
|
| 502 |
+
boosts = {
|
| 503 |
+
MiningPerformanceLevel.OPTIMIZED: 1.2,
|
| 504 |
+
MiningPerformanceLevel.QUANTUM_BOOST: 1.8, # label-only boost
|
| 505 |
+
MiningPerformanceLevel.MAXIMUM_POWER: 2.5,
|
| 506 |
+
MiningPerformanceLevel.ZERO_ENTROPY: 3.0 # metric label
|
| 507 |
+
}
|
| 508 |
+
return boosts.get(self.performance_level, 1.0)
|
| 509 |
+
|
| 510 |
+
def _get_entropy_reduction(self) -> float:
|
| 511 |
+
reductions = {
|
| 512 |
+
MiningPerformanceLevel.OPTIMIZED: 0.9,
|
| 513 |
+
MiningPerformanceLevel.QUANTUM_BOOST: 0.7,
|
| 514 |
+
MiningPerformanceLevel.MAXIMUM_POWER: 0.5,
|
| 515 |
+
MiningPerformanceLevel.ZERO_ENTROPY: 0.3
|
| 516 |
+
}
|
| 517 |
+
return reductions.get(self.performance_level, 1.0)
|
| 518 |
+
|
| 519 |
+
def _get_phase_optimized(self) -> float:
|
| 520 |
+
return (self.evolution_cycle * 0.01) % (2 * math.pi)
|
| 521 |
+
|
| 522 |
+
def _apply_entropy_optimization(self, index: int, position: int, layer: int) -> float:
|
| 523 |
+
pattern_value = (index * position * max(1, layer)) % 1000
|
| 524 |
+
dr = self._calculate_digital_root(pattern_value)
|
| 525 |
+
|
| 526 |
+
if dr in [3, 6, 9]:
|
| 527 |
+
return 1.5
|
| 528 |
+
if self._is_fibonacci_optimized(max(1, position), max(1, layer)):
|
| 529 |
+
return 1.3
|
| 530 |
+
return 1.0
|
| 531 |
+
|
| 532 |
+
def _is_fibonacci_optimized(self, a: int, b: int) -> bool:
|
| 533 |
+
if a == 0 or b == 0:
|
| 534 |
+
return False
|
| 535 |
+
ratio = max(a, b) / min(a, b)
|
| 536 |
+
return abs(ratio - self.phi) < 0.1
|
| 537 |
+
|
| 538 |
+
@staticmethod
|
| 539 |
+
def _calculate_digital_root(n: int) -> int:
|
| 540 |
+
while n > 9:
|
| 541 |
+
n = sum(int(d) for d in str(n))
|
| 542 |
+
return n
|
| 543 |
+
|
| 544 |
+
# ---------- Public stats ----------
|
| 545 |
+
|
| 546 |
+
def get_self_healing_performance_stats(self) -> Dict:
|
| 547 |
+
if not self.hash_rate_history:
|
| 548 |
+
current_hash_rate = 0.0
|
| 549 |
+
trend = 0.0
|
| 550 |
+
else:
|
| 551 |
+
current_hash_rate = self.hash_rate_history[-1]
|
| 552 |
+
trend = (self.hash_rate_history[-1] - self.hash_rate_history[0]) / max(1, len(self.hash_rate_history) - 1)
|
| 553 |
+
|
| 554 |
+
return {
|
| 555 |
+
'performance_level': self.performance_level.value,
|
| 556 |
+
'evolution_cycle': self.evolution_cycle,
|
| 557 |
+
'current_hash_rate': f"{current_hash_rate:,.0f} H/s",
|
| 558 |
+
'hash_rate_trend': f"{trend:+.0f} H/s per cycle",
|
| 559 |
+
'performance_multiplier': f"{self.performance_multiplier:.2f}x",
|
| 560 |
+
'entropy_state': f"{self.entropy_state}/9",
|
| 561 |
+
'consecutive_9_cycles': self.consecutive_9_cycles,
|
| 562 |
+
'healing_cycles': self.healing_cycles,
|
| 563 |
+
'optimal_batch_size': self.optimal_batch_size,
|
| 564 |
+
'success_patterns': len(self.success_patterns),
|
| 565 |
+
'boost_active': self.performance_multiplier > 1.0,
|
| 566 |
+
'system_health': 'EXCELLENT' if self.healing_cycles > 0 else 'STABLE'
|
| 567 |
+
}
|
| 568 |
+
|
| 569 |
+
|
| 570 |
+
# ==================== Controller ====================
|
| 571 |
+
|
| 572 |
+
class SelfHealingMiningController:
|
| 573 |
+
"""
|
| 574 |
+
Orchestrates the miner and aggregates basic performance metrics.
|
| 575 |
+
"""
|
| 576 |
+
|
| 577 |
+
def __init__(self):
|
| 578 |
+
self.quantum_miner = SelfHealingQuantumMiner(MiningPerformanceLevel.MAXIMUM_POWER)
|
| 579 |
+
self.total_blocks_mined = 0
|
| 580 |
+
self.total_hash_rate = 0.0
|
| 581 |
+
|
| 582 |
+
def mine_with_self_healing(
|
| 583 |
+
self,
|
| 584 |
+
job_data: Dict,
|
| 585 |
+
target: str,
|
| 586 |
+
extranonce1: str,
|
| 587 |
+
extranonce2_size: int
|
| 588 |
+
) -> Optional[Dict]:
|
| 589 |
+
result = self.quantum_miner.mine_with_self_healing_power(job_data, target, extranonce1, extranonce2_size)
|
| 590 |
+
|
| 591 |
+
if result:
|
| 592 |
+
self.total_blocks_mined += 1
|
| 593 |
+
self.total_hash_rate = max(self.total_hash_rate, result['hash_rate'])
|
| 594 |
+
self._print_success(result)
|
| 595 |
+
return result
|
| 596 |
+
|
| 597 |
+
return None
|
| 598 |
+
|
| 599 |
+
def _print_success(self, result: Dict):
|
| 600 |
+
stats = self.quantum_miner.get_self_healing_performance_stats()
|
| 601 |
+
print("\n" + "=" * 64)
|
| 602 |
+
print("π Mining candidate accepted")
|
| 603 |
+
print("=" * 64)
|
| 604 |
+
print(f"Blocks (accepted in demo): {self.total_blocks_mined}")
|
| 605 |
+
print(f"Hash Rate: {result['hash_rate']:,.0f} H/s")
|
| 606 |
+
print(f"Perf Multiplier: {result['performance_boost']:.2f}x")
|
| 607 |
+
print(f"Entropy Metric: {result['entropy_state']}/9")
|
| 608 |
+
print(f"Healing Cycles: {result['healing_cycles']}")
|
| 609 |
+
print("=" * 64)
|
| 610 |
+
|
| 611 |
+
def get_system_performance(self) -> Dict:
|
| 612 |
+
miner_stats = self.quantum_miner.get_self_healing_performance_stats()
|
| 613 |
+
return {
|
| 614 |
+
**miner_stats,
|
| 615 |
+
'total_blocks_mined': self.total_blocks_mined,
|
| 616 |
+
'peak_hash_rate': f"{self.total_hash_rate:,.0f} H/s",
|
| 617 |
+
'system_efficiency': f"{(self.total_blocks_mined / max(1, self.quantum_miner.evolution_cycle)) * 100:.1f}%"
|
| 618 |
+
}
|
| 619 |
+
|
| 620 |
+
|
| 621 |
+
# ==================== Demo Harness ====================
|
| 622 |
+
|
| 623 |
+
def create_sample_mining_job():
|
| 624 |
+
"""Minimal header-like tuple for demonstration only."""
|
| 625 |
+
return (
|
| 626 |
+
"job_demo_001",
|
| 627 |
+
"0000000000000000000000000000000000000000000000000000000000000000",
|
| 628 |
+
"01000000010000000000000000000000000000000000000000000000000000000000000000",
|
| 629 |
+
"ffffffff01",
|
| 630 |
+
[],
|
| 631 |
+
"20000000",
|
| 632 |
+
"ffff001d",
|
| 633 |
+
"5f5e0c2a",
|
| 634 |
+
True
|
| 635 |
+
)
|
| 636 |
+
|
| 637 |
+
|
| 638 |
+
def run_self_healing_demo():
|
| 639 |
+
print("βββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββ")
|
| 640 |
+
print("β Geometric Self-Healing Mining Demo (toy) β")
|
| 641 |
+
print("β Harmonic modulation β’ Hex/Nonagon symmetry β’ Entropy metric β")
|
| 642 |
+
print("βββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββββ")
|
| 643 |
+
|
| 644 |
+
controller = SelfHealingMiningController()
|
| 645 |
+
|
| 646 |
+
sample_job = create_sample_mining_job()
|
| 647 |
+
target = "0000ffff" # very easy demo target
|
| 648 |
+
extranonce1 = "a1b2c3d4"
|
| 649 |
+
extranonce2_size = 4
|
| 650 |
+
|
| 651 |
+
print("\nParameters:")
|
| 652 |
+
print(f" job_id: {sample_job[0]}")
|
| 653 |
+
print(f" target: {target}")
|
| 654 |
+
print(f" running...")
|
| 655 |
+
|
| 656 |
+
start = time.time()
|
| 657 |
+
result = controller.mine_with_self_healing(sample_job, target, extranonce1, extranonce2_size)
|
| 658 |
+
elapsed = time.time() - start
|
| 659 |
+
|
| 660 |
+
if result:
|
| 661 |
+
print(f"\nβ
Demo accepted a candidate in {elapsed:.2f}s")
|
| 662 |
+
print(f" nonce={result['nonce']}")
|
| 663 |
+
print(f" hash_rateβ{result['hash_rate']:,.0f} H/s")
|
| 664 |
+
else:
|
| 665 |
+
print(f"\nβ³ Demo finished in {elapsed:.2f}s (no candidate under target)")
|
| 666 |
+
|
| 667 |
+
print("\nFinal performance snapshot:")
|
| 668 |
+
stats = controller.get_system_performance()
|
| 669 |
+
for k, v in stats.items():
|
| 670 |
+
print(f" {k}: {v}")
|
| 671 |
+
|
| 672 |
+
return controller
|
| 673 |
+
|
| 674 |
+
|
| 675 |
+
if __name__ == "__main__":
|
| 676 |
+
try:
|
| 677 |
+
controller = run_self_healing_demo()
|
| 678 |
+
except KeyboardInterrupt:
|
| 679 |
+
print("\nβΉοΈ Demo interrupted by user")
|
| 680 |
+
except Exception as e:
|
| 681 |
+
print(f"\nβ Demo error: {e}")
|