pythagoras 0.25.6__tar.gz → 0.25.7__tar.gz

{pythagoras-0.25.6 → pythagoras-0.25.7}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.3
 Name: pythagoras
-Version: 0.25.6
+Version: 0.25.7
 Summary: Planet-scale distributed computing in Python.
 Keywords: cloud,ML,AI,serverless,distributed,parallel,machine-learning,deep-learning,pythagoras
 Author: Volodymyr (Vlad) Pavlov
@@ -97,6 +97,8 @@ preferred functional patterns, augmented by new capabilities.
 
 ## Videos
 
+* [15-minute Demo](https://pythagoras.link/15-min-demo)
+
 * [Data Phoenix Webinar, August 27, 2025](https://youtu.be/eb6_atu1RQI) ([slides](https://docs.google.com/presentation/d/1fGBqnp0aqVHPJ-BYGYnUll1_TJI_WObAbEVX89Z3-yA))
 
 

{pythagoras-0.25.6 → pythagoras-0.25.7}/README.md

@@ -41,6 +41,8 @@ preferred functional patterns, augmented by new capabilities.
 
 ## Videos
 
+* [15-minute Demo](https://pythagoras.link/15-min-demo)
+
 * [Data Phoenix Webinar, August 27, 2025](https://youtu.be/eb6_atu1RQI) ([slides](https://docs.google.com/presentation/d/1fGBqnp0aqVHPJ-BYGYnUll1_TJI_WObAbEVX89Z3-yA))
 
 

{pythagoras-0.25.6 → pythagoras-0.25.7}/pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "uv_build"
 
 [project]
 name = "pythagoras"
-version = "0.25.6"
+version = "0.25.7"
 authors = [
     {name = "Volodymyr (Vlad) Pavlov", email = "vlpavlov@ieee.org"},
 ]

{pythagoras-0.25.6 → pythagoras-0.25.7}/src/pythagoras/_080_pure_code_portals/recursion_pre_validator.py

@@ -50,12 +50,17 @@ def _recursion_pre_validator(
         raise TypeError(f"Parameter '{param_name}' must be int, got {type(param_value).__name__}")
     if param_value < 0:
         raise ValueError(f"Parameter '{param_name}' must be non-negative, got {param_value}")
-    if param_value in {0,1}:
+    if param_value in {0,1,2,3,4}:
         return pth.VALIDATION_SUCCESSFUL
-    
+    unpacked_kwargs[param_name] = param_value - 1
+    result_addr = pth.PureFnExecutionResultAddr(
+        fn=fn, arguments=unpacked_kwargs)
+    if result_addr.ready:
+        return pth.VALIDATION_SUCCESSFUL
+    result = result_addr.call_signature
+
     # Binary search to find the smallest n where result_addr.ready is not True
-    left, right = 2, param_value - 1
-    result = pth.VALIDATION_SUCCESSFUL  # Default result if all are ready
+    left, right = 2, param_value - 2
     
     while left <= right:
         mid = (left + right) // 2
@@ -72,7 +77,6 @@ def _recursion_pre_validator(
             # Result is ready, search in the right half
             left = mid + 1
 
-    
     return result