@ixo/openhands-sdk 0.0.0-stage → 0.1.0

package/dist/esm/data/receipt.js

@@ -0,0 +1,305 @@
+import { gql } from "./gql.js";
+import { entityNames } from "./profiles.js";
+import { linkedPrimaries } from "./linked.js";
+import { doneMeansProof } from "./resources.js";
+import { shortStr } from "./format.js";
+/**
+ * Two facts that live on the ask's entity, read in one round trip: the terms it
+ * anchored on itself (`proof` is the hash of the bytes — fetch and verify), and
+ * who owns it.
+ */
+async function entityFacts(entityDid) {
+    if (!entityDid)
+        return { doneMeansCid: null, owner: null };
+    try {
+        const data = await gql(`query { entities(filter: {id: {equalTo: ${JSON.stringify(entityDid)}}}) { nodes { linkedResource owner } } }`, 5);
+        const node = data.entities.nodes[0];
+        return { doneMeansCid: doneMeansProof(node?.linkedResource ?? []), owner: node?.owner ?? null };
+    }
+    catch {
+        return { doneMeansCid: null, owner: null };
+    }
+}
+const CLAIM_FIELDS = `
+  claimId
+  collectionId
+  agentAddress
+  agentDid
+  schemaType
+  submissionDate
+  paymentsStatus
+  evaluationByClaimId {
+    claimId
+    collectionId
+    agentAddress
+    agentDid
+    oracle
+    status
+    reason
+    evaluationDate
+    verificationProof
+    amount
+  }`;
+export const RECEIPT_PAGE_SIZE = 50;
+export const RECEIPT_PAGE_MAX = 100;
+/** The undecided claims every first page carries, oldest first: the front of the queue. */
+export const RECEIPT_WAITING_LIMIT = 100;
+/** How many named claims or addresses one read will carry. */
+export const RECEIPT_INCLUDE_MAX = 5;
+/* Blocksync's cursors are base64 of a JSON array; anything else is refused
+   before it reaches a query string. */
+const CURSOR = /^[A-Za-z0-9+/=_-]{1,1024}$/;
+const CLAIM_ID = /^[A-Za-z0-9._:-]{1,128}$/;
+const AGENT = /^ixo1[a-z0-9]{38,58}$/;
+export const isReceiptCursor = (value) => CURSOR.test(value);
+export const isClaimId = (value) => CLAIM_ID.test(value);
+/**
+ * Undecided, as the chain means it: no evaluation yet, or one that is PENDING
+ * (0) or FLAGGED (5) — a person still decides, and money may yet move. The
+ * relation filters are PostGraphile's connection-filter forms, checked against
+ * the testnet, devnet and mainnet schemas on 2026-10-10 (`ClaimFilter` carries
+ * `evaluationsByClaimIdExist` and `evaluationsByClaimId.some`).
+ */
+export const WAITING_FILTER = `{or: [{evaluationsByClaimIdExist: false}, {evaluationsByClaimId: {some: {status: {in: [0, 5]}}}}]}`;
+/** The request, made safe: clamped, validated, de-duplicated. Exported for the tests. */
+export function normalisePage(request) {
+    const size = Math.min(RECEIPT_PAGE_MAX, Math.max(1, Math.floor(Number(request.size ?? RECEIPT_PAGE_SIZE)) || RECEIPT_PAGE_SIZE));
+    const after = request.after && CURSOR.test(request.after) ? request.after : null;
+    const claimIds = [...new Set((request.claimIds ?? []).filter((one) => CLAIM_ID.test(one)))].slice(0, RECEIPT_INCLUDE_MAX);
+    const agents = [...new Set((request.agents ?? []).filter((one) => AGENT.test(one)))].slice(0, RECEIPT_INCLUDE_MAX);
+    return { after, size, claimIds, agents, waiting: request.waiting !== false };
+}
+const SUMMARY_FIELDS = `
+        id
+        state
+        entity
+        protocol
+        admin
+        startDate
+        endDate
+        quota
+        count
+        evaluated
+        approved
+        rejected
+        disputed`;
+/**
+ * The one query a receipt is, for either mode. Exported so the tests can hold
+ * the paged form to its promise: every claims connection it opens is bounded.
+ */
+export function receiptQuery(collectionId, claims) {
+    const id = JSON.stringify(collectionId);
+    let connections;
+    if (claims === "all") {
+        connections = `
+      claimsByCollectionId(orderBy: SUBMISSION_DATE_DESC) {
+        nodes {${CLAIM_FIELDS}
+        }
+      }`;
+    }
+    else {
+        const page = normalisePage(claims);
+        const cursor = page.after ? `, after: ${JSON.stringify(page.after)}` : "";
+        connections = `
+      recent: claimsByCollectionId(first: ${page.size}${cursor}, orderBy: SUBMISSION_DATE_DESC) {
+        pageInfo { hasNextPage endCursor }
+        nodes {${CLAIM_FIELDS}
+        }
+      }`;
+        /* A "show more" page is the history and nothing else; the queue and the
+           named claims came with the first page already. */
+        if (!page.after && page.waiting) {
+            connections += `
+      waiting: claimsByCollectionId(first: ${RECEIPT_WAITING_LIMIT}, orderBy: SUBMISSION_DATE_ASC, filter: ${WAITING_FILTER}) {
+        totalCount
+        nodes {${CLAIM_FIELDS}
+        }
+      }`;
+        }
+        if (!page.after) {
+            const named = [
+                ...(page.claimIds.length ? [`{claimId: {in: ${JSON.stringify(page.claimIds)}}}`] : []),
+                ...(page.agents.length ? [`{agentAddress: {in: ${JSON.stringify(page.agents)}}}`] : [])
+            ];
+            if (named.length) {
+                connections += `
+      named: claimsByCollectionId(first: ${RECEIPT_INCLUDE_MAX * 4}, orderBy: SUBMISSION_DATE_DESC, filter: {or: [${named.join(", ")}]}) {
+        nodes {${CLAIM_FIELDS}
+        }
+      }`;
+            }
+        }
+    }
+    return `query {
+    claimCollection(id: ${id}) {
+      quota
+      payments${connections}
+    }
+    claimCollections(filter: {id: {equalTo: ${id}}}) {
+      nodes {${SUMMARY_FIELDS}
+      }
+    }
+  }`;
+}
+const submittedAt = (claim) => {
+    const time = Date.parse(`${claim.submissionDate ?? ""}${/Z|[+-]\d\d:?\d\d$/.test(claim.submissionDate ?? "") ? "" : "Z"}`);
+    return Number.isFinite(time) ? time : 0;
+};
+/**
+ * The page, the queue and the named claims as one list: each claim once,
+ * newest first — the order every reader of `claims` has always assumed (the
+ * submit page counts "ahead of you" by it). Ties keep the order they arrived
+ * in, which for the newest page is the index's own.
+ */
+export function mergeClaims(...lists) {
+    const seen = new Map();
+    for (const list of lists)
+        for (const claim of list ?? [])
+            if (claim?.claimId && !seen.has(claim.claimId))
+                seen.set(claim.claimId, claim);
+    return [...seen.values()]
+        .map((claim, index) => ({ claim, index }))
+        .sort((a, b) => submittedAt(b.claim) - submittedAt(a.claim) || a.index - b.index)
+        .map(({ claim }) => claim);
+}
+/** What a paged answer says about where it stands. Exported for the tests. */
+export function pageFrom(request, recent, waiting) {
+    const page = normalisePage(request);
+    const info = recent?.pageInfo;
+    return {
+        after: page.after,
+        next: info?.hasNextPage && info.endCursor && CURSOR.test(info.endCursor) ? info.endCursor : null,
+        size: page.size,
+        waiting: page.after || !page.waiting ? null : typeof waiting?.totalCount === "number" ? waiting.totalCount : (waiting?.nodes?.length ?? null)
+    };
+}
+export async function loadReceipt(collectionId, options = {}) {
+    if (!/^\d+$/.test(collectionId))
+        return null;
+    const mode = options.claims ?? "all";
+    const data = await gql(receiptQuery(collectionId, mode));
+    const detail = data.claimCollection;
+    if (!detail)
+        return null;
+    const summary = data.claimCollections.nodes[0];
+    const claims = mode === "all" ? (detail.claimsByCollectionId?.nodes ?? []) : mergeClaims(detail.recent?.nodes, detail.waiting?.nodes, detail.named?.nodes);
+    const [names, entity, links] = await Promise.all([
+        entityNames([summary?.entity, summary?.protocol]),
+        entityFacts(summary?.entity),
+        /* Everyone this receipt names: whoever submitted, and whoever posted. */
+        linkedPrimaries([...claims.map((claim) => claim.agentAddress), summary?.admin ?? ""])
+    ]);
+    return {
+        collectionId,
+        state: summary?.state ?? 0,
+        quota: String(detail.quota ?? 0),
+        /* The index's counter, never the length of whatever page was read. */
+        count: summary?.count ?? (mode === "all" ? claims.length : 0),
+        approved: summary?.approved ?? 0,
+        rejected: summary?.rejected ?? 0,
+        disputed: summary?.disputed ?? 0,
+        entityName: summary?.entity ? names.get(summary.entity) ?? shortStr(summary.entity, 24, 6) : null,
+        protocolName: summary?.protocol ? names.get(summary.protocol) ?? shortStr(summary.protocol, 24, 6) : null,
+        entityDid: summary?.entity ?? null,
+        protocolDid: summary?.protocol ?? null,
+        admin: summary?.admin ?? null,
+        owner: entity.owner,
+        startDate: summary?.startDate ?? null,
+        endDate: summary?.endDate ?? null,
+        payments: detail.payments ?? null,
+        claims,
+        ...(mode === "all" ? {} : { claimsPage: pageFrom(mode, detail.recent, detail.waiting) }),
+        doneMeansCid: entity.doneMeansCid,
+        linked: Object.fromEntries([...links].map(([address, to]) => [address, to.primaryAddress]))
+    };
+}
+/**
+ * One claim, by its id — the question a waiting submitter, a membership check
+ * or a credential actually asks. One indexed row instead of a whole receipt.
+ * Null when the index does not have it (yet: it trails the chain by seconds).
+ */
+export async function loadClaim(claimId, revalidateSeconds = 5) {
+    if (!CLAIM_ID.test(claimId))
+        return null;
+    const data = await gql(`query { claim(claimId: ${JSON.stringify(claimId)}) {${CLAIM_FIELDS}
+  } }`, revalidateSeconds);
+    return data.claim ?? null;
+}
+/** Approved claims one follow-on read carries, newest first. */
+export const APPROVED_PAGE_SIZE = 50;
+/** Approved, as the chain means it: an evaluation with status APPROVED (1). Same filter form as `WAITING_FILTER`. */
+export const APPROVED_FILTER = `{evaluationsByClaimId: {some: {status: {in: [1]}}}}`;
+/** The approved-claims query, bounded. Exported so a test can hold it to its bound. */
+export function approvedQuery(collectionId, size = APPROVED_PAGE_SIZE) {
+    const first = Math.min(RECEIPT_PAGE_MAX, Math.max(1, Math.floor(size) || APPROVED_PAGE_SIZE));
+    return `query { claimCollection(id: ${JSON.stringify(collectionId)}) { claimsByCollectionId(first: ${first}, orderBy: SUBMISSION_DATE_DESC, filter: ${APPROVED_FILTER}) { totalCount nodes { claimId } } } }`;
+}
+/**
+ * The newest approved claims on an ask, by id, with the index's own total —
+ * what a chained ask's follow-on section needs (final review 2026-10, WN9e #4).
+ *
+ * It used to take the approved claims off the thread's receipt, which is a
+ * page of the newest *claims*: on a busy ask an approved answer from last
+ * week was not on it, so its follow-on never showed. This asks the index for
+ * approved claims only, bounded, and says how many there are in all, so the
+ * section can say when it shows the newest only. Null for an id that is not
+ * an ask's.
+ */
+export async function loadApprovedClaimIds(collectionId, options = {}) {
+    if (!/^\d+$/.test(collectionId))
+        return null;
+    const data = await gql(approvedQuery(collectionId, options.size), options.revalidateSeconds ?? 30);
+    const connection = data.claimCollection?.claimsByCollectionId;
+    if (!connection)
+        return null;
+    const claimIds = (connection.nodes ?? []).map((node) => node.claimId).filter((id) => CLAIM_ID.test(id));
+    return { claimIds, total: Math.max(claimIds.length, connection.totalCount ?? 0) };
+}
+/**
+ * How many undecided claims on an ask were sent before this moment: "N answers
+ * sent before yours are waiting too", counted by the index rather than by
+ * whatever slice of the receipt a page happens to hold.
+ */
+export async function waitingBefore(collectionId, submissionDate, revalidateSeconds = 10) {
+    if (!/^\d+$/.test(collectionId) || !submissionDate)
+        return null;
+    const data = await gql(`query { claimCollection(id: ${JSON.stringify(collectionId)}) { claimsByCollectionId(filter: {and: [${WAITING_FILTER}, {submissionDate: {lessThan: ${JSON.stringify(submissionDate)}}}]}) { totalCount } } }`, revalidateSeconds);
+    const total = data.claimCollection?.claimsByCollectionId?.totalCount;
+    return typeof total === "number" ? total : null;
+}
+export const DIGEST_MAX_ASKS = 10;
+export const DIGEST_VERDICTS = 20;
+/**
+ * Several asks' digests in one round trip. `/me` used to fetch ten whole
+ * receipts — every claim of every ask — to draw a dozen lines of history;
+ * this is one query with each ask's newest verdicts bounded.
+ */
+export async function loadAskDigests(collectionIds) {
+    const ids = [...new Set(collectionIds.filter((id) => /^\d{1,20}$/.test(id)))].slice(0, DIGEST_MAX_ASKS);
+    if (ids.length === 0)
+        return [];
+    const data = await gql(`query {
+    claimCollections(filter: {id: {in: ${JSON.stringify(ids)}}}, first: ${ids.length}) {
+      nodes {
+        id
+        protocol
+        startDate
+        claimsByCollectionId(first: ${DIGEST_VERDICTS}, orderBy: SUBMISSION_DATE_DESC, filter: {evaluationsByClaimIdExist: true}) {
+          nodes { evaluationByClaimId { status evaluationDate } }
+        }
+      }
+    }
+  }`);
+    const nodes = data.claimCollections.nodes ?? [];
+    const names = await entityNames(nodes.map((node) => node.protocol));
+    return nodes.map((node) => ({
+        collectionId: node.id,
+        protocolName: node.protocol ? names.get(node.protocol) ?? shortStr(node.protocol, 24, 6) : null,
+        startDate: node.startDate ?? null,
+        verdicts: (node.claimsByCollectionId?.nodes ?? [])
+            .map((claim) => claim.evaluationByClaimId)
+            .filter((evaluation) => Boolean(evaluation?.evaluationDate))
+            .map((evaluation) => ({ at: evaluation.evaluationDate, approved: evaluation.status === 1 }))
+    }));
+}
+//# sourceMappingURL=receipt.js.map

package/dist/esm/data/receipt.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"receipt.js","sourceRoot":"","sources":["../../../src/data/receipt.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,UAAU,CAAC;AAC/B,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAC5C,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAC9C,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAChD,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AA6DvC;;;;GAIG;AACH,KAAK,UAAU,WAAW,CAAC,SAAyB;IAClD,IAAI,CAAC,SAAS;QAAE,OAAO,EAAE,YAAY,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;IAC3D,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,MAAM,GAAG,CACpB,2CAA2C,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,0CAA0C,EAC9G,CAAC,CACF,CAAC;QACF,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACpC,OAAO,EAAE,YAAY,EAAE,cAAc,CAAC,IAAI,EAAE,cAAc,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,CAAC;IAClG,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,YAAY,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;IAC7C,CAAC;AACH,CAAC;AAED,MAAM,YAAY,GAAG;;;;;;;;;;;;;;;;;;;IAmBjB,CAAC;AA4DL,MAAM,CAAC,MAAM,iBAAiB,GAAG,EAAE,CAAC;AACpC,MAAM,CAAC,MAAM,gBAAgB,GAAG,GAAG,CAAC;AACpC,2FAA2F;AAC3F,MAAM,CAAC,MAAM,qBAAqB,GAAG,GAAG,CAAC;AACzC,8DAA8D;AAC9D,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,CAAC;AAErC;uCACuC;AACvC,MAAM,MAAM,GAAG,4BAA4B,CAAC;AAC5C,MAAM,QAAQ,GAAG,0BAA0B,CAAC;AAC5C,MAAM,KAAK,GAAG,uBAAuB,CAAC;AAEtC,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,KAAa,EAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC9E,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,KAAa,EAAW,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAE1E;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,oGAAoG,CAAC;AAEnI,yFAAyF;AACzF,MAAM,UAAU,aAAa,CAAC,OAA2B;IACvD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,gBAAgB,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,IAAI,iBAAiB,CAAC,CAAC,IAAI,iBAAiB,CAAC,CAAC,CAAC;IACjI,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;IACjF,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;IAC1H,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;IACnH,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,KAAK,KAAK,EAAE,CAAC;AAC/E,CAAC;AAED,MAAM,cAAc,GAAG;;;;;;;;;;;;;iBAaN,CAAC;AAElB;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,YAAoB,EAAE,MAAqB;IACtE,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;IACxC,IAAI,WAAmB,CAAC;IACxB,IAAI,MAAM,KAAK,KAAK,EAAE,CAAC;QACrB,WAAW,GAAG;;iBAED,YAAY;;QAErB,CAAC;IACP,CAAC;SAAM,CAAC;QACN,MAAM,IAAI,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;QACnC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,YAAY,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1E,WAAW,GAAG;4CAC0B,IAAI,CAAC,IAAI,GAAG,MAAM;;iBAE7C,YAAY;;QAErB,CAAC;QACL;4DACoD;QACpD,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAChC,WAAW,IAAI;6CACwB,qBAAqB,2CAA2C,cAAc;;iBAE1G,YAAY;;QAErB,CAAC;QACL,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YAChB,MAAM,KAAK,GAAG;gBACZ,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,kBAAkB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACtF,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,uBAAuB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;aACxF,CAAC;YACF,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;gBACjB,WAAW,IAAI;2CACoB,mBAAmB,GAAG,CAAC,kDAAkD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;iBACnH,YAAY;;QAErB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO;0BACiB,EAAE;;gBAEZ,WAAW;;8CAEmB,EAAE;eACjC,cAAc;;;IAGzB,CAAC;AACL,CAAC;AAED,MAAM,WAAW,GAAG,CAAC,KAAY,EAAU,EAAE;IAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,cAAc,IAAI,EAAE,GAAG,mBAAmB,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IAC3H,OAAO,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1C,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,GAAG,KAAuD;IACpF,MAAM,IAAI,GAAG,IAAI,GAAG,EAAiB,CAAC;IACtC,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,KAAK,MAAM,KAAK,IAAI,IAAI,IAAI,EAAE;YAAE,IAAI,KAAK,EAAE,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC;gBAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IACzI,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;SACtB,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;SACzC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;SAChF,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;AAC/B,CAAC;AAID,8EAA8E;AAC9E,MAAM,UAAU,QAAQ,CAAC,OAA2B,EAAE,MAA8B,EAAE,OAA+B;IACnH,MAAM,IAAI,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;IACpC,MAAM,IAAI,GAAG,MAAM,EAAE,QAAQ,CAAC;IAC9B,OAAO;QACL,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,IAAI,EAAE,IAAI,EAAE,WAAW,IAAI,IAAI,CAAC,SAAS,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI;QAChG,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,OAAO,EAAE,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,OAAO,EAAE,UAAU,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,MAAM,IAAI,IAAI,CAAC;KAC9I,CAAC;AACJ,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,WAAW,CAAC,YAAoB,EAAE,UAAsC,EAAE;IAC9F,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC;QAAE,OAAO,IAAI,CAAC;IAC7C,MAAM,IAAI,GAAkB,OAAO,CAAC,MAAM,IAAI,KAAK,CAAC;IAEpD,MAAM,IAAI,GAAG,MAAM,GAAG,CAUnB,YAAY,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC,CAAC;IAErC,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC;IACpC,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IACzB,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC/C,MAAM,MAAM,GACV,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,oBAAoB,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAC9I,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;QAC/C,WAAW,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;QACjD,WAAW,CAAC,OAAO,EAAE,MAAM,CAAC;QAC5B,yEAAyE;QACzE,eAAe,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,OAAO,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC;KACtF,CAAC,CAAC;IAEH,OAAO;QACL,YAAY;QACZ,KAAK,EAAE,OAAO,EAAE,KAAK,IAAI,CAAC;QAC1B,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC;QAChC,sEAAsE;QACtE,KAAK,EAAE,OAAO,EAAE,KAAK,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7D,QAAQ,EAAE,OAAO,EAAE,QAAQ,IAAI,CAAC;QAChC,QAAQ,EAAE,OAAO,EAAE,QAAQ,IAAI,CAAC;QAChC,QAAQ,EAAE,OAAO,EAAE,QAAQ,IAAI,CAAC;QAChC,UAAU,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,QAAQ,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI;QACjG,YAAY,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI;QACzG,SAAS,EAAE,OAAO,EAAE,MAAM,IAAI,IAAI;QAClC,WAAW,EAAE,OAAO,EAAE,QAAQ,IAAI,IAAI;QACtC,KAAK,EAAE,OAAO,EAAE,KAAK,IAAI,IAAI;QAC7B,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,SAAS,EAAE,OAAO,EAAE,SAAS,IAAI,IAAI;QACrC,OAAO,EAAE,OAAO,EAAE,OAAO,IAAI,IAAI;QACjC,QAAQ,EAAE,MAAM,CAAC,QAAQ,IAAI,IAAI;QACjC,MAAM;QACN,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;QACxF,YAAY,EAAE,MAAM,CAAC,YAAY;QACjC,MAAM,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC;KAC5F,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAAC,OAAe,EAAE,iBAAiB,GAAG,CAAC;IACpE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC;QAAE,OAAO,IAAI,CAAC;IACzC,MAAM,IAAI,GAAG,MAAM,GAAG,CAA0B,0BAA0B,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,MAAM,YAAY;MAC/G,EAAE,iBAAiB,CAAC,CAAC;IACzB,OAAO,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC;AAC5B,CAAC;AAED,gEAAgE;AAChE,MAAM,CAAC,MAAM,kBAAkB,GAAG,EAAE,CAAC;AAErC,qHAAqH;AACrH,MAAM,CAAC,MAAM,eAAe,GAAG,qDAAqD,CAAC;AAErF,uFAAuF;AACvF,MAAM,UAAU,aAAa,CAAC,YAAoB,EAAE,IAAI,GAAG,kBAAkB;IAC3E,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,gBAAgB,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,kBAAkB,CAAC,CAAC,CAAC;IAC9F,OAAO,+BAA+B,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,mCAAmC,KAAK,4CAA4C,eAAe,wCAAwC,CAAC;AAChN,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACxC,YAAoB,EACpB,UAAyD,EAAE;IAE3D,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC;QAAE,OAAO,IAAI,CAAC;IAC7C,MAAM,IAAI,GAAG,MAAM,GAAG,CACpB,aAAa,CAAC,YAAY,EAAE,OAAO,CAAC,IAAI,CAAC,EACzC,OAAO,CAAC,iBAAiB,IAAI,EAAE,CAChC,CAAC;IACF,MAAM,UAAU,GAAG,IAAI,CAAC,eAAe,EAAE,oBAAoB,CAAC;IAC9D,IAAI,CAAC,UAAU;QAAE,OAAO,IAAI,CAAC;IAC7B,MAAM,QAAQ,GAAG,CAAC,UAAU,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IACxG,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC,UAAU,IAAI,CAAC,CAAC,EAAE,CAAC;AACpF,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CAAC,YAAoB,EAAE,cAAsB,EAAE,iBAAiB,GAAG,EAAE;IACtG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,cAAc;QAAE,OAAO,IAAI,CAAC;IAChE,MAAM,IAAI,GAAG,MAAM,GAAG,CACpB,+BAA+B,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,2CAA2C,cAAc,iCAAiC,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,0BAA0B,EAC7M,iBAAiB,CAClB,CAAC;IACF,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,EAAE,oBAAoB,EAAE,UAAU,CAAC;IACrE,OAAO,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;AAClD,CAAC;AAWD,MAAM,CAAC,MAAM,eAAe,GAAG,EAAE,CAAC;AAClC,MAAM,CAAC,MAAM,eAAe,GAAG,EAAE,CAAC;AAElC;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAAC,aAAgC;IACnE,MAAM,GAAG,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC;IACxG,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAChC,MAAM,IAAI,GAAG,MAAM,GAAG,CAInB;yCACoC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,cAAc,GAAG,CAAC,MAAM;;;;;sCAK9C,eAAe;;;;;IAKjD,CAAC,CAAC;IACJ,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,IAAI,EAAE,CAAC;IAChD,MAAM,KAAK,GAAG,MAAM,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;IACpE,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC1B,YAAY,EAAE,IAAI,CAAC,EAAE;QACrB,YAAY,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI;QAC/F,SAAS,EAAE,IAAI,CAAC,SAAS,IAAI,IAAI;QACjC,QAAQ,EAAE,CAAC,IAAI,CAAC,oBAAoB,EAAE,KAAK,IAAI,EAAE,CAAC;aAC/C,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,mBAAmB,CAAC;aACzC,MAAM,CAAC,CAAC,UAAU,EAAoE,EAAE,CAAC,OAAO,CAAC,UAAU,EAAE,cAAc,CAAC,CAAC;aAC7H,GAAG,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,UAAU,CAAC,cAAc,EAAE,QAAQ,EAAE,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC,CAAC;KAC/F,CAAC,CAAC,CAAC;AACN,CAAC"}

package/dist/esm/data/resources.d.ts

@@ -0,0 +1,30 @@
+/**
+ * Which linked resource on an ask's entity is which.
+ *
+ * An ask's entity carries more than one document now, and they are told apart
+ * by **type**, never by the fragment their id ends in.
+ *
+ * That rule is the whole reason this file exists. Our terms — what would count
+ * as done, published before the work — used to live at `{id}#rub`, and that is
+ * precisely the fragment the evals-engine reads a collection's machine rules
+ * from (`type === "rubric"` at an id ending `#rub`, their `rubric/resolve.ts`).
+ * The two documents are not interchangeable and their `proof` fields are not
+ * even the same kind of string: ours is a CIDv1, theirs a hex sha256. A reader
+ * that matched the fragment would hand a page an address that fetches nothing,
+ * or measure somebody's work against the wrong document.
+ *
+ * So: the type identifies the terms, the fragment is decoration, and both
+ * documents can sit on one entity without either shadowing the other. Every
+ * ask posted before the move still resolves, because the type was always there.
+ */
+/** Just enough of a linked resource to sort one from another. */
+export interface ResourceLike {
+    type?: string | null;
+    id?: string | null;
+    proof?: string | null;
+}
+/** Our terms — a CID, fetchable from either public store. */
+export declare const doneMeansProof: (resources: readonly ResourceLike[] | null | undefined) => string | null;
+/** The engine's rubric — a hex sha256 of its stored bytes, not a CID (EB4). */
+export declare const engineRubricProof: (resources: readonly ResourceLike[] | null | undefined) => string | null;
+//# sourceMappingURL=resources.d.ts.map

package/dist/esm/data/resources.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"resources.d.ts","sourceRoot":"","sources":["../../../src/data/resources.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,iEAAiE;AACjE,MAAM,WAAW,YAAY;IAC3B,IAAI,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACnB,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CACvB;AAED,6DAA6D;AAC7D,eAAO,MAAM,cAAc,GAAI,WAAW,SAAS,YAAY,EAAE,GAAG,IAAI,GAAG,SAAS,KAAG,MAAM,GAAG,IAClB,CAAC;AAE/E,+EAA+E;AAC/E,eAAO,MAAM,iBAAiB,GAAI,WAAW,SAAS,YAAY,EAAE,GAAG,IAAI,GAAG,SAAS,KAAG,MAAM,GAAG,IACU,CAAC"}

package/dist/esm/data/resources.js

@@ -0,0 +1,24 @@
+/**
+ * Which linked resource on an ask's entity is which.
+ *
+ * An ask's entity carries more than one document now, and they are told apart
+ * by **type**, never by the fragment their id ends in.
+ *
+ * That rule is the whole reason this file exists. Our terms — what would count
+ * as done, published before the work — used to live at `{id}#rub`, and that is
+ * precisely the fragment the evals-engine reads a collection's machine rules
+ * from (`type === "rubric"` at an id ending `#rub`, their `rubric/resolve.ts`).
+ * The two documents are not interchangeable and their `proof` fields are not
+ * even the same kind of string: ours is a CIDv1, theirs a hex sha256. A reader
+ * that matched the fragment would hand a page an address that fetches nothing,
+ * or measure somebody's work against the wrong document.
+ *
+ * So: the type identifies the terms, the fragment is decoration, and both
+ * documents can sit on one entity without either shadowing the other. Every
+ * ask posted before the move still resolves, because the type was always there.
+ */
+/** Our terms — a CID, fetchable from either public store. */
+export const doneMeansProof = (resources) => resources?.find((resource) => resource?.type === "DoneMeans")?.proof || null;
+/** The engine's rubric — a hex sha256 of its stored bytes, not a CID (EB4). */
+export const engineRubricProof = (resources) => resources?.find((resource) => resource?.type === "rubric" && resource?.id?.endsWith("#rub"))?.proof || null;
+//# sourceMappingURL=resources.js.map

package/dist/esm/data/resources.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"resources.js","sourceRoot":"","sources":["../../../src/data/resources.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AASH,6DAA6D;AAC7D,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,SAAqD,EAAiB,EAAE,CACrG,SAAS,EAAE,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,EAAE,IAAI,KAAK,WAAW,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC;AAE/E,+EAA+E;AAC/E,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,SAAqD,EAAiB,EAAE,CACxG,SAAS,EAAE,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,EAAE,IAAI,KAAK,QAAQ,IAAI,QAAQ,EAAE,EAAE,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC"}

package/dist/esm/data/sametask.d.ts

@@ -0,0 +1,35 @@
+/**
+ * Is this ask already on the board?
+ *
+ * The board carried three open asks reading "Map the buildings between
+ * 52.51,13.37 and 52.53,13.41 in OpenStreetMap…" — identical sentences, live
+ * at the same moment, each escrowing its own money. Nobody chose that; a
+ * seeding script was run twice and the surface had no opinion about it.
+ *
+ * The check is deliberately **advisory and never a block**. A poster may have
+ * excellent reasons to run the same ask again — a second round, a wider net,
+ * a first attempt that went nowhere — and money is theirs to commit. What the
+ * surface owes them is not a veto but the fact: one exactly like this is open
+ * right now, here is its link, decide.
+ *
+ * The comparison lives here rather than in the page because the answer needs
+ * the board's data anyway, and because /ask has bytes to spare only if it
+ * carries none of this.
+ */
+/**
+ * A title reduced to what a person would call "the same thing".
+ *
+ * Case, spacing and end punctuation are noise for this purpose. Nothing
+ * cleverer: stemming or synonyms would start declaring different asks
+ * identical, and a false "you already asked this" is worse than silence —
+ * it argues with somebody about their own intent.
+ */
+export declare const normalizeTask: (title: string) => string;
+export interface TaskLike {
+    id: string;
+    title: string;
+}
+/** The first ask whose title is the same thing, or null. Callers pass only
+ *  asks a poster would actually care to hear about — open, and paying. */
+export declare function findSameTask<T extends TaskLike>(what: string, among: T[]): T | null;
+//# sourceMappingURL=sametask.d.ts.map

package/dist/esm/data/sametask.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sametask.d.ts","sourceRoot":"","sources":["../../../src/data/sametask.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH;;;;;;;GAOG;AACH,eAAO,MAAM,aAAa,GAAI,OAAO,MAAM,KAAG,MAKnC,CAAC;AAEZ,MAAM,WAAW,QAAQ;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;CACf;AAED;0EAC0E;AAC1E,wBAAgB,YAAY,CAAC,CAAC,SAAS,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG,IAAI,CAInF"}

package/dist/esm/data/sametask.js

@@ -0,0 +1,40 @@
+/**
+ * Is this ask already on the board?
+ *
+ * The board carried three open asks reading "Map the buildings between
+ * 52.51,13.37 and 52.53,13.41 in OpenStreetMap…" — identical sentences, live
+ * at the same moment, each escrowing its own money. Nobody chose that; a
+ * seeding script was run twice and the surface had no opinion about it.
+ *
+ * The check is deliberately **advisory and never a block**. A poster may have
+ * excellent reasons to run the same ask again — a second round, a wider net,
+ * a first attempt that went nowhere — and money is theirs to commit. What the
+ * surface owes them is not a veto but the fact: one exactly like this is open
+ * right now, here is its link, decide.
+ *
+ * The comparison lives here rather than in the page because the answer needs
+ * the board's data anyway, and because /ask has bytes to spare only if it
+ * carries none of this.
+ */
+/**
+ * A title reduced to what a person would call "the same thing".
+ *
+ * Case, spacing and end punctuation are noise for this purpose. Nothing
+ * cleverer: stemming or synonyms would start declaring different asks
+ * identical, and a false "you already asked this" is worse than silence —
+ * it argues with somebody about their own intent.
+ */
+export const normalizeTask = (title) => title
+    .toLowerCase()
+    .replace(/\s+/g, " ")
+    .replace(/[.,;:!?"'`]+$/g, "")
+    .trim();
+/** The first ask whose title is the same thing, or null. Callers pass only
+ *  asks a poster would actually care to hear about — open, and paying. */
+export function findSameTask(what, among) {
+    const wanted = normalizeTask(what);
+    if (wanted.length < 8)
+        return null;
+    return among.find((candidate) => normalizeTask(candidate.title) === wanted) ?? null;
+}
+//# sourceMappingURL=sametask.js.map

package/dist/esm/data/sametask.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sametask.js","sourceRoot":"","sources":["../../../src/data/sametask.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,KAAa,EAAU,EAAE,CACrD,KAAK;KACF,WAAW,EAAE;KACb,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC;KACpB,OAAO,CAAC,gBAAgB,EAAE,EAAE,CAAC;KAC7B,IAAI,EAAE,CAAC;AAOZ;0EAC0E;AAC1E,MAAM,UAAU,YAAY,CAAqB,IAAY,EAAE,KAAU;IACvE,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;IACnC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACnC,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,aAAa,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC;AACtF,CAAC"}

package/dist/esm/data/shortName.d.ts

@@ -0,0 +1,52 @@
+/**
+ * The short form of somebody's account name: "Peter B.", never more.
+ *
+ * A leaderboard is read by strangers, and the board's promise is that it
+ * names nobody who did not ask to be named. When somebody *does* ask — the
+ * opt-in on /me — what they get is this: a given name and an initial. Enough
+ * for a friend to find them, not enough for a stranger to search for them.
+ * Only this form is ever stored or published; the full display name is read,
+ * shortened, and dropped on the spot.
+ *
+ * The source is a Matrix display name, which is a string somebody typed and
+ * nobody checked, and the data says what that means in practice: "peter
+ * bulovec gmail", "Graeme Leighton test 6", an address, a whole email. So
+ * the rules below are less about formatting than about refusing:
+ *
+ * - `cleanName` first, so everything the estate already refuses as a name —
+ *   address-shaped, sentence-long, a wallet's own default label — is refused
+ *   here too, by the same rule.
+ * - Invisible characters go before anything is judged. A zero-width space is
+ *   how an address slips past a pattern that looks for one; a bidi override
+ *   is how a name renders as something other than what it is.
+ * - An email keeps only its local part, and a trailing mail-provider word
+ *   ("… gmail") is the sign of one typed out by hand. When what is left of
+ *   either is a single word, it is a mail handle, not a name, and it is
+ *   refused rather than printed.
+ * - A handle joins its words with punctuation instead of a space —
+ *   "peter.bulovec", "peter_bulovec", "Peter/Bulovec" — and printing that
+ *   whole would publish the surname the short form exists to drop. So those
+ *   joins are split into words before anything is chosen, and a single
+ *   word written as two ("PeterBulovec") is split at its capital. Only a
+ *   single word: "DeShawn Smith" has a surname already and keeps its given
+ *   name whole, while a lone "DeShawn" becomes "De S." — a clumsier short
+ *   name, never a longer one. A hyphen and an apostrophe stay: Jean-Luc
+ *   and O'Brien are names, not joins.
+ * - The given name that is left must be letters, joined only by a hyphen or
+ *   an apostrophe. Anything else is refused rather than printed.
+ * - Whatever survives must contain no "@", no digit, no "ixo1" and no
+ *   "did-ixo". A digit is almost never part of somebody's given name and very
+ *   often part of a handle, a birth year or a test account.
+ *
+ * Null is the ordinary answer, and it is not a failure: the board then shows
+ * a generated name, which is what it shows for everybody who never chose one.
+ *
+ * Idempotent — the short form of a short form is itself — so a stored value
+ * can be run through this again on the way out without drifting.
+ */
+/**
+ * "Given L." from a display name, or null when there is no honest short name
+ * in it. See the module comment for every rule and why.
+ */
+export declare function shortName(raw: string | null | undefined): string | null;
+//# sourceMappingURL=shortName.d.ts.map

package/dist/esm/data/shortName.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"shortName.d.ts","sourceRoot":"","sources":["../../../src/data/shortName.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6CG;AAyCH;;;GAGG;AACH,wBAAgB,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,GAAG,MAAM,GAAG,IAAI,CAmCvE"}

package/dist/esm/data/shortName.js

@@ -0,0 +1,119 @@
+/**
+ * The short form of somebody's account name: "Peter B.", never more.
+ *
+ * A leaderboard is read by strangers, and the board's promise is that it
+ * names nobody who did not ask to be named. When somebody *does* ask — the
+ * opt-in on /me — what they get is this: a given name and an initial. Enough
+ * for a friend to find them, not enough for a stranger to search for them.
+ * Only this form is ever stored or published; the full display name is read,
+ * shortened, and dropped on the spot.
+ *
+ * The source is a Matrix display name, which is a string somebody typed and
+ * nobody checked, and the data says what that means in practice: "peter
+ * bulovec gmail", "Graeme Leighton test 6", an address, a whole email. So
+ * the rules below are less about formatting than about refusing:
+ *
+ * - `cleanName` first, so everything the estate already refuses as a name —
+ *   address-shaped, sentence-long, a wallet's own default label — is refused
+ *   here too, by the same rule.
+ * - Invisible characters go before anything is judged. A zero-width space is
+ *   how an address slips past a pattern that looks for one; a bidi override
+ *   is how a name renders as something other than what it is.
+ * - An email keeps only its local part, and a trailing mail-provider word
+ *   ("… gmail") is the sign of one typed out by hand. When what is left of
+ *   either is a single word, it is a mail handle, not a name, and it is
+ *   refused rather than printed.
+ * - A handle joins its words with punctuation instead of a space —
+ *   "peter.bulovec", "peter_bulovec", "Peter/Bulovec" — and printing that
+ *   whole would publish the surname the short form exists to drop. So those
+ *   joins are split into words before anything is chosen, and a single
+ *   word written as two ("PeterBulovec") is split at its capital. Only a
+ *   single word: "DeShawn Smith" has a surname already and keeps its given
+ *   name whole, while a lone "DeShawn" becomes "De S." — a clumsier short
+ *   name, never a longer one. A hyphen and an apostrophe stay: Jean-Luc
+ *   and O'Brien are names, not joins.
+ * - The given name that is left must be letters, joined only by a hyphen or
+ *   an apostrophe. Anything else is refused rather than printed.
+ * - Whatever survives must contain no "@", no digit, no "ixo1" and no
+ *   "did-ixo". A digit is almost never part of somebody's given name and very
+ *   often part of a handle, a birth year or a test account.
+ *
+ * Null is the ordinary answer, and it is not a failure: the board then shows
+ * a generated name, which is what it shows for everybody who never chose one.
+ *
+ * Idempotent — the short form of a short form is itself — so a stored value
+ * can be run through this again on the way out without drifting.
+ */
+import { cleanName } from "./format.js";
+/* Zero-width and bidi-control characters, plus the soft hyphen and the
+   Mongolian vowel separator, which render as nothing and split a pattern. */
+const INVISIBLE = /[\u00ad\u061c\u180e\u200b-\u200f\u202a-\u202e\u2060-\u2069\ufeff]/g;
+const EMAIL = /^[^\s@]+@[^\s@]+\.[^\s@]+$/;
+/* Words a hand-typed email leaves at the end of a name: "peter bulovec gmail",
+   "jsmith yahoo com". Matched whole and case-insensitively. */
+const PROVIDERS = new Set([
+    "gmail", "googlemail", "yahoo", "ymail", "outlook", "hotmail", "live", "msn", "icloud", "me", "mac",
+    "proton", "protonmail", "aol", "gmx", "yandex", "zoho", "mail", "com", "net", "org", "ixo"
+]);
+/* What a handle joins words with. Not "-" or an apostrophe, which names use;
+   not "@", which is refused outright below. */
+const JOINS = /[._/\\,+|:;~*#&=!?()[\]{}<>"^%$]+/g;
+/* Letters, joined only as names join them. */
+const GIVEN = /^[\p{L}\p{M}]+(?:['’-][\p{L}\p{M}]+)*$/u;
+const GIVEN_MAX = 24;
+const SEGMENTER = (() => {
+    try {
+        const Segmenter = Intl.Segmenter;
+        return Segmenter ? new Segmenter(undefined, { granularity: "grapheme" }) : null;
+    }
+    catch {
+        return null;
+    }
+})();
+/** User-perceived characters, so "Ž" written as Z plus a caron is one of them. */
+const graphemes = (text) => (SEGMENTER ? Array.from(SEGMENTER.segment(text), (part) => part.segment) : Array.from(text));
+const REFUSED = /@|\p{N}|ixo1|did-ixo/iu;
+/**
+ * "Given L." from a display name, or null when there is no honest short name
+ * in it. See the module comment for every rule and why.
+ */
+export function shortName(raw) {
+    const cleaned = cleanName(raw);
+    if (!cleaned)
+        return null;
+    let text = cleaned.normalize("NFC").replace(INVISIBLE, "").replace(/\s+/g, " ").trim();
+    if (EMAIL.test(text))
+        text = text.slice(0, text.indexOf("@")).replace(/[._+-]+/g, " ").trim();
+    text = text.replace(/^@+/, "").trim();
+    text = text.replace(JOINS, " ").replace(/\s+/g, " ").trim();
+    let words = text.split(" ").filter(Boolean);
+    let providerDropped = false;
+    while (words.length > 1) {
+        const last = words[words.length - 1];
+        const isProvider = PROVIDERS.has(last.toLowerCase());
+        if (!isProvider && !/^\p{Nd}+$/u.test(last))
+            break;
+        if (isProvider)
+            providerDropped = true;
+        words = words.slice(0, -1);
+    }
+    words = words.filter((word) => /^\p{L}/u.test(word));
+    if (words.length === 0)
+        return null;
+    if (providerDropped && words.length === 1)
+        return null;
+    /* One word left that is two written together: split at the capital, after
+       everything else is trimmed, so the short form of a short form is itself. */
+    if (words.length === 1)
+        words = words[0].replace(/(\p{Ll})(\p{Lu})/gu, "$1 $2").split(" ");
+    let given = graphemes(words[0]).slice(0, GIVEN_MAX).join("").replace(/[\p{P}\p{S}]+$/u, "");
+    if (!given || !GIVEN.test(given))
+        return null;
+    if (given === given.toLowerCase() && given !== given.toUpperCase()) {
+        const [first = "", ...rest] = graphemes(given);
+        given = first.toUpperCase() + rest.join("");
+    }
+    const result = words.length === 1 ? given : `${given} ${(graphemes(words[words.length - 1])[0] ?? "").toUpperCase()}.`;
+    return REFUSED.test(result) ? null : result;
+}
+//# sourceMappingURL=shortName.js.map