Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
15 changes: 15 additions & 0 deletions research/p111-line7-query-price/NOTICE.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,15 @@
SPDX-License-Identifier: Apache-2.0

The pinned word and centre seed are byte copies of Rohan Arun's PR #1525 at
`90d39a5603c7fbfd8d8d957e9732d9b6ebd6317f`, paths
`research/p111-early-merge-query/inputs/word-base.json.gz` and
`research/p111-early-merge-query/CENTRE-SEED.json`. That draft retains the
PR1297 word, the PR1134 arithmetic, and the PR1060 physical model, with the
notices in that package. Those predecessor files are not modified here.

The containment test is the same subspace test as PR1060 `model.py`. This
package reimplements that one predicate; it does not vendor or replay the
PR1060 compiler.

New checks and text: unpaidmoon, with substantial Cursor Grok assistance.
Apache-2.0. No independent human review is claimed.
82 changes: 82 additions & 0 deletions research/p111-line7-query-price/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,82 @@
# Line-span(7) query does not beat its zero-frame scatter

**No new κ.** Selected conditional κ stays `781451/250000000`. Discussion #1166
comment
[19143427](https://github.com/CrocSwap/integer-mult-bounds/discussions/1166#discussioncomment-19143427)
already stopped one triangular continuation of Rohan Arun's draft PR #1525 at
`90d39a5603c7fbfd8d8d957e9732d9b6ebd6317f`, and left the evidence in local paths.
This package replays that scatter identity from the pinned bytes and checks the
constructor fact the handoff left open: `model.move` rejects a descent from
`span(7)` to the zero frame.

## Result

Puncture 0 builds `q = (c61 + c63 + c31 + c256) / 2`. On the pinned word, the
copied query is the line `span(7)`. The retained cut is 176 zero-frame centre
ADDs, 22 from each of the eight centres. The triangular substitution

- column 61 becomes twice itself,
- columns 63, 31 and 256 each lose column 61,

reproduces every original scatter linear form. Each of the 112 outputs is a
vector on the 704 roles. This check does not replay section B. The corrected
matrix has 230 nonzero ADD entries, exactly 54 more. Those 54 split by support:
column 63 overlaps column 61 in 8 rows and cancels 4 of them (`+10`), while
columns 31 and 256 are disjoint from column 61 (`+22` each). JoyboyBrian's
handoff already recorded the 230-versus-176 census. The overlap split is checked
here.

All 62 dirty columns of `q` already appear in those original outputs. A final
map that equals the original scatter therefore keeps every one of them. A final
map that zeroes any of them does not deliver the original target outputs.

The PR1060 constructor `move` admits a change only when the old frame is
contained in the new one. `contained((7,), ())` is false, so that constructor
rejects moving the query register from `span(7)` to the zero frame. The handoff
priced the same conversion if a paid rank-1 copy is granted instead, and the
profiles it named are `{1: 4, 8: 1}` and `{1: 5, 8: 1}`. For every positive
integer power tariff those two multisets differ by exactly 1. The same strict
increase holds for every tariff that gives rank 1 a positive price and prices
no other rank differently. The 54 extra ADDs are further nonnegative scalar
cost on this matrix.

## What this does not show

This does not price a scatter that consumes the line-7 query directly, a
different correction matrix, whole-call owners, precision, tape, compiler, or
outer admission. It does not replay section B and it does not change the
selected frontier. The handoff's local scripts remain unpublished; these checks
recompute the scatter identity from the pinned word and centre seed.

## Reproduction

Python 3.12, standard library only:

```sh
python3 -B research/p111-line7-query-price/verify.py
python3 -B scripts/research_package.py --package research/p111-line7-query-price
```

Expected first line: `PASS_P111_LINE7_QUERY_PRICE delta_adds 54 dirty_visible 62 line_to_zero_move False NO_NEW_KAPPA`.

The word SHA-256 is `e8e6e78ff7422275c38324499e1f33fb2ecd30de9503aef2b8f1ee80d8c4df8e`.
Failure controls inside the verifier: omitting the three partner corrections
changes an output, and the containment test rejects the line-to-zero move.

## Open next questions

1. Can a continuation whose 22 query receivers stay at `span(7)` until their
original final frames are restored beat `{1: 4, 8: 1}` after every restoration
copy is charged? The scalar cut does not record those final frames.
2. Is there a correction other than this triangular substitution that preserves
the 112 output forms with no extra rank-1 child and fewer than 230 ADDs?

## Credit

Word, centre seed and query formula: Rohan Arun, PR #1525, with the retained
PR1297 / PR1134 / PR1060 lineage in that package's NOTICE. The triangular
relation, the 230-versus-176 census, and the conditional `{1: 4, 8: 1}` to
`{1: 5, 8: 1}` bill are JoyboyBrian's, comment 19143427; that note labelled its
checker local-only. Frame containment is the test in PR1060 `model.py`
(`contained`). This replay and the support split were prepared by unpaidmoon
with substantial Cursor Grok assistance. Apache-2.0.
32 changes: 32 additions & 0 deletions research/p111-line7-query-price/SOURCES.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,32 @@
{
"schema_version": 1,
"base_commit": "7c49fe32c55de02c2c873655c804b16e4c3fef0a",
"files": [
{
"path": "docs/research/agent-task-catalog.json",
"usage": "provenance",
"git_blob": "3404fbdd5e7529a0674eef26114b5071e4586cec",
"sha256": "ead6cdc9d0af6d58e8a49744d8ec8c7c15e13d2ba93c276c434bcf9b51b93a81"
},
{
"path": "certificates/selected-result.json",
"usage": "provenance",
"git_blob": "d59b5035e7b4cbaa9d688a1d32dd0d6eb79c466a",
"sha256": "9b8d0eea95b3bf0dfcb7938a732a6439b87a2685dec2a5ab9e525b3b34debbfa"
},
{
"path": "research/p111-line7-query-price/inputs/word-base.json.gz",
"usage": "input",
"pin": "head:af24d3b04e9d93906ed3c5a6262972fecfe5388a:research/p111-line7-query-price/inputs/word-base.json.gz",
"git_blob": "eacf8c773cb50637f93a762342b3b5f0853fe29a",
"sha256": "e8e6e78ff7422275c38324499e1f33fb2ecd30de9503aef2b8f1ee80d8c4df8e"
},
{
"path": "research/p111-line7-query-price/inputs/CENTRE-SEED.json",
"usage": "input",
"pin": "head:af24d3b04e9d93906ed3c5a6262972fecfe5388a:research/p111-line7-query-price/inputs/CENTRE-SEED.json",
"git_blob": "d5bea849fdde3bb43d38ff44d7b5a2c34e754954",
"sha256": "228e178662fc01895bbcd8472a52114d3a3d11ea8c7ae44d99cd1c8cf9e89147"
}
]
}
90 changes: 90 additions & 0 deletions research/p111-line7-query-price/TASK.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,90 @@
{
"schema_version": 1,
"task_id": "joint-query-controller",
"priority_revision": 8,
"base_commit": "7c49fe32c55de02c2c873655c804b16e4c3fef0a",
"original_card": {
"id": "joint-query-controller",
"question": "Can a changed query demand or caller remove real work while satisfying native chronology and restoration?",
"starting_points": [
"docs/research/current-priorities.md",
"docs/research/research-family-status.md",
"certificates/selected-result.json",
"docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md"
],
"methods": [
"Construct and independently check one source-bound instance of the stated first experiment.",
"Seek an exact counterexample or target-specific complete-budget obstruction to that same proposed change."
],
"acceptance_gate": "A source-bound arbitrary-input identity and legal producer/consumer boundary with the complete paid and productive target invoice, including restoration, ownership, native alignment and extra charges. Price under the actual current model; historical ceiling.py assumptions must be established before use. A favorable optimistic relaxation keeps a route open but is not a completed supplier. A scoped local result remains useful; expansion requires the family-level budget gate.",
"first_step": {
"command": [
"python3",
"-B",
"scripts/research_selected_baseline.py"
],
"expected": "PASS_RESEARCH_BASELINE_BINDINGS_ONLY",
"inspect": "Read revision 8, the selected review and live exact-source handoffs. Then follow this card's bounded first_experiment.",
"scope": "Source-bound orientation only, not a supplier replay or theorem proof."
},
"first_experiment": "Choose an exact caller and a new demand/interface hypothesis. Read the scoped #5617/#5631/#5649/#5747 and #5720/#5745 objections before rebuilding an excluded schedule. Compare the complete matched source/consumer protocols including all retained helper outputs. For an active-mode injection, first check #5745: its canonical delivery claim repays the eight removed centre jobs. Audit that exact claim or change its channel/feedback hypothesis; do not repeat the same free-injection search. Stop if the full favorable budget fails or the required restored output is unobservable.",
"bottleneck_link": "Judge the actual current supplier contract and complete signed target/paid bill; frozen-profile ceilings require an applicability proof.",
"allowed_variations": [
"One exact source head, helper/cut region or quantified proposition and changed hypothesis; check live handoffs first. Different seeds are not different scopes."
],
"scope_change_triggers": [
"Changing source head, helper/cut domain, operation alphabet or caller boundary without recording the new scope.",
"Treating an archived proposal or local numerical pass as complete supplier admission."
],
"overlap_terms": [
"query demand",
"active mode",
"5720",
"5745",
"5747",
"caller"
],
"existing_checks": [
{
"scope": "PR #4166: author-checked installed producer/service/return/bridge connection; native-component comparison loses.",
"evidence": "research/qq16-caller-install/README.md",
"remaining": "Complete matched physical protocol bill, or changed source-compatible demand/circuit; no affordable supplier yet.",
"status": "author-checked",
"source_commit": "0b082d22a0e9a442d264ab0633e35ef26c790630",
"selected_record_sha256": "bb2eaa58647b353f88d0aec2eafb9d30df1be53589231b23e12ceef3e4bad129"
},
{
"scope": "Selected PR5599: complete helper-subspace construction and independent caller replay; five framework assumptions remain.",
"evidence": "docs/research/pr-intake-evidence/pr5599-completion/PROOF-REVIEW.md",
"remaining": "The next experiment must identify uncovered source-specific work. Successor archive intake does not transfer this admission.",
"status": "reviewed",
"source_commit": "09dd0965711ca7eeb169057a420abab1c9052137",
"selected_record_sha256": "2a0220e866417774606e0f991e41b9c1d26b1f43b97857238cf478dbc7d330b5"
}
]
},
"scope_status": "refined",
"actual_scope": "For the exact PR #1525 puncture-0 / pivot-61 query at span(7), does the triangular zero-frame canonicalization (double column 61 and subtract it from columns 63, 31 and 256) deliver the original scatter outputs at a paid profile better than {1: 4, 8: 1}?",
"scope_change_reason": "The catalogue asks whether any changed query demand or caller can remove real work while satisfying native chronology and restoration. Comment 19143427 already stopped this one canonicalization with local-only evidence and left a broader successor open. This package narrows to that stopped candidate: it publishes a replay of the scatter identity and checks that PR1060 model.move rejects the span(7) to zero descent. It does not rerun the active-mode injection excluded by the card.",
"bottleneck_link": "A complete paid profile for this query has to price the frame that holds q and every scatter ADD. This triangular zero-frame continuation keeps the original scatter outputs and, once a rank-1 copy is granted in place of the rejected move, adds one rank-1 child plus 54 ADDs. It is not a saving under a positive rank-1 tariff.",
"budget_minutes": 60,
"stop_rule": "Stop once the pinned word shows that the triangular substitution preserves all 112 scatter outputs, hence all 62 dirty columns, and that presenting the span(7) query to the zero-frame cut requires one extra rank-1 child. Do not search other correction matrices, targets left at span(7), or outer admission in this session.",
"outcome": "negative-result",
"evidence": "research/p111-line7-query-price/verify.py recomputes q, the 176-entry cut, the 230-entry triangular correction, the +10/+22/+22 support split, equality of all 112 scatter forms, a nonzero witness for each of the 62 dirty columns, and the rejected span(7)-to-zero move. Both python3 -B and python3 -O -B print PASS_P111_LINE7_QUERY_PRICE. Section B, the Clifford compiler, Lean, and the selected frontier are not replayed. The 230-versus-176 census and the conditional profile bill were already stated in discussion comment 19143427.",
"author": "unpaidmoon",
"ai_assistance": "Prepared by unpaidmoon with substantial Cursor Grok assistance. No independent human review.",
"open_questions": [
{
"question": "Can a continuation whose 22 query receivers stay at span(7) until their original final frames are restored beat {1: 4, 8: 1} after every restoration copy is charged?",
"why_it_matters": "The zero-frame route loses because the constructor cannot move span(7) down to the zero frame. Leaving the receivers on the line might avoid that rank-1 copy, but only if restoration of the original final frames does not cost more.",
"first_step": "Recover the original final owner frame of each of the 22 query receivers from the pinned word and price one legal descent from span(7) to that frame.",
"blocked_by": "The scalar cut records frame None and does not store those final frames."
},
{
"question": "Is there a correction other than this triangular substitution that preserves the 112 output forms with no extra rank-1 child and fewer than 230 ADDs?",
"why_it_matters": "The triangular matrix is one exact continuation, not a proof that every output-preserving scatter costs 230 ADDs.",
"first_step": "Fix the four centre values at q in slot 61 and the three unchanged partners, and search integer combinations of those columns that match the 112 original output forms with fewer than 230 nonzeros.",
"blocked_by": "Any such matrix still has to present q at a frame the constructor can legally read. This session does not search that family."
}
]
}
17 changes: 17 additions & 0 deletions research/p111-line7-query-price/VERIFY.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,17 @@
{
"schema_version": 1,
"status": "ready",
"python": "3.12",
"requirements": [],
"inputs": [
"research/p111-line7-query-price/inputs/word-base.json.gz",
"research/p111-line7-query-price/inputs/CENTRE-SEED.json"
],
"commands": [
{
"argv": ["{python}", "-B", "{package}/verify.py"],
"timeout_seconds": 60,
"checks": "Recomputes q, the 176-entry cut, the triangular 230-entry correction, the exact +10/+22/+22 support split, equality of all 112 output forms on 704 coordinates, visibility of all 62 dirty columns, illegality of the span(7) to zero move, and the strict one-child profile increase. Omitting the partner correction must change an output."
}
]
}
Loading