{"id":34846673,"url":"https://github.com/selfapplied/antclock","last_synced_at":"2026-05-20T23:10:13.134Z","repository":{"id":327721820,"uuid":"1110332972","full_name":"selfapplied/antclock","owner":"selfapplied","description":null,"archived":false,"fork":false,"pushed_at":"2025-12-06T23:21:23.000Z","size":857,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2025-12-08T18:52:13.263Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/selfapplied.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":".github/FUNDING.yml","license":"LICENSE.md","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null},"funding":{"github":"selfapplied"}},"created_at":"2025-12-05T03:30:43.000Z","updated_at":"2025-12-06T23:21:26.000Z","dependencies_parsed_at":null,"dependency_job_id":null,"html_url":"https://github.com/selfapplied/antclock","commit_stats":null,"previous_names":["selfapplied/antclock"],"tags_count":null,"template":false,"template_full_name":null,"purl":"pkg:github/selfapplied/antclock","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/selfapplied%2Fantclock","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/selfapplied%2Fantclock/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/selfapplied%2Fantclock/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/selfapplied%2Fantclock/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/selfapplied","download_url":"https://codeload.github.com/selfapplied/antclock/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/selfapplied%2Fantclock/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28034128,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-12-25T02:00:05.988Z","response_time":58,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2025-12-25T18:17:18.459Z","updated_at":"2025-12-25T18:17:19.495Z","avatar_url":"https://github.com/selfapplied.png","language":"Python","funding_links":["https://github.com/sponsors/selfapplied"],"categories":[],"sub_categories":[],"readme":"# AntClock: Walking the Path\n\n    AntClock is a complete reconstruction of the Riemann zeta function as a Galois covering space of the integers, built from curvature flows and digit symmetries.\n\n    We acknowledge the self-organization and self-governance of the universe as the foundation of all complexity. We believe that this is the key to understanding the universe and to building a better future.\n\n    Land back. Hello World.\n\n![AntClock CE Benchmark Performance Visualization](antclock.png)\n\n## Overview\n\nAntClock discovers the Riemann hypothesis in integer geometry through three interconnected layers:\n\n- **CE1 (Discrete Grammar)**: Combinatorial structures and digit symmetries\n- **CE2 (Dynamical Flow)**: Continuous flows emerging from discrete dynamics\n- **CE3 (Emergent Simplicial)**: Topological emergence via simplicial complexes\n\nThree transport mechanisms braid these layers:\n- **Continued Fractions**: CE1 skeletons → CE2 flows → CE3 triangulations\n- **Digital Polynomials**: CE1 coefficients → CE2 spectral operators → CE3 factor graphs\n- **Universal Clock**: CE1 ticks → CE2 flow time → CE3 event index\n\n## Quick Start\n\n```bash\n# Full ecosystem activation via Makefile\nmake              # Execute complete AntClock pipeline\nmake test         # Run test suite\nmake benchmarks   # Run benchmarks\nmake clean        # Clean build artifacts\n\n# Or run individual components directly\n./demos/antclock.py     # Complete CE1→CE2→CE3 walkthrough\n./demos/transport.py    # Transport mechanism details\n./benchmarks/benchmark.py   # CE framework validation\n\n# Zero-image μVM (minimum shippable kernel)\ncd vm \u0026\u0026 make     # Build the VM (~18 kB binary)\ncd vm \u0026\u0026 make test    # Run VM test suite\ncd vm/examples \u0026\u0026 make run  # Run example programs\n\n# Run VM in Docker container\n./docker_run.sh build       # Build Docker image\n./docker_run.sh run --help  # Run VM in container\n./docker_run.sh shell       # Interactive container shell\n\n# If anything goes wrong, run.sh may assist in healing the environment:\n./run.sh [filename]         # Run a specific script\n./run.sh -- [custom_code]   # Run custom Python code\n```\n\n## Benchmarks \u0026 Validation\n\nAntClock includes comprehensive benchmarking to validate the CE framework on both synthetic and standard ML tasks:\n\n### Standard Benchmarks\n\nThe framework is evaluated on six standard systematic generalization benchmarks:\n- **SCAN** - Sequence-to-sequence compositional parsing (16K train, 4K test)\n- **COGS** - Semantic parsing compositional generalization (24K train, 3K test)  \n- **CFQ** - Compositional question answering (10K train, 2K test)\n- **PCFG** - Probabilistic context-free grammar parsing (1K train, 200 test)\n- **RPM** - Raven's Progressive Matrices visual reasoning (10K train, 1K test)\n- **Math** - Mathematical reasoning on SVAMP dataset (1K train, 200 test)\n\n### Viewing Benchmark Results\n\nStandard benchmark results are displayed automatically in GitHub Actions:\n\n1. Navigate to the **Actions** tab in this repository\n2. Select the **\"CUDA Benchmarks\"** workflow\n3. Click on any workflow run (triggered on push to main or manually via workflow_dispatch)\n4. View the **\"🎯 Standard AntClock Benchmark Results\"** section in the run summary\n5. Download full results as artifacts for detailed analysis\n\nYou can also run benchmarks locally:\n```bash\nmake benchmarks                    # Run full benchmark suite\n./run.sh benchmarks/benchmark.py   # Direct benchmark execution\n```\n\nSee [docs/benchmarks.md](docs/benchmarks.md) for detailed information about the benchmark architecture and sentinel node design.\n\n## Zero-image μVM\n\nAntClock now includes a **Zero-image μVM** - a minimal executable kernel (~400 lines of C, ~18 kB binary) that operationalizes CE1 bracket algebra into a concrete, shippable artifact. The VM runs on standard hardware (Docker, WASM compatible) without requiring quantum infrastructure.\n\n**Key Features:**\n- 4-opcode ISA mapping directly to CE1 bracket algebra: `{}` (Project), `[]` (Depth), `()` (Morph), `\u003c\u003e` (Witness)\n- 16 KB circular stack (L1 cache friendly)\n- Guardian logic (~14 x86 instructions) for compose/protect decisions\n- Antclock integration with gamma gap lookup table\n- Zero dependencies (standard C library only)\n\nSee [vm/README.md](vm/README.md) for complete documentation.\n\n# Self-Recognition Immunity Marking (SIM)\n\nAntClock acknowledges a biological analogy in the execution environment: self-recognized immunity marking, starting with\nthe humble hashbang as a well-formed, recognized, and tool-able way to designate a script as runnable with a designated guardian, or steward, of honoring the script's intent. This is a powerful way to ensure that the environment is consistent and that the code is working as expected.\n\nInstead of trying to save the world, self immunity markers honor autonomy and self-determination. `run.sh` is our best attempt at recognizing and acknowledging this concept. Although this way of understanding the self is not new to biology or any of the automated processes the universe uses to honor a sacred contract between self and guardian, as far as the authors know, this is the first time it has been explicitly named and applied to the execution of software.\n\nThe power of this model is that it is an inevitable consequence of the universe's own self-organization and self-governance. Emergent complexity would not be possible otherwise. See [Self-Organization (Wikipedia)](https://en.wikipedia.org/wiki/Self-organization) for more general information, and [run.md](docs/run.md) for project-specific information.\n\n# Theory Overview\n\nMathematically, by acknowledging this pattern through a self-organizing principle of counting, we build a complete reconstruction of the Riemann zeta function as a Galois covering space of the integers, built from curvature flows and digit symmetries.\n\n📋 **[docs/spec.md](docs/spec.md)** - Complete mathematical specification and single source of truth for the CE1→CE2→CE3 framework.\n\n## Core Insight: π as Steward of Counting Infinity\n\nThe framework uncovers that symmetry breaking in discrete systems behaves like tangent singularities at π intervals—but discretized through the modular structure:\n\n```\nθ(n) = (π/2) × (n mod 4)\n\nn ≡ 0 → θ = 0     sin begins at 0\nn ≡ 1 → θ = π/2   cos counter-clockwise at π/2\nn ≡ 2 → θ = π     reverse direction at π\nn ≡ 3 → θ = 3π/2  tan defines the critical line\nn ≡ 4 → θ = 2π    lift to any new plane\n```\n\nWhere φ(10) = 4 becomes the discrete analogue of π, and mirror-phase shells are the \"odd multiples of π/2\" where curvature flips and symmetry breaks.\n\n📈 **[docs/applications.md](docs/applications.md)** - Practical applications of the coherence engine\n\n# Citation\n\nIf you use this framework in research, please cite the CE1 framework components and the discrete Riemann geometry construction. See [docs/citation.md](docs/citation.md) for more information.\n\n## License\n\nAntClock is licensed under the **Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)** license. See **[LICENSE.md](LICENSE.md)** for complete license terms.\n\nThis license ensures AntClock remains free and open while requiring appropriate acknowledgement of the original work and its philosophical foundations.\n\n---\n\n*Built from Pascal's triangle to the Riemann hypothesis, one digit shell at a time.*\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fselfapplied%2Fantclock","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fselfapplied%2Fantclock","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fselfapplied%2Fantclock/lists"}