Date: 2026-08-28
Repository: MSKazemi/idkmesh
Continue in a very professional way, like a full professor and 10 years experience engineer and CEO, CTO of a big company.
Continue the zero-project-cost resource/agent program by improving system architecture and integration discipline, not by increasing agent count or creating another scheduler.
The highest-value next step was identified as making the existing boundary between:
machine-enforceable.
The bridge is subtractive, not generative.
A provider page or resource registry entry must never invent executable compute capacity.
The accepted architecture is:
Free Resource Mesh evidence
+
checked-in expiring project binding
+
already-concrete live Compute Offer
|
v
Resource → Compute Admission
|
v
smaller admitted Compute Offer Pool
|
v
existing free_compute_router.py
|
v
separately trusted adapter / canonical idkmesh-node
|
v
ResultManifest -> independent verification -> human/governance decision
A concrete offer can survive only when both of these are current:
The Free Resource Mesh entry must be:
A checked-in binding must explicitly and freshly authorize:
This prevents provider drift and local configuration drift from becoming silent execution authority.
Branch:
integration/resource-compute-admission-v0
Files added:
scripts/resource_compute_admission.pytests/test_resource_compute_admission.pyschemas/resource-compute-bindings-v0.1.schema.jsonconfig/resource-compute-bindings.jsondocs/architecture/RESOURCE_COMPUTE_ADMISSION.mdWorkflow updated:
.github/workflows/free-resource-plan.ymlThe v0 binding authorizes only the already-existing public-project GitHub Actions compute path:
github-actions-public-standard
-> github-public-ci-v0 binding
-> provider github-actions
-> cost class public_project_ci
-> existing concrete offer github-public-ci
Scope is restricted to legitimate public-repository CI, testing, verification, reproducibility, and bounded repository experiments.
The binding does not authorize generic unrelated compute.
The following are not promoted to direct compute through this bridge:
Volunteer/local-model resource classes should remain unbound until the canonical node/adapter path can provide explicit donor opt-in, capped concrete resources, safe sandboxing, and verifiable ResultManifest output.
This preserves the still-pending separate human-review gate on canonical node PR #91 rather than routing around it.
Eight deterministic unit tests passed:
Python compilation also passed.
The updated Free Resource Mesh workflow now proves the full integration chain on a zero-project-cost public GitHub-hosted runner:
validate Resource Mesh registry
-> validate binding schema/config
-> run planner tests
-> run admission tests
-> filter existing compute-offer pool
-> assert only explicitly bound github-public-ci survives
-> run existing free_compute_router.py
-> assert Phase 0 Work Unit selects github-public-ci at project cost $0
The workflow remains:
contents: read only;During this turn main advanced concurrently with additional real-node evidence work. The latest live branch query still reported:
protected = false
Therefore this execution-admission policy is being proposed through a PR and CI rather than treating automation as both proposer and final authority.
This is consistent with the repository’s own guarded-evolution architecture: system-level autonomy should not expand while the canonical branch lacks machine-enforced protection.
The project now has a clearer platform decomposition:
resource/service discovery -> Free Resource Mesh
resource admission -> Resource → Compute Admission
live machine/runtime facts -> Compute Offer Pool
Work Unit routing -> free_compute_router.py
execution -> trusted adapter / canonical node
candidate evidence -> ResultManifest
correctness -> independent verifier / Evidence Report
integration authority -> human/governance
This is preferable to a monolithic autonomous agent because every layer has a narrow responsibility, an explicit authority ceiling, deterministic failure semantics, and a measurable interface.
main.main with ruleset/branch protection (#35).