Finopswerk
finite call auction rationing correspondence
Construct the ENTIRE uniform-price finite call-auction CLEARING/RATIONING correspondence from independent original buyer/seller limit orders and COMPLETE admissible prices, not just volume maxima. At every price require positive conserved trade, no crossing residual orders, and price continuity: price >=every remaining bid and <=every remaining ask. Thus ALL strictly better-than-price orders must fill. Return ALL clearing prices and EVERY integer buyer/seller allocation respecting price.
POST https://finops.halowerk.com/v1/finite-call-auction-rationing-correspondenceInputs
| Field | Type | Required | Description |
|---|---|---|---|
| prices_cents | array | Yes | |
| buyers | array | Yes | |
| sellers | array | Yes | |
| claim | object | Yes |
Show full input schema
{
"type": "object",
"additionalProperties": false,
"required": [
"prices_cents",
"buyers",
"sellers",
"claim"
],
"properties": {
"prices_cents": {
"type": "array",
"minItems": 1,
"maxItems": 8,
"items": {
"type": "integer",
"minimum": 1,
"maximum": 1000000
},
"uniqueItems": true
},
"buyers": {
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"limit_cents",
"lots",
"priority_rank"
],
"properties": {
"limit_cents": {
"type": "integer",
"minimum": 1,
"maximum": 1000000
},
"lots": {
"type": "integer",
"minimum": 1,
"maximum": 3
},
"priority_rank": {
"type": "integer",
"minimum": 0,
"maximum": 3
}
}
}
},
"sellers": {
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"limit_cents",
"lots",
"priority_rank"
],
"properties": {
"limit_cents": {
"type": "integer",
"minimum": 1,
"maximum": 1000000
},
"lots": {
"type": "integer",
"minimum": 1,
"maximum": 3
},
"priority_rank": {
"type": "integer",
"minimum": 0,
"maximum": 3
}
}
}
},
"claim": {
"type": "object",
"minProperties": 3,
"maxProperties": 3,
"propertyNames": {
"enum": [
"max_volume",
"clearing_price_mask",
"allocation_count"
]
},
"additionalProperties": {
"oneOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"n",
"d"
],
"properties": {
"n": {
"type": "string",
"maxLength": 64,
"pattern": "^-?(0|[1-9][0-9]*)$"
},
"d": {
"type": "string",
"maxLength": 64,
"pattern": "^[1-9][0-9]*$"
}
}
},
{
"type": "object",
"additionalProperties": false,
"required": [
"n",
"d"
],
"properties": {
"n": {
"type": "null"
},
"d": {
"type": "null"
}
}
}
]
}
}
}
}Published input example
{
"prices_cents": [
8,
9,
10
],
"buyers": [
{
"limit_cents": 10,
"lots": 2,
"priority_rank": 0
}
],
"sellers": [
{
"limit_cents": 8,
"lots": 1,
"priority_rank": 0
}
],
"claim": {
"max_volume": {
"n": "1",
"d": "1"
},
"clearing_price_mask": {
"n": "4",
"d": "1"
},
"allocation_count": {
"n": "1",
"d": "1"
}
}
}Result & documentation
Machine-readable documentation of this hub
Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.
More endpoints in this hub
- Finopswerk0.003 USDC
accumulating sick leave liability
POSThttps://finops.halowerk.com/v1/accumulating-sick-leave-liabilityMeasures one closing salary-only liability for non-vesting accumulating sick leave. For N identical employees with unused old carry C and next-year entitlement E (used first), the caller supplies three scenarios of future absence days a_j w
- Finopswerk0.003 USDC
acquisition goodwill nci bridge
POSThttps://finops.halowerk.com/v1/acquisition-goodwill-nci-bridgeReconstructs one acquisition-date business-combination goodwill/NCI bridge from caller-measured identified assets, assumed liabilities, cash and non-cash consideration and previously held interest. NCI mode 0 = proportionate identifiable ne
- Finopswerk0.003 USDC
adjusted coupon cashflow ledger
POSThttps://finops.halowerk.com/v1/adjusted-coupon-cashflow-ledgerFrom a civil start date, tenor, EOM, principal, rate and explicit calendars, derives unadjusted accrual anchors, Following/ModifiedFollowing/Preceding payment dates, ACT365F exact interest and the last principal redemption. Payment adjustme