[{"_1":2,"_182":-5,"_183":-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","436c7f7c8801ac8e84ab78aba420b373f6264c65","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,"_156":157,"_179":180,"_181":-5},"handle","clintr","name","npb-draft","path","backend/draft.ts","project",{"_103":104,"_97":98,"_105":106,"_107":-5,"_108":20,"_109":110,"_111":-5,"_112":-5,"_12":113,"_114":-5,"_115":20,"_116":-5,"_117":-5,"_118":33,"_14":119,"_120":121,"_122":123,"_124":-5,"_125":126,"_127":126,"_128":129,"_130":129,"_131":129,"_132":126,"_133":126,"_23":134,"_137":138,"_142":143,"_155":20},"id","4c935dd8-1bc7-11f1-aaf0-42dde27851f2","createdAt",["D",1773067822232],"deletedAt","legacyEnvVars","privacy","public","description","imageUrl","019ca01c-a52c-7496-b132-461e941e09a1","pinnedFileId","pinPreview","pinMigrated","screenshotVersion","likeCount","019ca01c-a52c-7496-b132-485cb9878fcf","tursoName","4c935dd81bc711f1aaf042dde27851f2","tursoHostname","4c935dd81bc711f1aaf042dde27851f2-val-town.aws-us-east-2.turso.io","pinned","userPerm","r","valPerm","blobPerm","rw","emailPerm","sqlitePerm","projectPerm","telemetryPerm",{"_95":96,"_135":136},"profileImageUrl","https://img.clerk.com/eyJ0eXBlIjoiZGVmYXVsdCIsImlpZCI6Imluc18yTm10cGhQUklwU0tqZHNiOHNnNGd2ZjJURFUiLCJyaWQiOiJ1c2VyXzNBR0owU1VPWkdOd0ZST1RYWGpUR3gyUUZuRSJ9","org",{"_95":96,"_139":136,"_12":113,"_140":141},"avatar","tier","free","branch",{"_144":145,"_97":45,"_103":146,"_147":104,"_148":-5,"_149":-5,"_150":-5,"_151":-5,"_152":-5,"_153":98,"_154":96},"version",68,"4c93c020-1bc7-11f1-aaf0-42dde27851f2","projectId","forkedBranchId","forkedBranchVersion","forkedProjectPrivacy","forkedProjectId","forkedProjectOrgId","projectName","userHandle","isOwned","file",{"_103":158,"_97":159,"_160":161,"_162":163,"_164":146,"_165":166,"_167":168,"_105":169,"_144":170,"_171":172,"_173":174,"_175":20,"_176":-5,"_99":177},"20a5dba0-1bd7-11f1-9b4a-42dde27851f2","draft.ts","fileId","9daa628e-1bc7-11f1-86bd-42dde27851f2","parentId","7427c5a0-1bc7-11f1-8bec-42dde27851f2","branchId","branchVersion",59,"latest",true,["D",1773074620476],3,"fileType","script","content","// NPB Draft Algorithm — seeded deterministic execution\n// 2026-03-09\n//\n// Each round:\n// 1. Every unassigned manager nominates their top-ranked AVAILABLE player\n// 2. Uncontested nominations are awarded immediately\n// 3. Contested nominations (2+ managers want same player) resolved by seeded RNG\n// 4. Winners locked in; losers advance to next round\n// Continues until all managers have a player.\n//\n// Managers who didn't rank enough players fall through to ADP order (1-30).\n//\n// Fixes from adversarial review:\n// - hashSeed uses FNV-1a (better avalanche than djb2) for PRNG seeding\n// - Manager count validated: exactly 12 required, with a flag to override\n\nimport { type Player, PLAYERS } from \"../players.ts\";\n\n// --- Seeded PRNG (Mulberry32) ---\n// Deterministic 32-bit PRNG. Same seed always produces same sequence.\n\nfunction mulberry32(seed: number): () => number {\n return function () {\n seed |= 0;\n seed = (seed + 0x6d2b79f5) | 0;\n let t = Math.imul(seed ^ (seed >>> 15), 1 | seed);\n t = (t + Math.imul(t ^ (t >>> 7), 61 | t)) ^ t;\n return ((t ^ (t >>> 14)) >>> 0) / 4294967296;\n };\n}\n\n// FNV-1a hash — better bit avalanche than djb2 for short strings.\n// Two seeds that differ by a single character produce very different hash values,\n// which is important for PRNG seeding fairness.\nfunction fnv1aHash(s: string): number {\n let hash = 0x811c9dc5; // FNV offset basis\n for (let i = 0; i < s.length; i++) {\n hash ^= s.charCodeAt(i);\n hash = Math.imul(hash, 0x01000193); // FNV prime\n }\n return hash >>> 0; // unsigned 32-bit\n}\n\n// --- Types ---\n\nexport interface ManagerInput {\n managerId: number;\n email: string;\n teamName: string;\n rankings: number[]; // player ADPs in user-ranked order\n}\n\nexport interface SkippedPlayer {\n adp: number;\n name: string;\n takenInRound: number;\n takenBy: string; // team name of who got them\n}\n\nexport interface RoundNomination {\n managerId: number;\n teamName: string;\n nominatedAdp: number;\n playerName: string;\n // Players this manager had ranked higher but were already taken.\n // Empty in round 1 (nothing taken yet). Tells the narrative:\n // \"Originally wanted Judge (taken R1), then Ohtani (taken R1), now nominates Witt\"\n skippedPlayers: SkippedPlayer[];\n}\n\nexport interface ConflictResolution {\n playerAdp: number;\n playerName: string;\n contestants: Array<{ managerId: number; teamName: string }>;\n winnerId: number;\n winnerTeamName: string;\n}\n\nexport interface RoundResult {\n roundNumber: number;\n nominations: RoundNomination[];\n uncontested: Array<{\n managerId: number;\n teamName: string;\n playerAdp: number;\n playerName: string;\n }>;\n conflicts: ConflictResolution[];\n winners: Array<{\n managerId: number;\n teamName: string;\n playerAdp: number;\n playerName: string;\n }>;\n}\n\nexport interface DraftSlot {\n slot: number;\n managerId: number;\n teamName: string;\n email: string;\n playerAdp: number;\n playerName: string;\n playerTeam: string;\n playerPosition: string;\n}\n\nexport interface DraftResult {\n seed: string;\n managerCount: number;\n rounds: RoundResult[];\n finalSlots: DraftSlot[];\n}\n\n// --- Core Algorithm ---\n\nexport function executeDraft(\n managers: ManagerInput[],\n seed: string,\n): DraftResult {\n if (managers.length === 0) {\n throw new Error(\"No managers to draft\");\n }\n if (managers.length > 12) {\n throw new Error(\n `Too many managers (${managers.length}). The NPB draft is designed for exactly 12 managers.`,\n );\n }\n\n const rng = mulberry32(fnv1aHash(seed));\n const playerMap = new Map(PLAYERS.map((p) => [p.adp, p]));\n\n // Build effective rankings: user's ranked players, then all unranked players in ADP order.\n // This guarantees every manager always has a nomination available.\n const effectiveRankings = new Map();\n for (const mgr of managers) {\n const ranked = [...mgr.rankings];\n const rankedSet = new Set(ranked);\n for (const p of PLAYERS) {\n if (!rankedSet.has(p.adp)) ranked.push(p.adp);\n }\n effectiveRankings.set(mgr.managerId, ranked);\n }\n\n const takenPlayers = new Set();\n const assignedManagers = new Map(); // managerId -> playerAdp\n // Track which round each player was taken in and by whom, for the \"skipped\" narrative\n const takenInRound = new Map();\n const rounds: RoundResult[] = [];\n\n let roundNumber = 0;\n while (assignedManagers.size < managers.length) {\n roundNumber++;\n if (roundNumber > 30) {\n throw new Error(\n `Draft did not converge after 30 rounds — bug in algorithm`,\n );\n }\n\n const unassigned = managers.filter((m) =>\n !assignedManagers.has(m.managerId)\n );\n const nominations: RoundNomination[] = [];\n\n for (const mgr of unassigned) {\n const rankings = effectiveRankings.get(mgr.managerId)!;\n\n // Collect skipped players: ones ranked higher than the nomination but already taken\n const skippedPlayers: SkippedPlayer[] = [];\n let nominatedAdp: number | undefined;\n for (const adp of rankings) {\n if (!takenPlayers.has(adp)) {\n nominatedAdp = adp;\n break;\n }\n // This player was taken — record as skipped (only if manager actually ranked them,\n // not the ADP-fallback tail)\n const taken = takenInRound.get(adp);\n if (taken && mgr.rankings.includes(adp)) {\n skippedPlayers.push({\n adp,\n name: playerMap.get(adp)!.name,\n takenInRound: taken.round,\n takenBy: taken.teamName,\n });\n }\n }\n\n if (nominatedAdp === undefined) {\n throw new Error(\n `Manager ${mgr.teamName} has no available players — should be impossible`,\n );\n }\n const player = playerMap.get(nominatedAdp)!;\n nominations.push({\n managerId: mgr.managerId,\n teamName: mgr.teamName,\n nominatedAdp,\n playerName: player.name,\n skippedPlayers,\n });\n }\n\n // Group nominations by player\n const byPlayer = new Map();\n for (const nom of nominations) {\n if (!byPlayer.has(nom.nominatedAdp)) byPlayer.set(nom.nominatedAdp, []);\n byPlayer.get(nom.nominatedAdp)!.push(nom);\n }\n\n const round: RoundResult = {\n roundNumber,\n nominations,\n uncontested: [],\n conflicts: [],\n winners: [],\n };\n\n // Process each nominated player. Sort by ADP for deterministic order.\n // NOTE: The ADP sort order determines which RNG values are consumed by which\n // conflict. This is deterministic and reproducible — same seed, same outcome —\n // but it means the ordering matters. Documented here for transparency.\n const sortedPlayerAdps = [...byPlayer.keys()].sort((a, b) => a - b);\n\n for (const playerAdp of sortedPlayerAdps) {\n const noms = byPlayer.get(playerAdp)!;\n const player = playerMap.get(playerAdp)!;\n\n if (noms.length === 1) {\n // Uncontested\n const winner = noms[0];\n round.uncontested.push({\n managerId: winner.managerId,\n teamName: winner.teamName,\n playerAdp,\n playerName: player.name,\n });\n round.winners.push({\n managerId: winner.managerId,\n teamName: winner.teamName,\n playerAdp,\n playerName: player.name,\n });\n takenPlayers.add(playerAdp);\n takenInRound.set(playerAdp, {\n round: roundNumber,\n teamName: winner.teamName,\n });\n assignedManagers.set(winner.managerId, playerAdp);\n } else {\n // Conflict — seeded RNG lottery\n const winnerIdx = Math.floor(rng() * noms.length);\n const winner = noms[winnerIdx];\n round.conflicts.push({\n playerAdp,\n playerName: player.name,\n contestants: noms.map((n) => ({\n managerId: n.managerId,\n teamName: n.teamName,\n })),\n winnerId: winner.managerId,\n winnerTeamName: winner.teamName,\n });\n round.winners.push({\n managerId: winner.managerId,\n teamName: winner.teamName,\n playerAdp,\n playerName: player.name,\n });\n takenPlayers.add(playerAdp);\n takenInRound.set(playerAdp, {\n round: roundNumber,\n teamName: winner.teamName,\n });\n assignedManagers.set(winner.managerId, playerAdp);\n }\n }\n\n rounds.push(round);\n }\n\n const finalSlots = calculateDraftSlots(managers, assignedManagers, playerMap);\n return { seed, managerCount: managers.length, rounds, finalSlots };\n}\n\n// --- Draft Slot Assignment ---\n// Players ADP 1-12: manager gets that exact draft slot.\n// Players ADP 13+: managers sorted by ADP (ascending) and assigned to remaining\n// open slots (ascending). This is the rule from the league commissioner.\n\nfunction calculateDraftSlots(\n managers: ManagerInput[],\n assignedManagers: Map,\n playerMap: Map,\n): DraftSlot[] {\n const managerMap = new Map(managers.map((m) => [m.managerId, m]));\n const slots: DraftSlot[] = [];\n const outsideTop12: Array<{\n managerId: number;\n teamName: string;\n email: string;\n playerAdp: number;\n player: Player;\n }> = [];\n\n const totalManagers = managers.length;\n\n for (const [managerId, playerAdp] of assignedManagers) {\n const mgr = managerMap.get(managerId)!;\n const player = playerMap.get(playerAdp)!;\n\n if (playerAdp <= totalManagers) {\n // Player's ADP is within the manager count — gets that exact slot\n slots.push({\n slot: playerAdp,\n managerId,\n teamName: mgr.teamName,\n email: mgr.email,\n playerAdp,\n playerName: player.name,\n playerTeam: player.team,\n playerPosition: player.position,\n });\n } else {\n outsideTop12.push({\n managerId,\n teamName: mgr.teamName,\n email: mgr.email,\n playerAdp,\n player,\n });\n }\n }\n\n // Sort outside-top-N by ADP ascending (lower ADP = better remaining slot)\n outsideTop12.sort((a, b) => a.playerAdp - b.playerAdp);\n\n // Find remaining slots among 1-N\n const usedSlots = new Set(slots.map((s) => s.slot));\n const remainingSlots: number[] = [];\n for (let i = 1; i <= totalManagers; i++) {\n if (!usedSlots.has(i)) remainingSlots.push(i);\n }\n remainingSlots.sort((a, b) => a - b);\n\n for (let i = 0; i < outsideTop12.length; i++) {\n const m = outsideTop12[i];\n slots.push({\n slot: remainingSlots[i],\n managerId: m.managerId,\n teamName: m.teamName,\n email: m.email,\n playerAdp: m.playerAdp,\n playerName: m.player.name,\n playerTeam: m.player.team,\n playerPosition: m.player.position,\n });\n }\n\n slots.sort((a, b) => a.slot - b.slot);\n return slots;\n}","deleted","label",[178,159],"backend","permalink","https://www.val.town/x/clintr/npb-draft/code/backend/draft.ts","extension","actionData","errors"]