{
  "schema_version": "1.0.0",
  "artifact_id": "new-fractals",
  "title": "New Fractals public assessment",
  "date": "2026-08-01",
  "source_sha256": "dc0c7bc1ccc0d7b411716495df84932a5f37fb6573e8891dbdfcc5d782903ee9",
  "decision": "PUBLISH_AS_BOUNDED_LABS_INSTRUMENT",
  "evidence_state": "LOCALLY_VERIFIED",
  "implemented": [
    "five affine or recursive-replacement studies",
    "one adaptive centroid-partition study",
    "two variable-degree polynomial-root tree studies",
    "interactive browser-local Canvas explorer",
    "source-stage Web Audio synthesizer",
    "source-stage FastAPI and SciPy spatial-reuse simulator"
  ],
  "verified_public_surface": {
    "route": "/labs/new-fractals",
    "design_count": 8,
    "network_required": false,
    "user_data_stored": false,
    "typescript_compile": "PASS",
    "browser_smoke": "PASS",
    "mobile_overflow_check": "PASS"
  },
  "corrected_values": {
    "nexus_trellis_scale_proxy": 1.3570186369,
    "dawless_signal_fold_scale_proxy": 1.3836275672,
    "orchestration_cascade_scale_proxy": 1.6775669839,
    "vitrified_mycelium_scale_proxy": 1.5196603538,
    "shattered_lattice_nominal_scale_proxy": 1.7836343623,
    "cytoplasmic_tessellation": "NOT_MEASURED"
  },
  "refused_claims": [
    "certified Hausdorff dimensions from unverified similarity equations",
    "formal novelty or priority",
    "cryptographic content-addressable storage",
    "collision-resistant identity in a finite N! path lattice",
    "whole-workflow O(log N) insertion while rebuilding cKDTree after writes",
    "deployed audio or Python backend functionality"
  ],
  "spatial_test": {
    "max_generation": 5,
    "terminal_path_capacity": 120,
    "same_payload_reproduced_path": true,
    "distinct_payload_full_path_collision_observed": true
  },
  "limitations": [
    "dimension proxies are not measured dimensions",
    "overlap and separation conditions remain untested",
    "standalone public build excludes Three.js/Web Audio and FastAPI surfaces",
    "source review is not a patent or exhaustive prior-art search"
  ]
}