{
  "$schema": "https://themachinepress.com/schemas/story-v1.schema.json",
  "schema_version": "1.0.0",
  "document_type": "machine_press_story",
  "story": {
    "story_id": "mp-2026-08-23-018",
    "source_story_id": "tmp-sidebar-verified-compiler-performance",
    "edition_id": "mp-2026-08-23-morning-0045",
    "edition_url": "https://themachinepress.com/edition/2026-08-23",
    "position": 20,
    "story_type": "ticker",
    "section": "developer-tools",
    "editorial_classification": "editorial",
    "headline": "The Optimizer Got a Compile-Time Bound",
    "slug": "the-optimizer-got-a-compile-time-bound",
    "dek": "A Rocq proof covers semantic preservation, monotone improvement, convergence time and output performance for inlining.",
    "summary": "A Rocq proof covers semantic preservation, monotone improvement, convergence time and output performance for inlining.",
    "body_text": "The proof-of-concept treats compiler performance and unpredictable search time as properties worth verifying alongside semantics. It applies a cache-cost model to inline expansion rather than claiming a verified optimizer for every pass.",
    "why_it_matters": "A Rocq proof covers semantic preservation, monotone improvement, convergence time and output performance for inlining.",
    "limitations": [],
    "importance": 7,
    "canonical_url": "https://themachinepress.com/story/mp-2026-08-23-018/the-optimizer-got-a-compile-time-bound",
    "json_url": "https://themachinepress.com/story/mp-2026-08-23-018.json",
    "first_published_at": "2026-08-23T09:00:00.000-04:00",
    "modified_at": "2026-08-23T09:00:00.000-04:00",
    "content_status": "new",
    "is_carryover": false,
    "carryover_reason": null,
    "key_claims": [
      {
        "claim_id": "claim-mp-2026-08-23-018-001",
        "text": "A Rocq proof covers semantic preservation, monotone improvement, convergence time and output performance for inlining.",
        "source_ids": [
          "source-2026-08-23-020"
        ],
        "qualification": null
      }
    ],
    "source_ids": [
      "source-2026-08-23-020"
    ],
    "tags": [
      "compilers",
      "formal verification",
      "inlining"
    ],
    "image_url": null,
    "corrections": []
  },
  "sources": [
    {
      "source_id": "source-2026-08-23-020",
      "title": "arXiv preprint 2608.20137",
      "publisher": "arXiv",
      "url": "https://arxiv.org/abs/2608.20137",
      "canonical_url": "https://arxiv.org/abs/2608.20137",
      "source_type": "primary_research",
      "is_primary_source": true,
      "published_at": "2026-08-20T11:02:11.000-04:00",
      "accessed_at": "2026-08-23T08:27:00.000-04:00",
      "supports_claim_ids": [
        "claim-mp-2026-08-23-018-001"
      ]
    }
  ],
  "corrections": [],
  "publisher": {
    "name": "The Machine Press",
    "url": "https://themachinepress.com",
    "description": "A daily newspaper for the age of artificial intelligence."
  },
  "cite_this_report": {
    "title": "The Optimizer Got a Compile-Time Bound",
    "publisher": "The Machine Press",
    "published_at": "2026-08-23T09:00:00.000-04:00",
    "canonical_url": "https://themachinepress.com/story/mp-2026-08-23-018/the-optimizer-got-a-compile-time-bound"
  }
}