[{"_1":2,"_178":-5,"_179":-5},"loaderData",{"_3":4,"_93":94},"root",{"_5":6,"_36":37,"_66":67},"ctx",{"_7":8,"_23":-5,"_24":25,"_26":27,"_28":20,"_29":20,"_30":20,"_31":-5,"_32":33,"_34":20,"_35":20},"auth",{"_9":-5,"_10":-5,"_11":-5,"_12":-5,"_13":-5,"_14":-5,"_15":-5,"_16":-5,"_17":-5,"_18":-5,"_19":20,"_21":22},"sessionClaims","sessionId","sessionStatus","userId","actor","orgId","orgRole","orgSlug","orgPermissions","factorVerificationAge","isAuthenticated",false,"tokenType","session_token","user","preferencesKeybindings","default","preferencesTheme","light","preferencesFixers","preferencesCopilot","preferencesSelectionAi","preferencesChatPanelState","notificationCount",0,"flagDenols","isTeamOrgMember","ENV",{"_38":39,"_40":41,"_42":43,"_44":45,"_46":47,"_48":49,"_50":51,"_52":53,"_54":55,"_56":57,"_58":59,"_60":61,"_62":63,"_64":65},"REACT_APP_SENTRY_DSN","https://586020d86f05489db63a554690acf1e9@o1398359.ingest.sentry.io/6724499","VAL_RUNTIME_NAME","prod","RENDER_GIT_COMMIT","7721b06a805a6662fde743a1ec849364175efb5b","RENDER_GIT_BRANCH","main","CLERK_PUBLISHABLE_KEY","pk_live_Y2xlcmsudmFsLnRvd24k","POSTHOG_API_TOKEN","phc_nmoyuAkStEZuUp69rYlg1DZgrIt19Gx0Y4Hwf8tGgJP","POSTHOG_API_HOST","https://wart.val.town","WEB_API_TEMPLATE","https://{val}.web.val.run","APP_URL","https://www.val.town","MODULE_URL","https://esm.town","VANITY_WEB_API_TEMPLATE","https://{label}.val.run/","DENOLS_URL","https://lsp.val.town","NODE_ENV","production","API_URL","https://api.val.town","clerkState",{"_68":69},"__internal_clerk_state",{"_70":71,"_72":47,"_73":74,"_75":74,"_76":20,"_77":74,"_78":74,"_79":74,"_80":74,"_81":82,"_91":20,"_92":20},"__clerk_ssr_state",{"_21":22,"_9":-5,"_10":-5,"_11":-5,"_12":-5,"_13":-5,"_14":-5,"_15":-5,"_16":-5,"_17":-5,"_18":-5,"_19":20},"__publishableKey","__proxyUrl","","__domain","__isSatellite","__signInUrl","__signUpUrl","__afterSignInUrl","__afterSignUpUrl","__clerk_debug",{"_83":20,"_19":20,"_84":74,"_85":86,"_87":74,"_88":47,"_89":20,"_90":74},"isSignedIn","proxyUrl","reason","session-token-and-uat-missing","message","publishableKey","isSatellite","domain","__telemetryDisabled","__telemetryDebug","routes/embed.x.$handle.$name.$",{"_95":96,"_97":98,"_99":100,"_101":102,"_153":154,"_175":176,"_177":-5},"handle","ashryanio","name","origami","path","backend/origami.ts","project",{"_103":104,"_97":98,"_105":106,"_107":-5,"_108":20,"_109":110,"_111":74,"_112":-5,"_12":113,"_114":-5,"_115":20,"_116":-5,"_117":-5,"_118":33,"_14":119,"_120":-5,"_121":-5,"_122":123,"_124":123,"_125":126,"_127":126,"_128":126,"_129":123,"_130":123,"_23":131,"_134":135,"_139":140,"_152":20},"id","c0bfc676-06f3-11f1-9d50-42dde27851f2","createdAt",["D",1770777940578],"deletedAt","legacyEnvVars","privacy","public","description","imageUrl","97567c3b-8285-4589-880d-547c23383b76","pinnedFileId","pinPreview","pinMigrated","screenshotVersion","likeCount","112e17ac-118d-4072-aca6-a4ddc6b3970f","tursoName","tursoHostname","userPerm","r","valPerm","blobPerm","rw","emailPerm","sqlitePerm","projectPerm","telemetryPerm",{"_95":96,"_132":133},"profileImageUrl","https://img.clerk.com/eyJ0eXBlIjoicHJveHkiLCJzcmMiOiJodHRwczovL2ltYWdlcy5jbGVyay5kZXYvb2F1dGhfZ2l0aHViL2ltZ18yaG5kR0hRRTM0S1BSeXlIR2hCdjFqb1dTS3AifQ","org",{"_95":96,"_136":133,"_12":113,"_137":138},"avatar","tier","pro","branch",{"_141":142,"_97":45,"_103":143,"_144":104,"_145":-5,"_146":-5,"_147":-5,"_148":-5,"_149":-5,"_150":98,"_151":96},"version",57,"c0bffe16-06f3-11f1-9d50-42dde27851f2","projectId","forkedBranchId","forkedBranchVersion","forkedProjectPrivacy","forkedProjectId","forkedProjectOrgId","projectName","userHandle","isOwned","file",{"_103":155,"_97":156,"_157":158,"_159":160,"_161":143,"_162":142,"_163":164,"_105":165,"_141":166,"_167":168,"_169":170,"_171":20,"_172":-5,"_99":173},"71bb5300-0726-11f1-b1a1-42dde27851f2","origami.ts","fileId","bcde7888-06f6-11f1-8c31-42dde27851f2","parentId","bc3f2738-06f6-11f1-85a7-42dde27851f2","branchId","branchVersion","latest",true,["D",1770799712336],29,"fileType","script","content","import ear from \"https://esm.sh/rabbit-ear@0.9.4\";\nimport type { GeneratedBy, OrigamiArtifact } from \"../shared/types.ts\";\nimport { getLatestOrigami, setLatestOrigami } from \"./storage.ts\";\n\nconst HOUR_MS = 60 * 60 * 1000;\nconst EPSILON = 1e-8;\nconst MIN_POLYGON_AREA = 2e-4;\nconst FOLD_COUNT = 2;\nconst MAX_ATTEMPTS_PER_FOLD = 20;\nconst MAX_LAYER_COUNT = 16;\n\ntype Point2 = [number, number];\n\ninterface OrigamiGraph {\n vertices_coords?: Point2[];\n edges_vertices?: [number, number][];\n}\n\ninterface RabbitEarRoot {\n default?: RabbitEarRoot;\n origami?: () => OrigamiGraph;\n cp?: () => OrigamiGraph;\n line?: {\n fromAngle?: (angle: number) => {\n translate: (x: number, y: number) => unknown;\n };\n };\n svg?: () => unknown;\n graph?: {\n square?: () => OrigamiGraph;\n };\n}\n\ninterface RabbitEarModel {\n flatFold: (crease: unknown) => unknown;\n folded: () => unknown;\n copy?: () => RabbitEarModel;\n edges_vertices?: unknown[];\n faces_vertices?: unknown[];\n}\n\ninterface GenerateOptions {\n generatedBy: GeneratedBy;\n force?: boolean;\n now?: Date;\n}\n\ninterface Layer {\n points: Point2[];\n isFront: boolean;\n hasBeenFolded: boolean;\n}\n\ninterface FoldLine {\n a: Point2;\n b: Point2;\n}\n\ninterface SplitResult {\n positive: Point2[] | null;\n negative: Point2[] | null;\n intersections: Point2[];\n}\n\ninterface FoldResult {\n layers: Layer[];\n crease: FoldLine | null;\n}\n\ninterface Bounds {\n minX: number;\n minY: number;\n maxX: number;\n maxY: number;\n}\n\nfunction getHourSeed(date: Date): number {\n return Math.floor(date.getTime() / HOUR_MS);\n}\n\nfunction buildId(hourSeed: number, now: Date, force: boolean): string {\n if (!force) {\n return `origami-${hourSeed}`;\n }\n return `origami-${hourSeed}-force-${now.getTime()}`;\n}\n\nfunction mulberry32(seed: number): () => number {\n let current = seed >>> 0;\n return () => {\n current = (current + 0x6d2b79f5) >>> 0;\n let mixed = Math.imul(current ^ (current >>> 15), current | 1);\n mixed ^= mixed + Math.imul(mixed ^ (mixed >>> 7), mixed | 61);\n return ((mixed ^ (mixed >>> 14)) >>> 0) / 4294967296;\n };\n}\n\nfunction hsl(hue: number, saturation: number, lightness: number): string {\n const wrappedHue = ((hue % 360) + 360) % 360;\n const s = Math.max(0, Math.min(100, Math.round(saturation)));\n const l = Math.max(0, Math.min(100, Math.round(lightness)));\n return `hsl(${wrappedHue} ${s}% ${l}%)`;\n}\n\nfunction colorPair(seed: number): { front: string; back: string } {\n const random = mulberry32(seed ^ 0x3d6e17a9);\n const frontHue = Math.floor(random() * 360);\n const backHue = (frontHue + 140 + Math.floor(random() * 120)) % 360;\n return {\n front: hsl(frontHue, 58 + random() * 18, 72 + random() * 10),\n back: hsl(backHue, 52 + random() * 18, 58 + random() * 12),\n };\n}\n\nfunction numberText(value: number): string {\n return Number(value.toFixed(6)).toString();\n}\n\nfunction pointText([x, y]: Point2): string {\n return `${numberText(x)},${numberText(y)}`;\n}\n\nfunction pointsText(points: Point2[]): string {\n return points.map(pointText).join(\" \");\n}\n\nfunction lineSvg(a: Point2, b: Point2, width: number): string {\n return ``;\n}\n\nfunction rabbitEarRoots(): RabbitEarRoot[] {\n const root = ear as unknown as RabbitEarRoot;\n const roots = [root];\n if (root.default && typeof root.default === \"object\") {\n roots.push(root.default);\n }\n return roots;\n}\n\nfunction extractSvgMarkup(candidate: unknown): string | null {\n if (!candidate) {\n return null;\n }\n if (typeof candidate === \"string\") {\n return candidate.includes(\";\n if (typeof record.outerHTML === \"string\" && record.outerHTML.includes(\" string }).toString === \"function\"\n ) {\n const value = (candidate as { toString: () => string }).toString();\n if (typeof value === \"string\" && value.includes(\";\n const style = {\n faces: {\n front: { fill: colors.front },\n back: { fill: colors.back },\n },\n edges: {\n boundary: { stroke: \"#000000\", \"stroke-width\": 0.01, \"stroke-linecap\": \"round\" },\n mountain: { stroke: \"#000000\", \"stroke-width\": 0.0085, \"stroke-linecap\": \"round\" },\n valley: { stroke: \"#000000\", \"stroke-width\": 0.0085, \"stroke-linecap\": \"round\" },\n flat: { stroke: \"#000000\", \"stroke-width\": 0.0085, \"stroke-linecap\": \"round\" },\n unassigned: { stroke: \"#000000\", \"stroke-width\": 0.0085, \"stroke-linecap\": \"round\" },\n },\n };\n\n if (typeof svg.size === \"function\") {\n const sized = (svg.size as (...args: unknown[]) => unknown)(1.2, 1.2);\n const chain = (sized && typeof sized === \"object\")\n ? sized as Record\n : svg;\n if (typeof chain.padding === \"function\") {\n (chain.padding as (...args: unknown[]) => unknown)(0.14);\n }\n if (typeof chain.strokeWidth === \"function\") {\n (chain.strokeWidth as (...args: unknown[]) => unknown)(0.01);\n }\n }\n\n if (typeof svg.origami !== \"function\") {\n continue;\n }\n (svg.origami as (...args: unknown[]) => unknown)(folded, style);\n\n const markup = extractSvgMarkup(svg);\n if (markup) {\n return markup;\n }\n } catch {\n continue;\n }\n }\n\n return null;\n}\n\nfunction pointAlmostEqual(a: Point2, b: Point2, epsilon = 1e-6): boolean {\n const dx = a[0] - b[0];\n const dy = a[1] - b[1];\n return dx * dx + dy * dy <= epsilon * epsilon;\n}\n\nfunction dedupeConsecutivePoints(points: Point2[]): Point2[] {\n if (points.length === 0) {\n return [];\n }\n\n const deduped: Point2[] = [];\n for (const point of points) {\n if (deduped.length === 0 || !pointAlmostEqual(point, deduped[deduped.length - 1], 1e-7)) {\n deduped.push(point);\n }\n }\n\n if (deduped.length > 1 && pointAlmostEqual(deduped[0], deduped[deduped.length - 1], 1e-7)) {\n deduped.pop();\n }\n return deduped;\n}\n\nfunction uniquePoints(points: Point2[], epsilon = 1e-6): Point2[] {\n const unique: Point2[] = [];\n for (const point of points) {\n if (!unique.some((existing) => pointAlmostEqual(existing, point, epsilon))) {\n unique.push(point);\n }\n }\n return unique;\n}\n\nfunction polygonAreaSigned(points: Point2[]): number {\n let sum = 0;\n for (let i = 0; i < points.length; i += 1) {\n const a = points[i];\n const b = points[(i + 1) % points.length];\n sum += a[0] * b[1] - b[0] * a[1];\n }\n return sum * 0.5;\n}\n\nfunction polygonArea(points: Point2[]): number {\n return Math.abs(polygonAreaSigned(points));\n}\n\nfunction isValidPolygon(points: Point2[]): boolean {\n return points.length >= 3 && polygonArea(points) >= MIN_POLYGON_AREA;\n}\n\nfunction sortPointsAroundCentroid(points: Point2[]): Point2[] {\n const centroid: Point2 = [\n points.reduce((sum, point) => sum + point[0], 0) / points.length,\n points.reduce((sum, point) => sum + point[1], 0) / points.length,\n ];\n\n return [...points].sort((a, b) => {\n const angleA = Math.atan2(a[1] - centroid[1], a[0] - centroid[0]);\n const angleB = Math.atan2(b[1] - centroid[1], b[0] - centroid[0]);\n return angleA - angleB;\n });\n}\n\nfunction cross(o: Point2, a: Point2, b: Point2): number {\n return (a[0] - o[0]) * (b[1] - o[1]) - (a[1] - o[1]) * (b[0] - o[0]);\n}\n\nfunction convexHull(points: Point2[]): Point2[] {\n const unique = uniquePoints(points, 1e-6);\n if (unique.length <= 1) {\n return unique;\n }\n\n unique.sort((a, b) => (a[0] - b[0]) || (a[1] - b[1]));\n\n const lower: Point2[] = [];\n for (const point of unique) {\n while (lower.length >= 2 && cross(lower[lower.length - 2], lower[lower.length - 1], point) <= EPSILON) {\n lower.pop();\n }\n lower.push(point);\n }\n\n const upper: Point2[] = [];\n for (let i = unique.length - 1; i >= 0; i -= 1) {\n const point = unique[i];\n while (upper.length >= 2 && cross(upper[upper.length - 2], upper[upper.length - 1], point) <= EPSILON) {\n upper.pop();\n }\n upper.push(point);\n }\n\n lower.pop();\n upper.pop();\n return [...lower, ...upper];\n}\n\nfunction signedDistanceToLine(point: Point2, lineA: Point2, lineB: Point2): number {\n const vx = lineB[0] - lineA[0];\n const vy = lineB[1] - lineA[1];\n const px = point[0] - lineA[0];\n const py = point[1] - lineA[1];\n return vx * py - vy * px;\n}\n\nfunction reflectPointAcrossLine(point: Point2, lineA: Point2, lineB: Point2): Point2 {\n const dx = lineB[0] - lineA[0];\n const dy = lineB[1] - lineA[1];\n const lengthSq = dx * dx + dy * dy;\n if (lengthSq <= 1e-12) {\n return point;\n }\n\n const px = point[0] - lineA[0];\n const py = point[1] - lineA[1];\n const t = (px * dx + py * dy) / lengthSq;\n const projX = lineA[0] + dx * t;\n const projY = lineA[1] + dy * t;\n return [2 * projX - point[0], 2 * projY - point[1]];\n}\n\nfunction boundsFromPoints(points: Point2[]): Bounds {\n if (points.length === 0) {\n return { minX: 0, minY: 0, maxX: 1, maxY: 1 };\n }\n\n let minX = points[0][0];\n let minY = points[0][1];\n let maxX = points[0][0];\n let maxY = points[0][1];\n for (const [x, y] of points) {\n if (x < minX) minX = x;\n if (x > maxX) maxX = x;\n if (y < minY) minY = y;\n if (y > maxY) maxY = y;\n }\n return { minX, minY, maxX, maxY };\n}\n\nfunction boundsFromLayers(layers: Layer[]): Bounds {\n const points: Point2[] = [];\n for (const layer of layers) {\n points.push(...layer.points);\n }\n return boundsFromPoints(points);\n}\n\nfunction asSquareLikeGraph(value: unknown): OrigamiGraph | null {\n if (!value || typeof value !== \"object\") {\n return null;\n }\n const graph = value as OrigamiGraph;\n const hasVertices = Array.isArray(graph.vertices_coords) && graph.vertices_coords.length >= 4;\n return hasVertices ? graph : null;\n}\n\nfunction tryConstructGraph(factory: (() => OrigamiGraph) | undefined): OrigamiGraph | null {\n if (typeof factory !== \"function\") {\n return null;\n }\n try {\n return asSquareLikeGraph(factory());\n } catch {\n return null;\n }\n}\n\nfunction squareFromRabbitEar(): Point2[] {\n const fallback: Point2[] = [\n [0, 0],\n [1, 0],\n [1, 1],\n [0, 1],\n ];\n\n let graph: OrigamiGraph | null = null;\n for (const candidate of rabbitEarRoots()) {\n graph = graph ??\n tryConstructGraph(candidate.origami) ??\n tryConstructGraph(candidate.cp) ??\n tryConstructGraph(candidate.graph?.square);\n if (graph) {\n break;\n }\n }\n\n const vertices = graph && Array.isArray(graph.vertices_coords)\n ? uniquePoints(graph.vertices_coords)\n : [];\n if (vertices.length < 4) {\n return fallback;\n }\n\n const ordered = sortPointsAroundCentroid(vertices.slice(0, 4));\n return isValidPolygon(ordered) ? ordered : fallback;\n}\n\nfunction splitPolygonByLine(points: Point2[], lineA: Point2, lineB: Point2): SplitResult {\n const positiveRaw: Point2[] = [];\n const negativeRaw: Point2[] = [];\n const intersectionsRaw: Point2[] = [];\n\n for (let i = 0; i < points.length; i += 1) {\n const current = points[i];\n const next = points[(i + 1) % points.length];\n const dCurrent = signedDistanceToLine(current, lineA, lineB);\n const dNext = signedDistanceToLine(next, lineA, lineB);\n\n if (dCurrent >= -EPSILON) {\n positiveRaw.push(current);\n }\n if (dCurrent <= EPSILON) {\n negativeRaw.push(current);\n }\n if (Math.abs(dCurrent) <= EPSILON) {\n intersectionsRaw.push(current);\n }\n\n const crosses = (dCurrent > EPSILON && dNext < -EPSILON) ||\n (dCurrent < -EPSILON && dNext > EPSILON);\n if (crosses) {\n const t = dCurrent / (dCurrent - dNext);\n const intersection: Point2 = [\n current[0] + (next[0] - current[0]) * t,\n current[1] + (next[1] - current[1]) * t,\n ];\n positiveRaw.push(intersection);\n negativeRaw.push(intersection);\n intersectionsRaw.push(intersection);\n }\n }\n\n const positive = dedupeConsecutivePoints(positiveRaw);\n const negative = dedupeConsecutivePoints(negativeRaw);\n return {\n positive: isValidPolygon(positive) ? positive : null,\n negative: isValidPolygon(negative) ? negative : null,\n intersections: uniquePoints(intersectionsRaw, 1e-6),\n };\n}\n\nfunction randomFoldLine(bounds: Bounds, random: () => number): FoldLine {\n const width = Math.max(bounds.maxX - bounds.minX, 0.2);\n const height = Math.max(bounds.maxY - bounds.minY, 0.2);\n const span = Math.max(width, height);\n\n const centerX = (bounds.minX + bounds.maxX) * 0.5;\n const centerY = (bounds.minY + bounds.maxY) * 0.5;\n const angle = random() * Math.PI * 2;\n const dirX = Math.cos(angle);\n const dirY = Math.sin(angle);\n const normalX = -dirY;\n const normalY = dirX;\n const offset = (random() - 0.5) * span * 0.9;\n const anchorX = centerX + normalX * offset;\n const anchorY = centerY + normalY * offset;\n const halfLength = span * 2.2 + 1;\n\n return {\n a: [anchorX - dirX * halfLength, anchorY - dirY * halfLength],\n b: [anchorX + dirX * halfLength, anchorY + dirY * halfLength],\n };\n}\n\nfunction creaseFromIntersections(intersections: Point2[], line: FoldLine): FoldLine | null {\n const points = uniquePoints(intersections, 1e-6);\n if (points.length < 2) {\n return null;\n }\n\n const dx = line.b[0] - line.a[0];\n const dy = line.b[1] - line.a[1];\n const length = Math.hypot(dx, dy);\n if (length <= EPSILON) {\n return null;\n }\n const ux = dx / length;\n const uy = dy / length;\n\n let minPoint = points[0];\n let maxPoint = points[0];\n let minT = (points[0][0] - line.a[0]) * ux + (points[0][1] - line.a[1]) * uy;\n let maxT = minT;\n\n for (let i = 1; i < points.length; i += 1) {\n const point = points[i];\n const t = (point[0] - line.a[0]) * ux + (point[1] - line.a[1]) * uy;\n if (t < minT) {\n minT = t;\n minPoint = point;\n }\n if (t > maxT) {\n maxT = t;\n maxPoint = point;\n }\n }\n\n if (pointAlmostEqual(minPoint, maxPoint, 1e-6)) {\n return null;\n }\n return { a: minPoint, b: maxPoint };\n}\n\nfunction applyFold(layers: Layer[], line: FoldLine, random: () => number): FoldResult | null {\n const splits = layers.map((layer) => ({\n layer,\n split: splitPolygonByLine(layer.points, line.a, line.b),\n }));\n\n let totalPositiveArea = 0;\n let totalNegativeArea = 0;\n const allIntersections: Point2[] = [];\n\n for (const entry of splits) {\n if (entry.split.positive) {\n totalPositiveArea += polygonArea(entry.split.positive);\n }\n if (entry.split.negative) {\n totalNegativeArea += polygonArea(entry.split.negative);\n }\n allIntersections.push(...entry.split.intersections);\n }\n\n if (totalPositiveArea < MIN_POLYGON_AREA || totalNegativeArea < MIN_POLYGON_AREA) {\n return null;\n }\n\n const distinctIntersections = uniquePoints(allIntersections, 1e-6);\n if (distinctIntersections.length < 2) {\n return null;\n }\n\n let foldPositive = totalPositiveArea <= totalNegativeArea;\n if (random() < 0.15) {\n foldPositive = !foldPositive;\n }\n\n const nextLayers: Layer[] = [];\n for (const entry of splits) {\n const keep = foldPositive ? entry.split.negative : entry.split.positive;\n const fold = foldPositive ? entry.split.positive : entry.split.negative;\n\n if (keep && isValidPolygon(keep)) {\n nextLayers.push({\n points: keep,\n isFront: entry.layer.isFront,\n hasBeenFolded: entry.layer.hasBeenFolded,\n });\n }\n\n if (fold && isValidPolygon(fold)) {\n const reflected = dedupeConsecutivePoints(\n fold.map((point) => reflectPointAcrossLine(point, line.a, line.b)),\n );\n if (isValidPolygon(reflected)) {\n nextLayers.push({\n points: reflected,\n isFront: !entry.layer.isFront,\n hasBeenFolded: true,\n });\n }\n }\n }\n\n if (nextLayers.length === 0 || nextLayers.length > MAX_LAYER_COUNT) {\n return null;\n }\n\n return {\n layers: nextLayers,\n crease: creaseFromIntersections(distinctIntersections, line),\n };\n}\n\nfunction buildTwoFoldModel(seed: number): { layers: Layer[]; creases: FoldLine[] } {\n const random = mulberry32(seed ^ 0x5f1c2b79);\n let layers: Layer[] = [{\n points: squareFromRabbitEar(),\n isFront: true,\n hasBeenFolded: false,\n }];\n const creases: FoldLine[] = [];\n\n for (let foldStep = 0; foldStep < FOLD_COUNT; foldStep += 1) {\n let applied = false;\n for (let attempt = 0; attempt < MAX_ATTEMPTS_PER_FOLD; attempt += 1) {\n const line = randomFoldLine(boundsFromLayers(layers), random);\n const result = applyFold(layers, line, random);\n if (!result) {\n continue;\n }\n\n layers = result.layers;\n if (result.crease) {\n creases.push(result.crease);\n }\n applied = true;\n break;\n }\n if (!applied) {\n break;\n }\n }\n\n return { layers, creases };\n}\n\nfunction collectSilhouetteEdges(layers: Layer[]): FoldLine[] {\n const points: Point2[] = [];\n for (const layer of layers) {\n points.push(...layer.points);\n }\n\n const hull = convexHull(points);\n if (hull.length < 2) {\n return [];\n }\n\n const edges: FoldLine[] = [];\n for (let i = 0; i < hull.length; i += 1) {\n const a = hull[i];\n const b = hull[(i + 1) % hull.length];\n if (!pointAlmostEqual(a, b, 1e-7)) {\n edges.push({ a, b });\n }\n }\n return edges;\n}\n\nfunction edgePointKey(point: Point2): string {\n const x = Math.round(point[0] * 1e5) / 1e5;\n const y = Math.round(point[1] * 1e5) / 1e5;\n return `${x.toFixed(5)},${y.toFixed(5)}`;\n}\n\nfunction edgeKey(a: Point2, b: Point2): string {\n const keyA = edgePointKey(a);\n const keyB = edgePointKey(b);\n return keyA < keyB ? `${keyA}|${keyB}` : `${keyB}|${keyA}`;\n}\n\nfunction collectFoldedLayerEdges(layers: Layer[]): FoldLine[] {\n const edgeMap = new Map();\n for (const layer of layers) {\n if (!layer.hasBeenFolded) {\n continue;\n }\n\n const points = layer.points;\n for (let i = 0; i < points.length; i += 1) {\n const a = points[i];\n const b = points[(i + 1) % points.length];\n if (pointAlmostEqual(a, b, 1e-7)) {\n continue;\n }\n\n const key = edgeKey(a, b);\n if (!edgeMap.has(key)) {\n edgeMap.set(key, { a, b });\n }\n }\n }\n return Array.from(edgeMap.values());\n}\n\nfunction renderSquareSvg(seed: number): string {\n const colors = colorPair(seed);\n const rabbitSvg = renderWithRabbitEar(seed, colors);\n if (rabbitSvg) {\n return rabbitSvg;\n }\n\n const model = buildTwoFoldModel(seed);\n\n const boundsInput: Point2[] = [];\n for (const layer of model.layers) {\n boundsInput.push(...layer.points);\n }\n for (const crease of model.creases) {\n boundsInput.push(crease.a, crease.b);\n }\n\n const bounds = boundsFromPoints(boundsInput);\n const width = bounds.maxX - bounds.minX;\n const height = bounds.maxY - bounds.minY;\n const span = Math.max(width, height, 1);\n const padding = span * 0.12;\n\n const viewMinX = bounds.minX - padding;\n const viewMinY = bounds.minY - padding;\n const viewWidth = width + padding * 2;\n const viewHeight = height + padding * 2;\n\n const edgeWidth = Math.max(0.004, span * 0.007);\n const creaseWidth = edgeWidth * 0.72;\n const polygons = model.layers.map((layer) => {\n const fill = layer.isFront ? colors.front : colors.back;\n return ``;\n }).join(\"\");\n\n const rawCreases = model.creases\n .slice(0, FOLD_COUNT)\n .map((crease) => lineSvg(crease.a, crease.b, creaseWidth))\n .join(\"\");\n\n const allPoints: Point2[] = [];\n for (const layer of model.layers) {\n allPoints.push(...layer.points);\n }\n const hull = convexHull(allPoints);\n const clipId = `paper-clip-${seed}`;\n const creaseLayer = hull.length >= 3\n ? `${rawCreases}`\n : `${rawCreases}`;\n\n return ``;\n}\n\nfunction artifactFor(\n seed: number,\n generatedBy: GeneratedBy,\n id: string,\n now: Date,\n): OrigamiArtifact {\n return {\n id,\n createdAt: now.toISOString(),\n svg: renderSquareSvg(seed),\n seed,\n generatedBy,\n };\n}\n\nexport async function getOrCreateLatestOrigami(now = new Date()): Promise {\n const latest = await getLatestOrigami();\n const hourSeed = getHourSeed(now);\n const hourId = buildId(hourSeed, now, false);\n\n if (latest && latest.id === hourId) {\n return latest;\n }\n\n return generateAndStoreLatestOrigami({\n generatedBy: \"bootstrap\",\n now,\n });\n}\n\nexport async function generateAndStoreLatestOrigami(\n options: GenerateOptions,\n): Promise {\n const now = options.now ?? new Date();\n const force = options.force === true;\n const hourSeed = getHourSeed(now);\n const hourId = buildId(hourSeed, now, false);\n const latest = await getLatestOrigami();\n\n if (!force && latest && latest.id === hourId) {\n return latest;\n }\n\n const seed = force ? ((hourSeed ^ now.getTime()) >>> 0) : hourSeed;\n const artifact = artifactFor(\n seed,\n options.generatedBy,\n buildId(hourSeed, now, force),\n now,\n );\n await setLatestOrigami(artifact);\n return artifact;\n}\n","deleted","label",[174,156],"backend","permalink","https://www.val.town/x/ashryanio/origami/code/backend/origami.ts","extension","actionData","errors"]