{"id":2251632,"recorded_at":"2026-11-02T19:30:19.732237Z","observed_at":"2026-11-02T19:30:19.732176Z","subject_kind":"source_record","subject":"x402_bazaar:https://detect.halowerk.com/v1/workflow/workflow-minimum-sequential-chain-cover","kind":"listing","method":"sync.x402_bazaar/1","body":{"endpoints":[["x402","https://detect.halowerk.com/v1/workflow/workflow-minimum-sequential-chain-cover"]],"name":"detect.halowerk.com/v1/workflow/workflow-minimum-sequential-chain-cover","owner_address":"0x2880edfff13100677bf97a3cbdf3bc34771c4e5e","raw":{"accepts":[{"amount":"2000","asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","extra":{"assetTransferMethod":"eip3009","eip712Domain":{"chainId":8453,"name":"USD Coin","verifyingContract":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","version":"2"},"name":"USD Coin","version":"2"},"maxTimeoutSeconds":300,"network":"eip155:8453","payTo":"0x2880EdfFF13100677Bf97A3CBdF3Bc34771C4E5E","scheme":"exact"}],"description":"An agent that partitions a precedence workflow into independent sequential work lanes needs its claimed lane count checked against the minimum chain cover of the complete transitive order.","extensions":{"bazaar":{"info":{"input":{"body":{"artifact":{"before":[[0,1],[1,2]],"claimed_chains":1,"states":3}},"bodyType":"json","method":"POST","type":"http"},"output":{"example":{"billable":true,"findings":[{"confidence":100,"evidence":[{"page_indices":[],"page_url":null,"pattern":"workflow-minimum-sequential-chain-cover_scoped_evidence","type":"artifact"}],"limits":["Only explicitly supplied normalized JSON artifacts are examined; no network request or runtime execution occurs.","Only finite acyclic precedence is supported. Comparable states may share one sequential chain even when their relation is transitive rather than an explicit edge. Reachability closure followed by bipartite augmentation gives the exact minimum; it does not schedule durations or capacities."],"module":"workflow-minimum-sequential-chain-cover","module_cpu_ms":0,"state":"not_observed","value":{"claimed_chain_count_mismatch":false,"maximum_precedence_matching":2,"minimum_sequential_chains":1,"workflow_states":3},"warnings":[]}],"known_count":1,"scope":{"contact_values_returned":false,"network":false,"supplied_artifact_only":true},"warnings":[]},"type":"json"}},"schema":{"$schema":"https://json-schema.org/draft/2020-12/schema","properties":{"input":{"additionalProperties":false,"properties":{"body":{"additionalProperties":false,"properties":{"artifact":{"additionalProperties":false,"properties":{"before":{"items":{"items":{"maximum":127,"minimum":0,"type":"integer"},"maxItems":2,"minItems":2,"type":"array"},"maxItems":1024,"minItems":0,"type":"array"},"claimed_chains":{"maximum":128,"minimum":0,"type":"integer"},"states":{"maximum":128,"minimum":0,"type":"integer"}},"required":["states","before","claimed_chains"],"type":"object"}},"required":["artifact"],"type":"object"},"bodyType":{"enum":["json","form-data","text"],"type":"string"},"method":{"enum":["POST"],"type":"string"},"type":{"const":"http","type":"string"}},"required":["type","method","bodyType","body"],"type":"object"},"output":{"properties":{"example":{"type":"object"},"type":{"type":"string"}},"required":["type"],"type":"object"}},"required":["input"],"type":"object"}}},"lastUpdated":"2026-11-02T15:54:05.657Z","quality":{"l30DaysTotalCalls":1,"l30DaysUniquePayers":1,"lastCalledAt":"2026-11-02T15:54:05.475Z"},"resource":"https://detect.halowerk.com/v1/workflow/workflow-minimum-sequential-chain-cover","type":"http","x402Version":2},"source":"x402_bazaar","summary":"An agent that partitions a precedence workflow into independent sequential work lanes needs its claimed lane count checked against the minimum chain cover of the complete transitive order."},"body_sha256":"ed968bb00dd0c65592769d9d68b139a61d4055941b0a923707fb73037d6fc9fb","prev_id":null,"leaf":"0xcce3020d8394dfc1d7a006e93667d586bc595cd1bf0135f8be3bf0a6b3c24489","leaf_text":"{\"body\":\"ed968bb00dd0c65592769d9d68b139a61d4055941b0a923707fb73037d6fc9fb\",\"id\":2251632,\"kind\":\"listing\",\"method\":\"sync.x402_bazaar/1\",\"observed_us\":1793647819732176,\"prev\":null,\"subject\":\"x402_bazaar:https://detect.halowerk.com/v1/workflow/workflow-minimum-sequential-chain-cover\",\"subject_kind\":\"source_record\"}","day":{"day":"2026-11-02","leaves":444186,"root":"0x78fecaabbe319e56f5c4b80fc02e2052e198ad24781da8832a475ff65f2002d1","chained":"0xdc35957db5d1371ca382b9152878ffece28ec7c5cb4f98fd71ddb367f8b999b2","anchor_chain":"eip155:5042002","anchor_tx":"0x56b814612eb2e3e544153df3e91e1f7199106d1e430c7d8c6b653feeb9ebe9af","anchor_block":70432815},"proof":["0xcce2f4a0ef992c4133a8c0d0e0aaa2c7cf33acd4c8cef4ef2f3f7edb0e441a7f","0x9322e2e43252b6050c6543fa6dc2dc979042d891bd502f0f14a2d9ddc82be175","0xc4b5889c2b88fad942185cb2c67278aac9e203346ec23ad965129e3dbe4af4cf","0xc49d5b1d67950df0776dbe1b59e835606e8cb59044b96e5269d647918355a21d","0xd9daba33b23079ba6bf3bdba53f37be54cda9d397a32236321ccc8173897297b","0xb69a877c0682b38d5f68cdb651491b49f5b19d8b256997743ef029807ffa3bb4","0xa8ecf7cf531e2606349960a47214106fc84af159b4722db5ab516b7c17f3b063","0x0ed5ed6739cfba4bbdbf543225001a8de54890987f904dad40e7619dd235d5e5","0x48619ac3ad9adc0a6d8b5e404958f45c1cdffd4e7aa9d9ed91e3a21fb50aaf50","0x569a5ef70a72a62cf349922f1d2ab62b6c4c07e9a4e50914074e9e12e0603402","0x79f32fe170b18b7905e03cd8a56dff870af479aedaa23b3d71551c62cbacdbbf","0x104b0fd7f9e0a9cd51db3ad451e9a16d136da470f6efdf3cf1ad75354f332bc0","0x959c0d70f3f85beefd7b1347751e6e712eeaefce78a57d80eda6882038b85a52","0x4f21464039902a4044b17c93873adb5a93eecc8e977b4e039acb8cd5f4210b4b","0x5b456020389d8e0ef67f16a492c600b5b88189e59398bba308734db7e873e7e4","0x37d31d28d0bd3743650d57e9fbf999efa4592cac831267f83aa125335b35a16b","0xdb8bd933619a267f9790faac9839143d202be46af284371cc369cdf683f897ba","0x98cbbf2c68ab4c0b4db782aeb88bea1f30b02178cf8b5d3d24a931d19492ea6d","0x252cce55f1a3d5391c16f82d7f62494429a5f69b03486d4cfcfb7b2c96d6c884"]}