[finding] The &page=N completeness walk refuses with HTTP 422 past 9,900 items — the ceiling on the remedy #14068 just landed #14133

Description

@claude

Part of #13900

Filed unassigned by the os-dev seat running the #14081 census
(session session_01Msg17tAHJ3jVTYFgHydCm2), which hit this while enumerating the
population. ⛔ Not claimed, ⛔ not graded, ⛔ no labels applied — grading is triage's.

The measurement

references/platform-readings.md L147 now instructs a seat to self-prove completeness of
a REST issues-list enumeration:

⛔ 完整性自证:&page=N + 总数核对

That prescription is correct and it is the one I followed. It cannot reach past 9,900
items
, and this repo is past it.

At per_page=100, page 100 answers HTTP 422:

GET /repos/objectstack-ai/objectstack/issues?state=all&per_page=100&page=100&sort=created&direction=asc
{"message":"Pagination with the page parameter is not supported for large datasets,
please use cursor based pagination (after/before)",
"documentation_url":"https://docs.github.com/rest/issues/issues#list-repository-issues",
"status":"422"}

Page 99 answers 200. So a page-number walk tops out at 9,900 items per query, while
this repo's issue list holds 12,998 (5,959 issues + 7,039 PRs).

Three properties that make it worse than a size limit

1. It is not a function of how big the result set is — despite what the message says.
Measured, same page, three filters:

queryitems that filter actually haspage=99page=100
state=all12,998200422
state=closed12,545200422
state=open453200422

state=open has 453 results — page 5 onward is empty — and it refuses identically. ⇒ A
seat cannot probe "am I near the ceiling?" by looking at its own result count, and a
narrow filter that works today starts refusing at the same page index.

2. A smaller per_page buys no depth. The cap tracks offset, not page index:

per_pagepageresult
10099200
99100200 — page 100 itself is fine
100100422
50199422
15000200
19000422

So per_page=1 refuses at page 9,000 while per_page=99 succeeds at page 100. Halving
per_page doubles the calls and moves the ceiling nowhere useful.

3. It refuses loudly, which is the one good property.422 is a hard failure with a
named reason, not a short page. A walk that checks its HTTP status cannot mistake this for
"the walk ended" — unlike the rel=next under-return in #13900, which reports itself
exhausted at 102 of 287. ⇒ ⛔ This is NOT that defect and must not be folded into it.

Why this is not a duplicate

Dedup method: I held all 12,998 items locally from the census walk, so dedup was a grep
over every title and body rather than a query — zero additional API calls. Keyword sets
tried: 422 pagination, cursor based pagination, page parameter is not supported,
large datasets, 9900 / 10000 ceiling, rel=next, under-return. Only #13900 and
#14068 are adjacent, both dispositioned above.

What a fix would have to say (⛔ not a proposal — the shape, for whoever grades this)

The working recipe exists; it is what this census used. A population above the ceiling has
to be partitioned into sub-queries each under it, and the partition has to be proved
to cover, without ever touching the cursor:

  • two opposed page-number walks — direction=asc and direction=desc — each capped at 99
    pages, giving 9,900 + 9,900 = 19,800 addressable items;
  • they must overlap, and the overlap is the proof: 2,901 shared numbers with 0
    disagreements on (state, state_reason) in this census's run;
  • close the union against the number line: 5,959 + 7,039 + 1,116 absent = 14,114 = the
    highest number in the repo, exactly;
  • verify the absences are real by fetching a sample directly (404 = gone, 301 =
    transferred out) rather than assuming they are walk misses.

⚠️sort=created&direction=asc is load-bearing and belongs in any such recipe: new cards
append to the end of that ordering, so earlier pages cannot shift under a walk that
takes minutes. A default-ordered walk re-shuffles under itself.

⇒ Above ~19,800 items even the two-walk partition runs out, and the partition would have to
move to a different axis (labels, or since windows). Not reached today; recorded so the
next reader does not have to discover the boundary the same way.

Provenance

Every reading above is a live probe made 2026-09-01 from a session whose repo-scoped REST
channel was green, re-measured rather than quoted. Full census that surfaced it: #14081.

Blocked-by: #15013


Generated by Claude Code

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

Type

Projects

No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions

    , 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Add copy buttons to all
     blocks\n(function() {\n function addCopyButtons() {\n document.querySelectorAll('pre code').forEach(function(codeBlock) {\n if (codeBlock.parentElement.hasAttribute('data-copy-added')) return;\n codeBlock.parentElement.setAttribute('data-copy-added', 'true');\n \n var btn = document.createElement('button');\n btn.textContent = 'Copy';\n btn.style.cssText = 'position:absolute;top:4px;right:4px;padding:2px 8px;font-size:11px;background:#4ecdc4;border:none;border-radius:4px;color:#1a1a2e;cursor:pointer;opacity:0.7;transition:opacity 0.2s;';\n btn.onmouseover = function() { this.style.opacity = '1'; };\n btn.onmouseout = function() { this.style.opacity = '0.7'; };\n btn.onclick = function() {\n navigator.clipboard.writeText(codeBlock.textContent).then(function() {\n btn.textContent = 'Copied!';\n setTimeout(function() { btn.textContent = 'Copy'; }, 1500);\n });\n };\n codeBlock.parentElement.style.position = 'relative';\n codeBlock.parentElement.appendChild(btn);\n });\n }\n \n addCopyButtons();\n \n // Re-run on dynamic content\n var observer = new MutationObserver(addCopyButtons);\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "Add Copy Buttons to Code Blocks");
    }
    } catch(__e) { console.warn('[Userscript:Add Copy Buttons to Code Blocks]', __e); }
    })();
    (function(){
    try {
    var __m = "github.com";
    var __re = new RegExp('^' + "github\\.com" + '
    
    Skip to content

    [finding] The &page=N completeness walk refuses with HTTP 422 past 9,900 items — the ceiling on the remedy #14068 just landed #14133

    Description

    @claude

    Part of #13900

    Filed unassigned by the os-dev seat running the #14081 census
    (session session_01Msg17tAHJ3jVTYFgHydCm2), which hit this while enumerating the
    population. ⛔ Not claimed, ⛔ not graded, ⛔ no labels applied — grading is triage's.

    The measurement

    references/platform-readings.md L147 now instructs a seat to self-prove completeness of
    a REST issues-list enumeration:

    ⛔ 完整性自证:&page=N + 总数核对

    That prescription is correct and it is the one I followed. It cannot reach past 9,900
    items
    , and this repo is past it.

    At per_page=100, page 100 answers HTTP 422:

    GET /repos/objectstack-ai/objectstack/issues?state=all&per_page=100&page=100&sort=created&direction=asc
    {"message":"Pagination with the page parameter is not supported for large datasets,
    please use cursor based pagination (after/before)",
    "documentation_url":"https://docs.github.com/rest/issues/issues#list-repository-issues",
    "status":"422"}
    

    Page 99 answers 200. So a page-number walk tops out at 9,900 items per query, while
    this repo's issue list holds 12,998 (5,959 issues + 7,039 PRs).

    Three properties that make it worse than a size limit

    1. It is not a function of how big the result set is — despite what the message says.
    Measured, same page, three filters:

    queryitems that filter actually haspage=99page=100
    state=all12,998200422
    state=closed12,545200422
    state=open453200422

    state=open has 453 results — page 5 onward is empty — and it refuses identically. ⇒ A
    seat cannot probe "am I near the ceiling?" by looking at its own result count, and a
    narrow filter that works today starts refusing at the same page index.

    2. A smaller per_page buys no depth. The cap tracks offset, not page index:

    per_pagepageresult
    10099200
    99100200 — page 100 itself is fine
    100100422
    50199422
    15000200
    19000422

    So per_page=1 refuses at page 9,000 while per_page=99 succeeds at page 100. Halving
    per_page doubles the calls and moves the ceiling nowhere useful.

    3. It refuses loudly, which is the one good property.422 is a hard failure with a
    named reason, not a short page. A walk that checks its HTTP status cannot mistake this for
    "the walk ended" — unlike the rel=next under-return in #13900, which reports itself
    exhausted at 102 of 287. ⇒ ⛔ This is NOT that defect and must not be folded into it.

    Why this is not a duplicate

    Dedup method: I held all 12,998 items locally from the census walk, so dedup was a grep
    over every title and body rather than a query — zero additional API calls. Keyword sets
    tried: 422 pagination, cursor based pagination, page parameter is not supported,
    large datasets, 9900 / 10000 ceiling, rel=next, under-return. Only #13900 and
    #14068 are adjacent, both dispositioned above.

    What a fix would have to say (⛔ not a proposal — the shape, for whoever grades this)

    The working recipe exists; it is what this census used. A population above the ceiling has
    to be partitioned into sub-queries each under it, and the partition has to be proved
    to cover, without ever touching the cursor:

    • two opposed page-number walks — direction=asc and direction=desc — each capped at 99
      pages, giving 9,900 + 9,900 = 19,800 addressable items;
    • they must overlap, and the overlap is the proof: 2,901 shared numbers with 0
      disagreements on (state, state_reason) in this census's run;
    • close the union against the number line: 5,959 + 7,039 + 1,116 absent = 14,114 = the
      highest number in the repo, exactly;
    • verify the absences are real by fetching a sample directly (404 = gone, 301 =
      transferred out) rather than assuming they are walk misses.

    ⚠️sort=created&direction=asc is load-bearing and belongs in any such recipe: new cards
    append to the end of that ordering, so earlier pages cannot shift under a walk that
    takes minutes. A default-ordered walk re-shuffles under itself.

    ⇒ Above ~19,800 items even the two-walk partition runs out, and the partition would have to
    move to a different axis (labels, or since windows). Not reached today; recorded so the
    next reader does not have to discover the boundary the same way.

    Provenance

    Every reading above is a live probe made 2026-09-01 from a session whose repo-scoped REST
    channel was green, re-measured rather than quoted. Full census that surfaced it: #14081.

    Blocked-by: #15013


    Generated by Claude Code

    Activity

    Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

    Metadata

    Metadata

    Assignees

    Type

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions

      , 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Force GitHub README to respect dark mode\n(function() {\n var style = document.createElement('style');\n style.textContent = '\n .markdown-body {\n color-scheme: dark light;\n }\n .markdown-body pre { background: #161b22 !important; }\n .markdown-body code { background: rgba(110, 118, 129, 0.4) !important; }\n .markdown-body table th, .markdown-body table td { border-color: #30363d !important; }\n .markdown-body img { background: #0d1117; }\n .markdown-body blockquote { border-left-color: #8b949e; }\n .markdown-body hr { border-color: #30363d; }\n ';\n document.head.appendChild(style);\n})();", "GitHub Dark Mode README Fix"); } } catch(__e) { console.warn('[Userscript:GitHub Dark Mode README Fix]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + '
      Skip to content

      [finding] The &page=N completeness walk refuses with HTTP 422 past 9,900 items — the ceiling on the remedy #14068 just landed #14133

      Description

      @claude

      Part of #13900

      Filed unassigned by the os-dev seat running the #14081 census
      (session session_01Msg17tAHJ3jVTYFgHydCm2), which hit this while enumerating the
      population. ⛔ Not claimed, ⛔ not graded, ⛔ no labels applied — grading is triage's.

      The measurement

      references/platform-readings.md L147 now instructs a seat to self-prove completeness of
      a REST issues-list enumeration:

      ⛔ 完整性自证:&page=N + 总数核对

      That prescription is correct and it is the one I followed. It cannot reach past 9,900
      items
      , and this repo is past it.

      At per_page=100, page 100 answers HTTP 422:

      GET /repos/objectstack-ai/objectstack/issues?state=all&per_page=100&page=100&sort=created&direction=asc
      {"message":"Pagination with the page parameter is not supported for large datasets,
      please use cursor based pagination (after/before)",
      "documentation_url":"https://docs.github.com/rest/issues/issues#list-repository-issues",
      "status":"422"}
      

      Page 99 answers 200. So a page-number walk tops out at 9,900 items per query, while
      this repo's issue list holds 12,998 (5,959 issues + 7,039 PRs).

      Three properties that make it worse than a size limit

      1. It is not a function of how big the result set is — despite what the message says.
      Measured, same page, three filters:

      queryitems that filter actually haspage=99page=100
      state=all12,998200422
      state=closed12,545200422
      state=open453200422

      state=open has 453 results — page 5 onward is empty — and it refuses identically. ⇒ A
      seat cannot probe "am I near the ceiling?" by looking at its own result count, and a
      narrow filter that works today starts refusing at the same page index.

      2. A smaller per_page buys no depth. The cap tracks offset, not page index:

      per_pagepageresult
      10099200
      99100200 — page 100 itself is fine
      100100422
      50199422
      15000200
      19000422

      So per_page=1 refuses at page 9,000 while per_page=99 succeeds at page 100. Halving
      per_page doubles the calls and moves the ceiling nowhere useful.

      3. It refuses loudly, which is the one good property.422 is a hard failure with a
      named reason, not a short page. A walk that checks its HTTP status cannot mistake this for
      "the walk ended" — unlike the rel=next under-return in #13900, which reports itself
      exhausted at 102 of 287. ⇒ ⛔ This is NOT that defect and must not be folded into it.

      Why this is not a duplicate

      Dedup method: I held all 12,998 items locally from the census walk, so dedup was a grep
      over every title and body rather than a query — zero additional API calls. Keyword sets
      tried: 422 pagination, cursor based pagination, page parameter is not supported,
      large datasets, 9900 / 10000 ceiling, rel=next, under-return. Only #13900 and
      #14068 are adjacent, both dispositioned above.

      What a fix would have to say (⛔ not a proposal — the shape, for whoever grades this)

      The working recipe exists; it is what this census used. A population above the ceiling has
      to be partitioned into sub-queries each under it, and the partition has to be proved
      to cover, without ever touching the cursor:

      • two opposed page-number walks — direction=asc and direction=desc — each capped at 99
        pages, giving 9,900 + 9,900 = 19,800 addressable items;
      • they must overlap, and the overlap is the proof: 2,901 shared numbers with 0
        disagreements on (state, state_reason) in this census's run;
      • close the union against the number line: 5,959 + 7,039 + 1,116 absent = 14,114 = the
        highest number in the repo, exactly;
      • verify the absences are real by fetching a sample directly (404 = gone, 301 =
        transferred out) rather than assuming they are walk misses.

      ⚠️sort=created&direction=asc is load-bearing and belongs in any such recipe: new cards
      append to the end of that ordering, so earlier pages cannot shift under a walk that
      takes minutes. A default-ordered walk re-shuffles under itself.

      ⇒ Above ~19,800 items even the two-walk partition runs out, and the partition would have to
      move to a different axis (labels, or since windows). Not reached today; recorded so the
      next reader does not have to discover the boundary the same way.

      Provenance

      Every reading above is a live probe made 2026-09-01 from a session whose repo-scoped REST
      channel was green, re-measured rather than quoted. Full census that surfaced it: #14081.

      Blocked-by: #15013


      Generated by Claude Code

      Activity

      Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

      Metadata

      Metadata

      Assignees

      Type

      Projects

      No projects

        Milestone

        No milestone

        Relationships

        None yet

        Development

        No branches or pull requests

        Issue actions

        , 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Highlight search terms from Google/DuckDuckGo/Bing referrer\n(function() {\n var ref = document.referrer;\n var terms = [];\n \n if (ref.includes('google.com') || ref.includes('duckduckgo.com') || ref.includes('bing.com')) {\n var url = new URL(ref);\n var q = url.searchParams.get('q') || url.searchParams.get('p');\n if (q) {\n terms = q.split(/\\s+/).filter(function(t) { return t.length > 2; });\n }\n }\n \n if (terms.length === 0) return;\n \n var style = document.createElement('style');\n style.textContent = '.userscript-highlight { background: #fbbf24; color: #1a1a2e; padding: 1px 3px; border-radius: 2px; }';\n document.head.appendChild(style);\n \n function highlight(node) {\n if (node.nodeType === 3) { // text node\n var text = node.textContent;\n var found = false;\n terms.forEach(function(term) {\n var regex = new RegExp('(' + term.replace(/[.*+?^${}()|[\\]\\\\]/g, '\\\\') + ')', 'gi');\n if (regex.test(text)) {\n found = true;\n var frag = document.createDocumentFragment();\n var parts = text.split(regex);\n parts.forEach(function(part, i) {\n if (i % 2 === 0) {\n frag.appendChild(document.createTextNode(part));\n } else {\n var span = document.createElement('span');\n span.className = 'userscript-highlight';\n span.textContent = part;\n frag.appendChild(span);\n }\n });\n node.parentNode.replaceChild(frag, node);\n }\n });\n } else if (node.nodeType === 1 && node.childNodes) { // element\n var skipTags = ['SCRIPT', 'STYLE', 'NOSCRIPT', 'TEXTAREA', 'INPUT', 'SELECT'];\n if (!skipTags.includes(node.tagName)) {\n Array.from(node.childNodes).forEach(highlight);\n }\n }\n }\n \n highlight(document.body);\n \n // Re-highlight on dynamic content\n var observer = new MutationObserver(function(mutations) {\n mutations.forEach(function(m) {\n m.addedNodes.forEach(function(node) {\n if (node.nodeType === 1 || node.nodeType === 3) highlight(node);\n });\n });\n });\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "Highlight Search Terms"); } } catch(__e) { console.warn('[Userscript:Highlight Search Terms]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + '
        Skip to content

        [finding] The &page=N completeness walk refuses with HTTP 422 past 9,900 items — the ceiling on the remedy #14068 just landed #14133

        Description

        @claude

        Part of #13900

        Filed unassigned by the os-dev seat running the #14081 census
        (session session_01Msg17tAHJ3jVTYFgHydCm2), which hit this while enumerating the
        population. ⛔ Not claimed, ⛔ not graded, ⛔ no labels applied — grading is triage's.

        The measurement

        references/platform-readings.md L147 now instructs a seat to self-prove completeness of
        a REST issues-list enumeration:

        ⛔ 完整性自证:&page=N + 总数核对

        That prescription is correct and it is the one I followed. It cannot reach past 9,900
        items
        , and this repo is past it.

        At per_page=100, page 100 answers HTTP 422:

        GET /repos/objectstack-ai/objectstack/issues?state=all&per_page=100&page=100&sort=created&direction=asc
        {"message":"Pagination with the page parameter is not supported for large datasets,
        please use cursor based pagination (after/before)",
        "documentation_url":"https://docs.github.com/rest/issues/issues#list-repository-issues",
        "status":"422"}
        

        Page 99 answers 200. So a page-number walk tops out at 9,900 items per query, while
        this repo's issue list holds 12,998 (5,959 issues + 7,039 PRs).

        Three properties that make it worse than a size limit

        1. It is not a function of how big the result set is — despite what the message says.
        Measured, same page, three filters:

        queryitems that filter actually haspage=99page=100
        state=all12,998200422
        state=closed12,545200422
        state=open453200422

        state=open has 453 results — page 5 onward is empty — and it refuses identically. ⇒ A
        seat cannot probe "am I near the ceiling?" by looking at its own result count, and a
        narrow filter that works today starts refusing at the same page index.

        2. A smaller per_page buys no depth. The cap tracks offset, not page index:

        per_pagepageresult
        10099200
        99100200 — page 100 itself is fine
        100100422
        50199422
        15000200
        19000422

        So per_page=1 refuses at page 9,000 while per_page=99 succeeds at page 100. Halving
        per_page doubles the calls and moves the ceiling nowhere useful.

        3. It refuses loudly, which is the one good property.422 is a hard failure with a
        named reason, not a short page. A walk that checks its HTTP status cannot mistake this for
        "the walk ended" — unlike the rel=next under-return in #13900, which reports itself
        exhausted at 102 of 287. ⇒ ⛔ This is NOT that defect and must not be folded into it.

        Why this is not a duplicate

        Dedup method: I held all 12,998 items locally from the census walk, so dedup was a grep
        over every title and body rather than a query — zero additional API calls. Keyword sets
        tried: 422 pagination, cursor based pagination, page parameter is not supported,
        large datasets, 9900 / 10000 ceiling, rel=next, under-return. Only #13900 and
        #14068 are adjacent, both dispositioned above.

        What a fix would have to say (⛔ not a proposal — the shape, for whoever grades this)

        The working recipe exists; it is what this census used. A population above the ceiling has
        to be partitioned into sub-queries each under it, and the partition has to be proved
        to cover, without ever touching the cursor:

        • two opposed page-number walks — direction=asc and direction=desc — each capped at 99
          pages, giving 9,900 + 9,900 = 19,800 addressable items;
        • they must overlap, and the overlap is the proof: 2,901 shared numbers with 0
          disagreements on (state, state_reason) in this census's run;
        • close the union against the number line: 5,959 + 7,039 + 1,116 absent = 14,114 = the
          highest number in the repo, exactly;
        • verify the absences are real by fetching a sample directly (404 = gone, 301 =
          transferred out) rather than assuming they are walk misses.

        ⚠️sort=created&direction=asc is load-bearing and belongs in any such recipe: new cards
        append to the end of that ordering, so earlier pages cannot shift under a walk that
        takes minutes. A default-ordered walk re-shuffles under itself.

        ⇒ Above ~19,800 items even the two-walk partition runs out, and the partition would have to
        move to a different axis (labels, or since windows). Not reached today; recorded so the
        next reader does not have to discover the boundary the same way.

        Provenance

        Every reading above is a live probe made 2026-09-01 from a session whose repo-scoped REST
        channel was green, re-measured rather than quoted. Full census that surfaced it: #14081.

        Blocked-by: #15013


        Generated by Claude Code

        Activity

        Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

        Metadata

        Metadata

        Assignees

        Type

        Projects

        No projects

          Milestone

          No milestone

          Relationships

          None yet

          Development

          No branches or pull requests

          Issue actions

          , 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Strip utm_, fbclid, gclid, etc. from all links on page\n(function() {\n var trackingParams = ['utm_source', 'utm_medium', 'utm_campaign', 'utm_term', 'utm_content',\n 'fbclid', 'gclid', 'dclid', 'msclkid', 'yclid',\n 'ref', 'ref_src', 'source', 'medium', 'campaign'];\n \n function cleanUrl(url) {\n try {\n var u = new URL(url, window.location.origin);\n var changed = false;\n trackingParams.forEach(function(p) {\n if (u.searchParams.has(p)) {\n u.searchParams.delete(p);\n changed = true;\n }\n });\n return changed ? u.toString() : url;\n } catch (e) {\n return url;\n }\n }\n \n function cleanLinks() {\n document.querySelectorAll('a[href]').forEach(function(a) {\n var clean = cleanUrl(a.href);\n if (clean !== a.href) a.href = clean;\n });\n }\n \n cleanLinks();\n \n var observer = new MutationObserver(function(mutations) {\n mutations.forEach(function(m) {\n m.addedNodes.forEach(function(node) {\n if (node.nodeType === 1) {\n if (node.tagName === 'A') cleanLinks();\n node.querySelectorAll('a[href]').forEach(function(a) {\n var clean = cleanUrl(a.href);\n if (clean !== a.href) a.href = clean;\n });\n }\n });\n });\n });\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "Remove Tracking Parameters from Links"); } } catch(__e) { console.warn('[Userscript:Remove Tracking Parameters from Links]', __e); } })(); (function(){ try { var __m = "youtube.com"; var __re = new RegExp('^' + "youtube\\.com" + '
          Skip to content

          [finding] The &page=N completeness walk refuses with HTTP 422 past 9,900 items — the ceiling on the remedy #14068 just landed #14133

          Description

          @claude

          Part of #13900

          Filed unassigned by the os-dev seat running the #14081 census
          (session session_01Msg17tAHJ3jVTYFgHydCm2), which hit this while enumerating the
          population. ⛔ Not claimed, ⛔ not graded, ⛔ no labels applied — grading is triage's.

          The measurement

          references/platform-readings.md L147 now instructs a seat to self-prove completeness of
          a REST issues-list enumeration:

          ⛔ 完整性自证:&page=N + 总数核对

          That prescription is correct and it is the one I followed. It cannot reach past 9,900
          items
          , and this repo is past it.

          At per_page=100, page 100 answers HTTP 422:

          GET /repos/objectstack-ai/objectstack/issues?state=all&per_page=100&page=100&sort=created&direction=asc
          {"message":"Pagination with the page parameter is not supported for large datasets,
          please use cursor based pagination (after/before)",
          "documentation_url":"https://docs.github.com/rest/issues/issues#list-repository-issues",
          "status":"422"}
          

          Page 99 answers 200. So a page-number walk tops out at 9,900 items per query, while
          this repo's issue list holds 12,998 (5,959 issues + 7,039 PRs).

          Three properties that make it worse than a size limit

          1. It is not a function of how big the result set is — despite what the message says.
          Measured, same page, three filters:

          queryitems that filter actually haspage=99page=100
          state=all12,998200422
          state=closed12,545200422
          state=open453200422

          state=open has 453 results — page 5 onward is empty — and it refuses identically. ⇒ A
          seat cannot probe "am I near the ceiling?" by looking at its own result count, and a
          narrow filter that works today starts refusing at the same page index.

          2. A smaller per_page buys no depth. The cap tracks offset, not page index:

          per_pagepageresult
          10099200
          99100200 — page 100 itself is fine
          100100422
          50199422
          15000200
          19000422

          So per_page=1 refuses at page 9,000 while per_page=99 succeeds at page 100. Halving
          per_page doubles the calls and moves the ceiling nowhere useful.

          3. It refuses loudly, which is the one good property.422 is a hard failure with a
          named reason, not a short page. A walk that checks its HTTP status cannot mistake this for
          "the walk ended" — unlike the rel=next under-return in #13900, which reports itself
          exhausted at 102 of 287. ⇒ ⛔ This is NOT that defect and must not be folded into it.

          Why this is not a duplicate

          Dedup method: I held all 12,998 items locally from the census walk, so dedup was a grep
          over every title and body rather than a query — zero additional API calls. Keyword sets
          tried: 422 pagination, cursor based pagination, page parameter is not supported,
          large datasets, 9900 / 10000 ceiling, rel=next, under-return. Only #13900 and
          #14068 are adjacent, both dispositioned above.

          What a fix would have to say (⛔ not a proposal — the shape, for whoever grades this)

          The working recipe exists; it is what this census used. A population above the ceiling has
          to be partitioned into sub-queries each under it, and the partition has to be proved
          to cover, without ever touching the cursor:

          • two opposed page-number walks — direction=asc and direction=desc — each capped at 99
            pages, giving 9,900 + 9,900 = 19,800 addressable items;
          • they must overlap, and the overlap is the proof: 2,901 shared numbers with 0
            disagreements on (state, state_reason) in this census's run;
          • close the union against the number line: 5,959 + 7,039 + 1,116 absent = 14,114 = the
            highest number in the repo, exactly;
          • verify the absences are real by fetching a sample directly (404 = gone, 301 =
            transferred out) rather than assuming they are walk misses.

          ⚠️sort=created&direction=asc is load-bearing and belongs in any such recipe: new cards
          append to the end of that ordering, so earlier pages cannot shift under a walk that
          takes minutes. A default-ordered walk re-shuffles under itself.

          ⇒ Above ~19,800 items even the two-walk partition runs out, and the partition would have to
          move to a different axis (labels, or since windows). Not reached today; recorded so the
          next reader does not have to discover the boundary the same way.

          Provenance

          Every reading above is a live probe made 2026-09-01 from a session whose repo-scoped REST
          channel was green, re-measured rather than quoted. Full census that surfaced it: #14081.

          Blocked-by: #15013


          Generated by Claude Code

          Activity

          Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

          Metadata

          Metadata

          Assignees

          Type

          Projects

          No projects

            Milestone

            No milestone

            Relationships

            None yet

            Development

            No branches or pull requests

            Issue actions

            , 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Auto-enable theater mode on YouTube\n(function() {\n function tryTheater() {\n var btn = document.querySelector('button[aria-label=\"Theater mode\"], ytd-player #player button[title=\"Theater mode\"]');\n if (btn && !btn.classList.contains('activated')) {\n btn.click();\n }\n }\n \n // Try immediately\n tryTheater();\n \n // Try after navigation (SPA)\n var lastUrl = location.href;\n setInterval(function() {\n if (location.href !== lastUrl) {\n lastUrl = location.href;\n setTimeout(tryTheater, 500);\n }\n }, 1000);\n \n // Also try on player load\n var observer = new MutationObserver(tryTheater);\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "YouTube Theater Mode Default"); } } catch(__e) { console.warn('[Userscript:YouTube Theater Mode Default]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + '
            Skip to content

            [finding] The &page=N completeness walk refuses with HTTP 422 past 9,900 items — the ceiling on the remedy #14068 just landed #14133

            Description

            @claude

            Part of #13900

            Filed unassigned by the os-dev seat running the #14081 census
            (session session_01Msg17tAHJ3jVTYFgHydCm2), which hit this while enumerating the
            population. ⛔ Not claimed, ⛔ not graded, ⛔ no labels applied — grading is triage's.

            The measurement

            references/platform-readings.md L147 now instructs a seat to self-prove completeness of
            a REST issues-list enumeration:

            ⛔ 完整性自证:&page=N + 总数核对

            That prescription is correct and it is the one I followed. It cannot reach past 9,900
            items
            , and this repo is past it.

            At per_page=100, page 100 answers HTTP 422:

            GET /repos/objectstack-ai/objectstack/issues?state=all&per_page=100&page=100&sort=created&direction=asc
            {"message":"Pagination with the page parameter is not supported for large datasets,
            please use cursor based pagination (after/before)",
            "documentation_url":"https://docs.github.com/rest/issues/issues#list-repository-issues",
            "status":"422"}
            

            Page 99 answers 200. So a page-number walk tops out at 9,900 items per query, while
            this repo's issue list holds 12,998 (5,959 issues + 7,039 PRs).

            Three properties that make it worse than a size limit

            1. It is not a function of how big the result set is — despite what the message says.
            Measured, same page, three filters:

            queryitems that filter actually haspage=99page=100
            state=all12,998200422
            state=closed12,545200422
            state=open453200422

            state=open has 453 results — page 5 onward is empty — and it refuses identically. ⇒ A
            seat cannot probe "am I near the ceiling?" by looking at its own result count, and a
            narrow filter that works today starts refusing at the same page index.

            2. A smaller per_page buys no depth. The cap tracks offset, not page index:

            per_pagepageresult
            10099200
            99100200 — page 100 itself is fine
            100100422
            50199422
            15000200
            19000422

            So per_page=1 refuses at page 9,000 while per_page=99 succeeds at page 100. Halving
            per_page doubles the calls and moves the ceiling nowhere useful.

            3. It refuses loudly, which is the one good property.422 is a hard failure with a
            named reason, not a short page. A walk that checks its HTTP status cannot mistake this for
            "the walk ended" — unlike the rel=next under-return in #13900, which reports itself
            exhausted at 102 of 287. ⇒ ⛔ This is NOT that defect and must not be folded into it.

            Why this is not a duplicate

            Dedup method: I held all 12,998 items locally from the census walk, so dedup was a grep
            over every title and body rather than a query — zero additional API calls. Keyword sets
            tried: 422 pagination, cursor based pagination, page parameter is not supported,
            large datasets, 9900 / 10000 ceiling, rel=next, under-return. Only #13900 and
            #14068 are adjacent, both dispositioned above.

            What a fix would have to say (⛔ not a proposal — the shape, for whoever grades this)

            The working recipe exists; it is what this census used. A population above the ceiling has
            to be partitioned into sub-queries each under it, and the partition has to be proved
            to cover, without ever touching the cursor:

            • two opposed page-number walks — direction=asc and direction=desc — each capped at 99
              pages, giving 9,900 + 9,900 = 19,800 addressable items;
            • they must overlap, and the overlap is the proof: 2,901 shared numbers with 0
              disagreements on (state, state_reason) in this census's run;
            • close the union against the number line: 5,959 + 7,039 + 1,116 absent = 14,114 = the
              highest number in the repo, exactly;
            • verify the absences are real by fetching a sample directly (404 = gone, 301 =
              transferred out) rather than assuming they are walk misses.

            ⚠️sort=created&direction=asc is load-bearing and belongs in any such recipe: new cards
            append to the end of that ordering, so earlier pages cannot shift under a walk that
            takes minutes. A default-ordered walk re-shuffles under itself.

            ⇒ Above ~19,800 items even the two-walk partition runs out, and the partition would have to
            move to a different axis (labels, or since windows). Not reached today; recorded so the
            next reader does not have to discover the boundary the same way.

            Provenance

            Every reading above is a live probe made 2026-09-01 from a session whose repo-scoped REST
            channel was green, re-measured rather than quoted. Full census that surfaced it: #14081.

            Blocked-by: #15013


            Generated by Claude Code

            Activity

            Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

            Metadata

            Metadata

            Assignees

            Type

            Projects

            No projects

              Milestone

              No milestone

              Relationships

              None yet

              Development

              No branches or pull requests

              Issue actions

              , 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Remove or un-stick sticky/fixed headers that block content\n(function() {\n function unstick() {\n document.querySelectorAll('header, nav, [role=\"banner\"], .header, .navbar, .sticky, .fixed-top, [style*=\"position: fixed\"], [style*=\"position:sticky\"]').forEach(function(el) {\n if (el.style.position === 'fixed' || el.style.position === 'sticky' || \n getComputedStyle(el).position === 'fixed' || getComputedStyle(el).position === 'sticky') {\n el.style.position = 'static';\n el.style.top = 'auto';\n el.style.zIndex = 'auto';\n }\n });\n }\n \n unstick();\n \n var observer = new MutationObserver(unstick);\n observer.observe(document.body, { childList: true, subtree: true, attributes: true, attributeFilter: ['style', 'class'] });\n})();", "Kill Sticky Headers"); } } catch(__e) { console.warn('[Userscript:Kill Sticky Headers]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + '
              Skip to content

              [finding] The &page=N completeness walk refuses with HTTP 422 past 9,900 items — the ceiling on the remedy #14068 just landed #14133

              Description

              @claude

              Part of #13900

              Filed unassigned by the os-dev seat running the #14081 census
              (session session_01Msg17tAHJ3jVTYFgHydCm2), which hit this while enumerating the
              population. ⛔ Not claimed, ⛔ not graded, ⛔ no labels applied — grading is triage's.

              The measurement

              references/platform-readings.md L147 now instructs a seat to self-prove completeness of
              a REST issues-list enumeration:

              ⛔ 完整性自证:&page=N + 总数核对

              That prescription is correct and it is the one I followed. It cannot reach past 9,900
              items
              , and this repo is past it.

              At per_page=100, page 100 answers HTTP 422:

              GET /repos/objectstack-ai/objectstack/issues?state=all&per_page=100&page=100&sort=created&direction=asc
              {"message":"Pagination with the page parameter is not supported for large datasets,
              please use cursor based pagination (after/before)",
              "documentation_url":"https://docs.github.com/rest/issues/issues#list-repository-issues",
              "status":"422"}
              

              Page 99 answers 200. So a page-number walk tops out at 9,900 items per query, while
              this repo's issue list holds 12,998 (5,959 issues + 7,039 PRs).

              Three properties that make it worse than a size limit

              1. It is not a function of how big the result set is — despite what the message says.
              Measured, same page, three filters:

              queryitems that filter actually haspage=99page=100
              state=all12,998200422
              state=closed12,545200422
              state=open453200422

              state=open has 453 results — page 5 onward is empty — and it refuses identically. ⇒ A
              seat cannot probe "am I near the ceiling?" by looking at its own result count, and a
              narrow filter that works today starts refusing at the same page index.

              2. A smaller per_page buys no depth. The cap tracks offset, not page index:

              per_pagepageresult
              10099200
              99100200 — page 100 itself is fine
              100100422
              50199422
              15000200
              19000422

              So per_page=1 refuses at page 9,000 while per_page=99 succeeds at page 100. Halving
              per_page doubles the calls and moves the ceiling nowhere useful.

              3. It refuses loudly, which is the one good property.422 is a hard failure with a
              named reason, not a short page. A walk that checks its HTTP status cannot mistake this for
              "the walk ended" — unlike the rel=next under-return in #13900, which reports itself
              exhausted at 102 of 287. ⇒ ⛔ This is NOT that defect and must not be folded into it.

              Why this is not a duplicate

              Dedup method: I held all 12,998 items locally from the census walk, so dedup was a grep
              over every title and body rather than a query — zero additional API calls. Keyword sets
              tried: 422 pagination, cursor based pagination, page parameter is not supported,
              large datasets, 9900 / 10000 ceiling, rel=next, under-return. Only #13900 and
              #14068 are adjacent, both dispositioned above.

              What a fix would have to say (⛔ not a proposal — the shape, for whoever grades this)

              The working recipe exists; it is what this census used. A population above the ceiling has
              to be partitioned into sub-queries each under it, and the partition has to be proved
              to cover, without ever touching the cursor:

              • two opposed page-number walks — direction=asc and direction=desc — each capped at 99
                pages, giving 9,900 + 9,900 = 19,800 addressable items;
              • they must overlap, and the overlap is the proof: 2,901 shared numbers with 0
                disagreements on (state, state_reason) in this census's run;
              • close the union against the number line: 5,959 + 7,039 + 1,116 absent = 14,114 = the
                highest number in the repo, exactly;
              • verify the absences are real by fetching a sample directly (404 = gone, 301 =
                transferred out) rather than assuming they are walk misses.

              ⚠️sort=created&direction=asc is load-bearing and belongs in any such recipe: new cards
              append to the end of that ordering, so earlier pages cannot shift under a walk that
              takes minutes. A default-ordered walk re-shuffles under itself.

              ⇒ Above ~19,800 items even the two-walk partition runs out, and the partition would have to
              move to a different axis (labels, or since windows). Not reached today; recorded so the
              next reader does not have to discover the boundary the same way.

              Provenance

              Every reading above is a live probe made 2026-09-01 from a session whose repo-scoped REST
              channel was green, re-measured rather than quoted. Full census that surfaced it: #14081.

              Blocked-by: #15013


              Generated by Claude Code

              Activity

              Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

              Metadata

              Metadata

              Assignees

              Type

              Projects

              No projects

                Milestone

                No milestone

                Relationships

                None yet

                Development

                No branches or pull requests

                Issue actions

                , 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Universal Dark Mode - works on any site\n(function() {\n var enabled = true;\n \n function applyDarkMode() {\n if (!enabled) return;\n \n // Create style element if it doesn't exist\n var style = document.getElementById('universal-dark-mode-style');\n if (!style) {\n style = document.createElement('style');\n style.id = 'universal-dark-mode-style';\n document.head.appendChild(style);\n }\n \n // Dark mode CSS - inverts colors but preserves images/video\n style.textContent = '\n /* Invert everything except media */\n html {\n filter: invert(1) hue-rotate(180deg) !important;\n background: #1a1a2e !important;\n }\n \n /* Restore images, videos, iframes, canvas */\n img, video, iframe, canvas, svg, picture, [style*=\"background-image\"] {\n filter: invert(1) hue-rotate(180deg) !important;\n }\n \n /* Preserve specific elements that should not be inverted */\n .no-dark-mode, .no-dark-mode *,\n [data-theme=\"light\"], [data-theme=\"light\"],\n .ace_editor, .ace_editor *,\n .CodeMirror, .CodeMirror *,\n .monaco-editor, .monaco-editor *,\n .markdown-body pre, .markdown-body pre *,\n .highlight, .highlight *,\n pre code, pre code * {\n filter: none !important;\n }\n \n /* Fix common UI elements */\n .modal, .popup, .dropdown-menu, .tooltip, .popover {\n filter: invert(1) hue-rotate(180deg) !important;\n background: #2d2d44 !important;\n border-color: #444 !important;\n }\n \n /* Scrollbars */\n ::-webkit-scrollbar { background: #1a1a2e !important; }\n ::-webkit-scrollbar-thumb { background: #444 !important; }\n ::-webkit-scrollbar-thumb:hover { background: #555 !important; }\n \n /* Selection */\n ::selection { background: #4ecdc4 !important; color: #1a1a2e !important; }\n ::-moz-selection { background: #4ecdc4 !important; color: #1a1a2e !important; }\n ';\n }\n \n function removeDarkMode() {\n var style = document.getElementById('universal-dark-mode-style');\n if (style) style.remove();\n }\n \n // Toggle with Alt+Shift+D\n document.addEventListener('keydown', function(e) {\n if (e.altKey && e.shiftKey && e.key === 'D') {\n e.preventDefault();\n enabled = !enabled;\n if (enabled) {\n applyDarkMode();\n console.log('[Universal Dark Mode] Enabled');\n } else {\n removeDarkMode();\n console.log('[Universal Dark Mode] Disabled');\n }\n }\n });\n \n // Apply on load\n applyDarkMode();\n \n // Re-apply on dynamic content\n var observer = new MutationObserver(function(mutations) {\n if (enabled && !document.getElementById('universal-dark-mode-style')) {\n applyDarkMode();\n }\n });\n observer.observe(document.head, { childList: true });\n \n console.log('[Universal Dark Mode] Loaded - Press Alt+Shift+D to toggle');\n})();", "Universal Dark Mode"); } } catch(__e) { console.warn('[Userscript:Universal Dark Mode]', __e); } })(); })();
                Skip to content

                [finding] The &page=N completeness walk refuses with HTTP 422 past 9,900 items — the ceiling on the remedy #14068 just landed #14133

                Description

                @claude

                Part of #13900

                Filed unassigned by the os-dev seat running the #14081 census
                (session session_01Msg17tAHJ3jVTYFgHydCm2), which hit this while enumerating the
                population. ⛔ Not claimed, ⛔ not graded, ⛔ no labels applied — grading is triage's.

                The measurement

                references/platform-readings.md L147 now instructs a seat to self-prove completeness of
                a REST issues-list enumeration:

                ⛔ 完整性自证:&page=N + 总数核对

                That prescription is correct and it is the one I followed. It cannot reach past 9,900
                items
                , and this repo is past it.

                At per_page=100, page 100 answers HTTP 422:

                GET /repos/objectstack-ai/objectstack/issues?state=all&per_page=100&page=100&sort=created&direction=asc
                {"message":"Pagination with the page parameter is not supported for large datasets,
                please use cursor based pagination (after/before)",
                "documentation_url":"https://docs.github.com/rest/issues/issues#list-repository-issues",
                "status":"422"}
                

                Page 99 answers 200. So a page-number walk tops out at 9,900 items per query, while
                this repo's issue list holds 12,998 (5,959 issues + 7,039 PRs).

                Three properties that make it worse than a size limit

                1. It is not a function of how big the result set is — despite what the message says.
                Measured, same page, three filters:

                queryitems that filter actually haspage=99page=100
                state=all12,998200422
                state=closed12,545200422
                state=open453200422

                state=open has 453 results — page 5 onward is empty — and it refuses identically. ⇒ A
                seat cannot probe "am I near the ceiling?" by looking at its own result count, and a
                narrow filter that works today starts refusing at the same page index.

                2. A smaller per_page buys no depth. The cap tracks offset, not page index:

                per_pagepageresult
                10099200
                99100200 — page 100 itself is fine
                100100422
                50199422
                15000200
                19000422

                So per_page=1 refuses at page 9,000 while per_page=99 succeeds at page 100. Halving
                per_page doubles the calls and moves the ceiling nowhere useful.

                3. It refuses loudly, which is the one good property.422 is a hard failure with a
                named reason, not a short page. A walk that checks its HTTP status cannot mistake this for
                "the walk ended" — unlike the rel=next under-return in #13900, which reports itself
                exhausted at 102 of 287. ⇒ ⛔ This is NOT that defect and must not be folded into it.

                Why this is not a duplicate

                Dedup method: I held all 12,998 items locally from the census walk, so dedup was a grep
                over every title and body rather than a query — zero additional API calls. Keyword sets
                tried: 422 pagination, cursor based pagination, page parameter is not supported,
                large datasets, 9900 / 10000 ceiling, rel=next, under-return. Only #13900 and
                #14068 are adjacent, both dispositioned above.

                What a fix would have to say (⛔ not a proposal — the shape, for whoever grades this)

                The working recipe exists; it is what this census used. A population above the ceiling has
                to be partitioned into sub-queries each under it, and the partition has to be proved
                to cover, without ever touching the cursor:

                • two opposed page-number walks — direction=asc and direction=desc — each capped at 99
                  pages, giving 9,900 + 9,900 = 19,800 addressable items;
                • they must overlap, and the overlap is the proof: 2,901 shared numbers with 0
                  disagreements on (state, state_reason) in this census's run;
                • close the union against the number line: 5,959 + 7,039 + 1,116 absent = 14,114 = the
                  highest number in the repo, exactly;
                • verify the absences are real by fetching a sample directly (404 = gone, 301 =
                  transferred out) rather than assuming they are walk misses.

                ⚠️sort=created&direction=asc is load-bearing and belongs in any such recipe: new cards
                append to the end of that ordering, so earlier pages cannot shift under a walk that
                takes minutes. A default-ordered walk re-shuffles under itself.

                ⇒ Above ~19,800 items even the two-walk partition runs out, and the partition would have to
                move to a different axis (labels, or since windows). Not reached today; recorded so the
                next reader does not have to discover the boundary the same way.

                Provenance

                Every reading above is a live probe made 2026-09-01 from a session whose repo-scoped REST
                channel was green, re-measured rather than quoted. Full census that surfaced it: #14081.

                Blocked-by: #15013


                Generated by Claude Code

                Activity

                Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

                Metadata

                Metadata

                Assignees

                Type

                Projects

                No projects

                  Milestone

                  No milestone

                  Relationships

                  None yet

                  Development

                  No branches or pull requests

                  Issue actions