@ghostlytools/cli 1.8.1 → 1.10.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +34 -23
- package/SKILL.md +9 -4
- package/dist/assets/{api-BpQC8dAw.js → api-BF_KwecF.js} +115 -45
- package/dist/assets/api-BF_KwecF.js.map +1 -0
- package/dist/assets/{api-CttDF-S5.js → api-DdrA86Ur.js} +2 -2
- package/dist/assets/{apiKit-CSMeHKgo.js → apiKit-Du1u2l4x.js} +8 -8
- package/dist/assets/apiKit-Du1u2l4x.js.map +1 -0
- package/dist/assets/{apps-DzFMdVt6.js → apps-Bti9fDoW.js} +1 -1
- package/dist/assets/{apps-DqTyZ40T.js → apps-DwPfp54I.js} +5 -3
- package/dist/assets/apps-DwPfp54I.js.map +1 -0
- package/dist/assets/{arkade-Cu3TbPxC.js → arkade-DOWpA2Kr.js} +2 -2
- package/dist/assets/{arkade-Cu3TbPxC.js.map → arkade-DOWpA2Kr.js.map} +1 -1
- package/dist/assets/{backup-CLZOORFC.js → backup-CeRckyl2.js} +1 -1
- package/dist/assets/{backup-CyTZhu28.js → backup-DZ_Q1eSu.js} +6 -6
- package/dist/assets/{backup-CyTZhu28.js.map → backup-DZ_Q1eSu.js.map} +1 -1
- package/dist/assets/{blobFiles-DOQDRdDI.js → blobFiles-BnjN_Vrz.js} +3 -3
- package/dist/assets/{blobFiles-DOQDRdDI.js.map → blobFiles-BnjN_Vrz.js.map} +1 -1
- package/dist/assets/buttons-BxIThdg9.js +332 -0
- package/dist/assets/buttons-BxIThdg9.js.map +1 -0
- package/dist/assets/buttons-D9QBHS9Y.js +2 -0
- package/dist/assets/client-D5E1RQYB.js +473 -0
- package/dist/assets/client-D5E1RQYB.js.map +1 -0
- package/dist/assets/{endpoint-BdaeBw2L.js → endpoint-DWHkXWVM.js} +101 -16
- package/dist/assets/endpoint-DWHkXWVM.js.map +1 -0
- package/dist/assets/{envelope-CGfUsR1m.js → envelope-CugS9qwQ.js} +2 -2
- package/dist/assets/{envelope-CGfUsR1m.js.map → envelope-CugS9qwQ.js.map} +1 -1
- package/dist/assets/{fileBytes-BPDKufla.js → fileBytes-DMzrIdCu.js} +1 -1
- package/dist/assets/{fileBytes-DNgrRL0R.js → fileBytes-DjBYYyXT.js} +3 -3
- package/dist/assets/{fileBytes-DNgrRL0R.js.map → fileBytes-DjBYYyXT.js.map} +1 -1
- package/dist/assets/{fileBytes-Q3ehcEr8.js → fileBytes-Douk1yOp.js} +2 -2
- package/dist/assets/{fileBytes-Q3ehcEr8.js.map → fileBytes-Douk1yOp.js.map} +1 -1
- package/dist/assets/fileBytesIdb-CD5Uv490.js +2 -0
- package/dist/assets/{fileBytesIdb-Dm1EyEbT.js → fileBytesIdb-CkClu9YI.js} +3 -3
- package/dist/assets/{fileBytesIdb-Dm1EyEbT.js.map → fileBytesIdb-CkClu9YI.js.map} +1 -1
- package/dist/assets/{fileBytesOpfs-ZGD21c4Q.js → fileBytesOpfs-WryQuOgK.js} +3 -3
- package/dist/assets/{fileBytesOpfs-ZGD21c4Q.js.map → fileBytesOpfs-WryQuOgK.js.map} +1 -1
- package/dist/assets/{fixedHosts-BiukTsd9.js → fixedHosts-B4E4VrYE.js} +4 -4
- package/dist/assets/{fixedHosts-BiukTsd9.js.map → fixedHosts-B4E4VrYE.js.map} +1 -1
- package/dist/assets/{groupFiles-CeF9nPv9.js → groupFiles-NonOYBKN.js} +380 -650
- package/dist/assets/groupFiles-NonOYBKN.js.map +1 -0
- package/dist/assets/{host-CKAehWP6.js → host-DvcVt5YI.js} +144 -33
- package/dist/assets/host-DvcVt5YI.js.map +1 -0
- package/dist/assets/{hyperdhtRelay-B8Pdykhg.js → hyperdhtRelay-Ce42sR8x.js} +2 -2
- package/dist/assets/{hyperdhtRelay-B8Pdykhg.js.map → hyperdhtRelay-Ce42sR8x.js.map} +1 -1
- package/dist/assets/{idb-BkOJES5_.js → idb-BHsAqENE.js} +37 -6
- package/dist/assets/idb-BHsAqENE.js.map +1 -0
- package/dist/assets/{irohWeb-D6tAPHZa.js → irohWeb-C9ChbD-c.js} +71 -4
- package/dist/assets/{irohWeb-D6tAPHZa.js.map → irohWeb-C9ChbD-c.js.map} +1 -1
- package/dist/assets/{main-BDY-pfpz.js → main-4qE381KM.js} +226 -280
- package/dist/assets/main-4qE381KM.js.map +1 -0
- package/dist/assets/{mainline-3ueXpFQL.js → mainline-DOwZDHVy.js} +2 -2
- package/dist/assets/{mainline-3ueXpFQL.js.map → mainline-DOwZDHVy.js.map} +1 -1
- package/dist/assets/{networkReason-DhJYOomu.js → networkReason-MInk1Y63.js} +3 -3
- package/dist/assets/{networkReason-DhJYOomu.js.map → networkReason-MInk1Y63.js.map} +1 -1
- package/dist/assets/{nwc-B1Quqda-.js → nwc-CHLWFV1R.js} +3 -3
- package/dist/assets/{nwc-B1Quqda-.js.map → nwc-CHLWFV1R.js.map} +1 -1
- package/dist/assets/{nwcProvider-DUB6xO-b.js → nwcProvider-BlkPOJen.js} +2 -2
- package/dist/assets/{nwcProvider-DUB6xO-b.js.map → nwcProvider-BlkPOJen.js.map} +1 -1
- package/dist/assets/{ownDid-BfqHJdA6.js → ownDid-yXtY_1B5.js} +3 -3
- package/dist/assets/ownDid-yXtY_1B5.js.map +1 -0
- package/dist/assets/{profiles-MFtCmJwK.js → profiles-vbXHs0Mq.js} +40 -3
- package/dist/assets/profiles-vbXHs0Mq.js.map +1 -0
- package/dist/assets/{registry-CZTmtSws.js → registry-BN9r2pR4.js} +1 -1
- package/dist/assets/{registry-DwlTNQjr.js → registry-chCD0KWS.js} +5 -5
- package/dist/assets/registry-chCD0KWS.js.map +1 -0
- package/dist/assets/{resolve-BVwhiYjj.js → resolve-Dtzogt2W.js} +2 -2
- package/dist/assets/{resolve-BVwhiYjj.js.map → resolve-Dtzogt2W.js.map} +1 -1
- package/dist/assets/{restoredRows-BCRCjhdF.js → restoredRows-CRYwIx3g.js} +2 -2
- package/dist/assets/{restoredRows-BCRCjhdF.js.map → restoredRows-CRYwIx3g.js.map} +1 -1
- package/dist/assets/secretGuard-CSVNxXVW.js +1081 -0
- package/dist/assets/secretGuard-CSVNxXVW.js.map +1 -0
- package/dist/assets/secretGuard-Q2BKq0q0.js +2 -0
- package/dist/assets/{server-Br3XPwFG.js → server-BZnsm5X5.js} +2510 -569
- package/dist/assets/server-BZnsm5X5.js.map +1 -0
- package/dist/assets/{src-C4sOH4zH.js → src-DZagapGt.js} +2015 -161
- package/dist/assets/src-DZagapGt.js.map +1 -0
- package/dist/assets/{sshForges-CQQomStK.js → sshForges-BkTgy5rx.js} +16 -9
- package/dist/assets/{sshForges-CQQomStK.js.map → sshForges-BkTgy5rx.js.map} +1 -1
- package/dist/assets/{translate-C2aNyUkR.js → translate-B9SMd6uf.js} +15 -8
- package/dist/assets/translate-B9SMd6uf.js.map +1 -0
- package/dist/assets/{usdt-CMwatDnQ.js → usdt-BU4ezonh.js} +3 -3
- package/dist/assets/{usdt-CMwatDnQ.js.map → usdt-BU4ezonh.js.map} +1 -1
- package/dist/assets/{waitNotice-Ck3el3_Z.js → waitNotice-B8D8WhbE.js} +2 -2
- package/dist/assets/waitNotice-B8D8WhbE.js.map +1 -0
- package/dist/assets/{words-CqN2KG1r.js → words-jYy7lTcb.js} +5 -2
- package/dist/assets/words-jYy7lTcb.js.map +1 -0
- package/dist/ghostly.mjs +1 -1
- package/examples/call-echo.mjs +7 -5
- package/package.json +1 -1
- package/dist/assets/api-BpQC8dAw.js.map +0 -1
- package/dist/assets/apiKit-CSMeHKgo.js.map +0 -1
- package/dist/assets/apps-DqTyZ40T.js.map +0 -1
- package/dist/assets/buttons-Bd9fR31r.js +0 -698
- package/dist/assets/buttons-Bd9fR31r.js.map +0 -1
- package/dist/assets/buttons-c4CJnL6i.js +0 -2
- package/dist/assets/daemonProof-DtrL5lE5.js +0 -236
- package/dist/assets/daemonProof-DtrL5lE5.js.map +0 -1
- package/dist/assets/endpoint-BdaeBw2L.js.map +0 -1
- package/dist/assets/fileBytesIdb-DZcESfTt.js +0 -2
- package/dist/assets/groupFiles-CeF9nPv9.js.map +0 -1
- package/dist/assets/host-CKAehWP6.js.map +0 -1
- package/dist/assets/idb-BkOJES5_.js.map +0 -1
- package/dist/assets/main-BDY-pfpz.js.map +0 -1
- package/dist/assets/ownDid-BfqHJdA6.js.map +0 -1
- package/dist/assets/profiles-MFtCmJwK.js.map +0 -1
- package/dist/assets/registry-DwlTNQjr.js.map +0 -1
- package/dist/assets/server-Br3XPwFG.js.map +0 -1
- package/dist/assets/src-C4sOH4zH.js.map +0 -1
- package/dist/assets/translate-C2aNyUkR.js.map +0 -1
- package/dist/assets/waitNotice-Ck3el3_Z.js.map +0 -1
- package/dist/assets/words-CqN2KG1r.js.map +0 -1
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"buttons-Bd9fR31r.js","names":["goesOnIn"],"sources":["../../../../apps/ui/src/lib/parse/monero-words.ts","../../../../apps/ui/src/lib/parse/secrets.ts","../../src/waits.ts","../../src/buttons.ts"],"sourcesContent":["/**\n * Monero's English seed words (src/mnemonics/english.h in monero-project/monero), in their order: a word's place is its\n * value. The classic 25-word seed of Monero GUI and monero-wallet-cli, and MyMonero's 13, are made of these.\n *\n * Copyright (c) 2014-2024, The Monero Project, under the BSD 3-Clause licence that file carries: redistributions keep\n * this notice, and the project's name may not endorse this app.\n */\nexport const MONERO_WORDS = `\nabbey abducts ability ablaze abnormal abort abrasive absorb abyss academy aces aching acidic acoustic acquire across\nactress acumen adapt addicted adept adhesive adjust adopt adrenalin adult adventure aerial afar affair afield afloat\nafoot afraid after against agenda aggravate agile aglow agnostic agony agreed ahead aided ailments aimless airport\naisle ajar akin alarms album alchemy alerts algebra alkaline alley almost aloof alpine already also altitude alumni\nalways amaze ambush amended amidst ammo amnesty among amply amused anchor android anecdote angled ankle annoyed\nanswers antics anvil anxiety anybody apart apex aphid aplomb apology apply apricot aptitude aquarium arbitrary\narcher ardent arena argue arises army around arrow arsenic artistic ascend ashtray aside asked asleep aspire\nassorted asylum athlete atlas atom atrium attire auburn auctions audio august aunt austere autumn avatar avidly\navoid awakened awesome awful awkward awning awoken axes axis axle aztec azure baby bacon badge baffles bagpipe\nbailed bakery balding bamboo banjo baptism basin batch bawled bays because beer befit begun behind being below\nbemused benches berries bested betting bevel beware beyond bias bicycle bids bifocals biggest bikini bimonthly\nbinocular biology biplane birth biscuit bite biweekly blender blip bluntly boat bobsled bodies bogeys boil boldly\nbomb border boss both bounced bovine bowling boxes boyfriend broken brunt bubble buckets budget buffet bugs building\nbulb bumper bunch business butter buying buzzer bygones byline bypass cabin cactus cadets cafe cage cajun cake\ncalamity camp candy casket catch cause cavernous cease cedar ceiling cell cement cent certain chlorine chrome cider\ncigar cinema circle cistern citadel civilian claim click clue coal cobra cocoa code coexist coffee cogs cohesive\ncoils colony comb cool copy corrode costume cottage cousin cowl criminal cube cucumber cuddled cuffs cuisine cunning\ncupcake custom cycling cylinder cynical dabbing dads daft dagger daily damp dangerous dapper darted dash dating\ndauntless dawn daytime dazed debut decay dedicated deepest deftly degrees dehydrate deity dejected delayed\ndemonstrate dented deodorant depth desk devoid dewdrop dexterity dialect dice diet different digit dilute dime\ndinner diode diplomat directed distance ditch divers dizzy doctor dodge does dogs doing dolphin domestic donuts\ndoorway dormant dosage dotted double dove down dozen dreams drinks drowning drunk drying dual dubbed duckling dude\nduets duke dullness dummy dunes duplex duration dusted duties dwarf dwelt dwindling dying dynamite dyslexic each\neagle earth easy eating eavesdrop eccentric echo eclipse economics ecstatic eden edgy edited educated eels efficient\neggs egotistic eight either eject elapse elbow eldest eleven elite elope else eluded emails ember emerge emit\nemotion empty emulate energy enforce enhanced enigma enjoy enlist enmity enough enraged ensign entrance envy epoxy\nequip erase erected erosion error eskimos espionage essential estate etched eternal ethics etiquette evaluate\nevenings evicted evolved examine excess exhale exit exotic exquisite extra exult fabrics factual fading fainted\nfaked fall family fancy farming fatal faulty fawns faxed fazed feast february federal feel feline females fences\nferry festival fetches fever fewest fiat fibula fictional fidget fierce fifteen fight films firm fishing fitting\nfive fixate fizzle fleet flippant flying foamy focus foes foggy foiled folding fonts foolish fossil fountain fowls\nfoxes foyer framed friendly frown fruit frying fudge fuel fugitive fully fuming fungal furnished fuselage future\nfuzzy gables gadget gags gained galaxy gambit gang gasp gather gauze gave gawk gaze gearbox gecko geek gels gemstone\ngeneral geometry germs gesture getting geyser ghetto ghost giant giddy gifts gigantic gills gimmick ginger girth\ngiving glass gleeful glide gnaw gnome goat goblet godfather goes goggles going goldfish gone goodbye gopher gorilla\ngossip gotten gourmet governing gown greater grunt guarded guest guide gulp gumball guru gusts gutter guys gymnast\ngypsy gyrate habitat hacksaw haggled hairy hamburger happens hashing hatchet haunted having hawk haystack hazard\nhectare hedgehog heels hefty height hemlock hence heron hesitate hexagon hickory hiding highway hijack hiker hills\nhimself hinder hippo hire history hitched hive hoax hobby hockey hoisting hold honked hookup hope hornet hospital\nhotel hounded hover howls hubcaps huddle huge hull humid hunter hurried husband huts hybrid hydrogen hyper iceberg\nicing icon identity idiom idled idols igloo ignore iguana illness imagine imbalance imitate impel inactive inbound\nincur industrial inexact inflamed ingested initiate injury inkling inline inmate innocent inorganic input inquest\ninroads insult intended inundate invoke inwardly ionic irate iris irony irritate island isolated issued italics\nitches items itinerary itself ivory jabbed jackets jaded jagged jailed jamming january jargon jaunt javelin jaws\njazz jeans jeers jellyfish jeopardy jerseys jester jetting jewels jigsaw jingle jittery jive jobs jockey jogger\njoining joking jolted jostle journal joyous jubilee judge juggled juicy jukebox july jump junk jury justice juvenile\nkangaroo karate keep kennel kept kernels kettle keyboard kickoff kidneys king kiosk kisses kitchens kiwi knapsack\nknee knife knowledge knuckle koala laboratory ladder lagoon lair lakes lamb language laptop large last later\nlaunching lava lawsuit layout lazy lectures ledge leech left legion leisure lemon lending leopard lesson lettuce\nlexicon liar library licks lids lied lifestyle light likewise lilac limits linen lion lipstick liquid listen lively\nloaded lobster locker lodge lofty logic loincloth long looking lopped lordship losing lottery loudly love lower\nloyal lucky luggage lukewarm lullaby lumber lunar lurk lush luxury lymph lynx lyrics macro madness magically mailed\nmajor makeup malady mammal maps masterful match maul maverick maximum mayor maze meant mechanic medicate meeting\nmegabyte melting memoir menu merger mesh metro mews mice midst mighty mime mirror misery mittens mixture moat mobile\nmocked mohawk moisture molten moment money moon mops morsel mostly motherly mouth movement mowing much muddy muffin\nmugged mullet mumble mundane muppet mural musical muzzle myriad mystery myth nabbing nagged nail names nanny napkin\nnarrate nasty natural nautical navy nearby necklace needed negative neither neon nephew nerves nestle network\nneutral never newt nexus nibs niche niece nifty nightly nimbly nineteen nirvana nitrogen nobody nocturnal nodes\nnoises nomad noodles northern nostril noted nouns novelty nowhere nozzle nuance nucleus nudged nugget nuisance null\nnumber nuns nurse nutshell nylon oaks oars oasis oatmeal obedient object obliged obnoxious observant obtains obvious\noccur ocean october odds odometer offend often oilfield ointment okay older olive olympics omega omission omnibus\nonboard oncoming oneself ongoing onion online onslaught onto onward oozed opacity opened opposite optical opus\norange orbit orchid orders organs origin ornament orphans oscar ostrich otherwise otter ouch ought ounce ourselves\noust outbreak oval oven owed owls owner oxidant oxygen oyster ozone pact paddles pager pairing palace pamphlet\npancakes paper paradise pastry patio pause pavements pawnshop payment peaches pebbles peculiar pedantic peeled pegs\npelican pencil people pepper perfect pests petals phase pheasants phone phrases physics piano picked pierce pigment\npiloted pimple pinched pioneer pipeline pirate pistons pitched pivot pixels pizza playful pledge pliers plotting\nplus plywood poaching pockets podcast poetry point poker polar ponies pool popular portents possible potato pouch\npoverty powder pram present pride problems pruned prying psychic public puck puddle puffin pulp pumpkins punch puppy\npurged push putty puzzled pylons pyramid python queen quick quote rabbits racetrack radar rafts rage railway raking\nrally ramped randomly rapid rarest rash rated ravine rays razor react rebel recipe reduce reef refer regular reheat\nreinvest rejoices rekindle relic remedy renting reorder repent request reruns rest return reunion revamp rewind\nrhino rhythm ribbon richly ridges rift rigid rims ringing riots ripped rising ritual river roared robot rockets\nrodent rogue roles romance roomy roped roster rotate rounded rover rowboat royal ruby rudely ruffled rugged ruined\nruling rumble runway rural rustled ruthless sabotage sack sadness safety saga sailor sake salads sample sanity\nsapling sarcasm sash satin saucepan saved sawmill saxophone sayings scamper scenic school science scoop scrub scuba\nseasons second sedan seeded segments seismic selfish semifinal sensible september sequence serving session setup\nseventh sewage shackles shelter shipped shocking shrugged shuffled shyness siblings sickness sidekick sieve sifting\nsighting silk simplest sincerely sipped siren situated sixteen sizes skater skew skirting skulls skydive slackens\nsleepless slid slower slug smash smelting smidgen smog smuggled snake sneeze sniff snout snug soapy sober soccer\nsoda software soggy soil solved somewhere sonic soothe soprano sorry southern sovereign sowed soya space speedy\nsphere spiders splendid spout sprig spud spying square stacking stellar stick stockpile strained stunning stylishly\nsubtly succeed suddenly suede suffice sugar suitcase sulking summon sunken superior surfer sushi suture swagger\nswept swiftly sword swung syllabus symptoms syndrome syringe system taboo tacit tadpoles tagged tail taken talent\ntamper tanks tapestry tarnished tasked tattoo taunts tavern tawny taxi teardrop technical tedious teeming tell\ntemplate tender tepid tequila terminal testing tether textbook thaw theatrics thirsty thorn threaten thumbs thwart\nticket tidy tiers tiger tilt timber tinted tipsy tirade tissue titans toaster tobacco today toenail toffee together\ntoilet token tolerant tomorrow tonic toolbox topic torch tossed total touchy towel toxic toyed trash trendy tribal\ntrolling truth trying tsunami tubes tucks tudor tuesday tufts tugs tuition tulips tumbling tunnel turnip tusks tutor\ntuxedo twang tweezers twice twofold tycoon typist tyrant ugly ulcers ultimate umbrella umpire unafraid unbending\nuncle under uneven unfit ungainly unhappy union unjustly unknown unlikely unmask unnoticed unopened unplugs unquoted\nunrest unsafe until unusual unveil unwind unzip upbeat upcoming update upgrade uphill upkeep upload upon upper\nupright upstairs uptight upwards urban urchins urgent usage useful usher using usual utensils utility utmost utopia\nuttered vacation vague vain value vampire vane vapidly vary vastness vats vaults vector veered vegan vehicle vein\nvelvet venomous verification vessel veteran vexed vials vibrate victim video viewpoint vigilant viking village\nvinegar violin vipers virtual visited vitals vivid vixen vocal vogue voice volcano vortex voted voucher vowels\nvoyage vulture wade waffle wagtail waist waking wallets wanted warped washing water waveform waxing wayside weavers\nwebsite wedge weekday weird welders went wept were western wetsuit whale when whipped whole wickets width wield wife\nwiggle wildly winter wipeout wiring wise withdrawn wives wizard wobbly woes woken wolf womanly wonders woozy worry\nwounded woven wrap wrist wrong yacht yahoo yanks yard yawning yearbook yellow yesterday yeti yields yodel yoga\nyounger yoyo zapped zeal zebra zero zesty zigzags zinger zippers zodiac zombie zones zoom\n`.trim().split(/\\s+/);\n","import { sha256 } from \"@noble/hashes/sha2.js\";\nimport { createBase58check } from \"@scure/base\";\nimport { wordlist } from \"@scure/bip39/wordlists/english.js\";\nimport { MONERO_WORDS } from \"./monero-words\";\n\n/**\n * What the composer asks about before a message goes: text that looks like a secret someone could take funds or an\n * identity with, or a Cashu token (bearer money: the text box would hand it to whoever reads the chat).\n *\n * Detection is local and synchronous, and a finding never carries the text it found: only what kind it is and, for\n * ecash, the amount decoded here. Ark, Spark and Fedimint wallets are BIP39 seeds or raw keys, caught by the rules\n * below; Fedimint ecash notes are plain base64 with no prefix, so they are not recognised.\n */\nexport type SecretFinding =\n | { kind: \"mnemonic\" | \"nsec\" | \"bitcoin-key\" | \"hex-key\" }\n | { kind: \"cashu\"; amount: number | null; unit: string };\n\nexport type SecretKind = SecretFinding[\"kind\"];\n\ninterface SeedWords {\n index: Map<string, number>;\n /** Seed lengths whose checksum is tried on any run of these words. */\n lengths: number[];\n /** A message that is nothing but this many of these words counts, checksum or not. */\n wholeMessage: number[];\n checksumHolds: (indices: number[]) => boolean;\n}\n\nconst MNEMONIC_LENGTHS = [12, 15, 18, 21, 24];\nconst BIP39: SeedWords = {\n index: new Map(wordlist.map((word, index) => [word, index])),\n lengths: MNEMONIC_LENGTHS,\n /**\n * BIP39's lengths, and a Polyseed's 16 (Monero's seed in Feather and Cake Wallet, BIP39's English words with a\n * checksum of its own, which BIP39's caught only by chance, about 3 in 10).\n */\n wholeMessage: [...MNEMONIC_LENGTHS, 16],\n checksumHolds: bip39ChecksumHolds,\n};\n/** Monero's classic seed (Monero GUI, monero-wallet-cli): 25 words of its own list, or MyMonero's 13. */\nconst MONERO: SeedWords = {\n index: new Map(MONERO_WORDS.map((word, index) => [word, index])),\n lengths: [25, 13],\n wholeMessage: [25, 13],\n checksumHolds: moneroChecksumHolds,\n};\n/** Checksums tried per message and word list at most: a 16 KiB run of seed words stays a few milliseconds. */\nconst CHECKSUM_BUDGET = 4096;\n\nconst NSEC = /\\bnsec1[02-9ac-hj-np-z]{58}(?![02-9ac-hj-np-z])/i;\nconst EXTENDED_PRIVATE = /\\b[xtyzuvYZUV]prv[1-9A-HJ-NP-Za-km-z]{100,}/;\nconst WIF = /\\b[59KLc][1-9A-HJ-NP-Za-km-z]{50,51}\\b/g;\nconst HEX_SECRET = /\\b(?:0x)?(?:[0-9a-fA-F]{128}|[0-9a-fA-F]{64})\\b/g;\n/**\n * Monero's keys count too: \"Private spend key\" and \"Spend key (private)\" (Cake Wallet, MyMonero). A bare \"spend key\" or\n * \"view key\" does not, as a wallet's public keys are written that way too.\n */\nconst SECRET_CONTEXT = /priv(?:ate)?[\\s_-]*(?:(?:spend|view)[\\s_-]*)?key|(?:spend|view)[\\s_-]*key[\\s_-]*\\(\\s*private|secret|seed|mnemonic|nsec|xprv|\\bwif\\b|recovery|passphrase/i;\n/** How far from a 64-hex string a word like \"seed\" still counts as saying what it is. */\nconst CONTEXT_REACH = 48;\nconst CASHU_TOKEN = /\\bcashu([AB])([A-Za-z0-9_\\-+/]{20,}={0,2})/g;\n\n/**\n * Characters that take no room on screen: format characters (zero-width space, soft hyphen, word joiner, the joiners,\n * direction marks), control characters that are not white space, variation selectors, the grapheme joiner and the\n * Hangul fillers. A page, a PDF or a terminal puts some of them into long strings as places to break a line.\n */\nconst INVISIBLE = /(?![\\t\\n\\v\\f\\r\\x85])[\\p{Cc}\\p{Cf}]|\\u034f|[\\u115f\\u1160\\u3164\\uffa0]|[\\ufe00-\\ufe0f]|[\\u{e0100}-\\u{e01ef}]/gu;\n\nconst base58check = createBase58check(sha256);\n\n/**\n * The first secret in `text`, keys and seeds before ecash; null for anything else. The text is read as it is and as\n * it reads without its invisible characters: a key with one inside is whole again once the reader takes it out.\n */\nexport function findSecret(text: string): SecretFinding | null {\n const visible = text.replace(INVISIBLE, \"\");\n const readings = visible === text ? [text] : [text, visible];\n if (readings.some((reading) => hasMnemonic(reading, BIP39) || hasMnemonic(reading, MONERO))) return { kind: \"mnemonic\" };\n if (readings.some((reading) => NSEC.test(reading))) return { kind: \"nsec\" };\n if (readings.some((reading) => EXTENDED_PRIVATE.test(reading) || hasWif(reading))) return { kind: \"bitcoin-key\" };\n if (readings.some(hasHexSecret)) return { kind: \"hex-key\" };\n const tokens = readings.map(findCashu);\n return tokens.find((found) => found?.kind === \"cashu\" && found.amount !== null) ?? tokens.find((found) => found) ?? null;\n}\n\n/**\n * 12 to 24 words in a row from the English BIP39 list whose checksum holds, anywhere in the text; or a message that\n * is nothing but 12, 15, 16, 18, 21 or 24 of those words (a seed with one word mistyped is still most of a seed). The\n * same for Monero's English list, 25 or 13 words. Prose breaks a run at once: \"the\", \"a\", \"is\", \"to\", \"and\", \"of\" and\n * \"I\" are on neither list.\n *\n * One word said over and over is not a seed, though one in 16 such runs passes a 12-word checksum (\"word\" does), and\n * every one passes Monero's: a window of a single word never counts, and a window mostly of one word (\"abandon …\n * about\") counts only when that word does not go on past it on either side.\n */\nfunction hasMnemonic(text: string, seed: SeedWords): boolean {\n const tokens = text.toLowerCase().match(/[a-z]+/g);\n const shortest = Math.min(...seed.lengths);\n if (!tokens || tokens.length < shortest) return false;\n let budget = CHECKSUM_BUDGET;\n let run: number[] = [];\n const seedLike = (start: number, length: number) => {\n const window = run.slice(start, start + length);\n const counts = new Map<number, number>();\n for (const word of window) counts.set(word, (counts.get(word) ?? 0) + 1);\n if (counts.size === 1) return false;\n const [most, times] = [...counts].reduce((a, b) => (b[1] > a[1] ? b : a));\n if (times > length / 2 && (run[start - 1] === most || run[start + length] === most)) return false;\n return seed.checksumHolds(window);\n };\n const check = () => {\n if (run.length >= shortest) {\n for (const length of seed.lengths) {\n for (let start = 0; start + length <= run.length && budget > 0; start++, budget--) {\n if (seedLike(start, length)) return true;\n }\n }\n if (run.length === tokens.length && seed.wholeMessage.includes(run.length) && new Set(run).size > 1) return true;\n }\n run = [];\n return false;\n };\n for (const token of tokens) {\n const index = seed.index.get(token);\n if (index !== undefined) run.push(index);\n else if (check()) return true;\n }\n return check();\n}\n\n/** BIP39: the words' 11-bit indices are the entropy followed by the first bits of its SHA-256. */\nfunction bip39ChecksumHolds(indices: number[]): boolean {\n const bits = indices.length * 11, checksumBits = bits / 33, entropyBytes = (bits - checksumBits) / 8;\n const bytes = new Uint8Array(Math.ceil(bits / 8));\n indices.forEach((index, i) => {\n for (let b = 0; b < 11; b++) if (index & (1 << (10 - b))) { const at = i * 11 + b; bytes[at >> 3] |= 0x80 >> (at & 7); }\n });\n const expected = sha256(bytes.subarray(0, entropyBytes))[0] >> (8 - checksumBits);\n const got = bytes[entropyBytes] >> (8 - checksumBits);\n return expected === got;\n}\n\n/**\n * Monero (src/mnemonics/electrum-words.cpp): the last word repeats the one at CRC-32 of the other words' first three\n * letters, run together, modulo how many they are.\n */\nfunction moneroChecksumHolds(indices: number[]): boolean {\n const words = indices.slice(0, -1);\n const prefixes = words.map((index) => MONERO_WORDS[index].slice(0, 3)).join(\"\");\n return words[crc32(prefixes) % words.length] === indices[indices.length - 1];\n}\n\nconst CRC32_TABLE = Uint32Array.from({ length: 256 }, (_, n) => {\n let c = n;\n for (let k = 0; k < 8; k++) c = c & 1 ? 0xedb88320 ^ (c >>> 1) : c >>> 1;\n return c;\n});\n\n/** CRC-32 (the zlib one) of ASCII text. */\nfunction crc32(text: string): number {\n let crc = 0xffffffff;\n for (let i = 0; i < text.length; i++) crc = CRC32_TABLE[(crc ^ text.charCodeAt(i)) & 0xff] ^ (crc >>> 8);\n return (crc ^ 0xffffffff) >>> 0;\n}\n\n/** A WIF private key: base58check with version 0x80 (mainnet) or 0xef (testnet), 32 bytes and an optional 0x01. */\nfunction hasWif(text: string): boolean {\n for (const [candidate] of text.matchAll(WIF)) {\n try {\n const payload = base58check.decode(candidate);\n if ((payload[0] === 0x80 || payload[0] === 0xef) && (payload.length === 33 || (payload.length === 34 && payload[33] === 1))) return true;\n } catch { /* not base58check: an ordinary word */ }\n }\n return false;\n}\n\n/** 64 or 128 hex digits with \"private key\", \"secret\", \"seed\" or the like close by. A bare hash is not asked about. */\nfunction hasHexSecret(text: string): boolean {\n for (const match of text.matchAll(HEX_SECRET)) {\n const before = text.slice(Math.max(0, match.index - CONTEXT_REACH), match.index);\n const after = text.slice(match.index + match[0].length, match.index + match[0].length + CONTEXT_REACH);\n if (SECRET_CONTEXT.test(before) || SECRET_CONTEXT.test(after)) return true;\n }\n return false;\n}\n\n/** Every Cashu token in the text, with their amounts added up when all of them decode and share one unit. */\nfunction findCashu(text: string): SecretFinding | null {\n const tokens = [...text.matchAll(CASHU_TOKEN)].map(([, version, body]) => decodeCashu(version as \"A\" | \"B\", body));\n if (!tokens.length) return null;\n const unit = tokens.find((token) => token)?.unit ?? \"sat\";\n const readable = tokens.every((token) => token && token.unit === unit);\n return { kind: \"cashu\", amount: readable ? tokens.reduce((sum, token) => sum + token!.amount, 0) : null, unit };\n}\n\n/** What a Cashu token is worth, read from the token itself (NUT-00): nothing is asked of the mint. */\nexport function decodeCashu(version: \"A\" | \"B\", body: string): { amount: number; unit: string } | null {\n try {\n const bytes = fromBase64(body);\n if (version === \"A\") {\n const token = JSON.parse(new TextDecoder(\"utf-8\", { fatal: true }).decode(bytes)) as { token?: { proofs?: { amount?: unknown }[] }[]; unit?: unknown };\n return total(token.token?.flatMap((entry) => entry.proofs ?? []).map((proof) => proof.amount), token.unit);\n }\n const token = decodeCbor(bytes) as { t?: { p?: { a?: unknown }[] }[]; u?: unknown } | null;\n return total(token?.t?.flatMap((entry) => entry.p ?? []).map((proof) => proof.a), token?.u);\n } catch {\n return null;\n }\n}\n\nfunction total(amounts: unknown[] | undefined, unit: unknown): { amount: number; unit: string } | null {\n if (!amounts?.length || !amounts.every((a): a is number => Number.isSafeInteger(a) && (a as number) >= 0)) return null;\n const amount = amounts.reduce((sum, a) => sum + a, 0);\n return Number.isSafeInteger(amount) ? { amount, unit: typeof unit === \"string\" && unit ? unit : \"sat\" } : null;\n}\n\nfunction fromBase64(text: string): Uint8Array {\n const standard = text.replace(/-/g, \"+\").replace(/_/g, \"/\").replace(/=+$/, \"\");\n const binary = atob(standard + \"=\".repeat((4 - (standard.length % 4)) % 4));\n return Uint8Array.from(binary, (c) => c.charCodeAt(0));\n}\n\n/** Enough CBOR (RFC 8949) for a cashuB token: definite lengths, integers, bytes, text, arrays, maps, tags, simple values. */\nfunction decodeCbor(bytes: Uint8Array): unknown {\n let at = 0, depth = 0;\n const view = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength);\n const length = (info: number): number => {\n if (info < 24) return info;\n const size = info === 24 ? 1 : info === 25 ? 2 : info === 26 ? 4 : info === 27 ? 8 : 0;\n if (!size || at + size > bytes.length) throw new Error(\"cbor\");\n let value = 0;\n for (let i = 0; i < size; i++) value = value * 256 + bytes[at + i];\n at += size;\n return value;\n };\n const item = (): unknown => {\n if (at >= bytes.length || ++depth > 32) throw new Error(\"cbor\");\n const head = bytes[at++], major = head >> 5, info = head & 31;\n try {\n if (major === 7) {\n if (info === 20) return false;\n if (info === 21) return true;\n if (info === 22 || info === 23) return null;\n if (info === 25) { at += 2; return NaN; } // a half float: never in a token\n if (info === 26) { at += 4; return view.getFloat32(at - 4); }\n if (info === 27) { at += 8; return view.getFloat64(at - 8); }\n throw new Error(\"cbor\");\n }\n const n = length(info);\n switch (major) {\n case 0: return n;\n case 1: return -1 - n;\n case 2: case 3: {\n if (at + n > bytes.length) throw new Error(\"cbor\");\n const slice = bytes.subarray(at, (at += n));\n return major === 2 ? slice : new TextDecoder(\"utf-8\", { fatal: true }).decode(slice);\n }\n case 4: {\n if (n > bytes.length - at) throw new Error(\"cbor\");\n return Array.from({ length: n }, item);\n }\n case 5: {\n if (n > bytes.length - at) throw new Error(\"cbor\");\n const map: Record<string, unknown> = Object.create(null);\n for (let i = 0; i < n; i++) { const key = item(); map[String(key)] = item(); }\n return map;\n }\n default: return item(); // a tag: the value it tags\n }\n } finally { depth--; }\n };\n return item();\n}\n","import type { StoredMessage } from \"@ghostly/browser/shared/types\";\nimport { node, type ApiContext } from \"./apiKit\";\nimport { CliError } from \"./errors\";\nimport type { GhostlyEvent } from \"./events\";\nimport { goesOn as goesOnIn } from \"./waitNotice\";\n\n/*\n * Waiting on what a command sent (WISP 1100): a message's delivery, an edit's confirmation, a group frame taken by an\n * edge. Shared by the chat, group and status card methods.\n */\n\nconst DELIVERY_RANK: Record<string, number> = { sending: 0, waiting: 1, queued: 1, held: 2, sent: 2, delivered: 3 };\n\n/**\n * What a timed-out wait says of what happens next: a daemon goes on, a one-shot's profile closes now. A one-shot's\n * `edit` and `group edit` said \"while this profile is online\" too, as it was about to leave. Ctrl-C says the same.\n */\nconst goesOn = (ctx: ApiContext) => goesOnIn(ctx.mode);\n\n/** Waits until the contact confirmed the latest edit of one of my messages (it is no longer pending). */\nexport async function waitForEdit(ctx: ApiContext, chat: string, messageId: string, ms: number): Promise<StoredMessage> {\n const until = Date.now() + ms;\n for (;;) {\n const message = await node(ctx).getMessage(chat, messageId);\n if (!message) throw new CliError(\"not_found\", `No message ${messageId} in this chat`);\n if (!message.edit?.pending) return message;\n if (Date.now() >= until) throw new CliError(\"timeout\", `Timed out after ${Math.round(ms / 1000)} s: the contact has not confirmed the edit yet (it needs a live chat and a contact's app that shows edits). It ${goesOn(ctx)}`, { messageId, edits: message.edit.seq });\n await new Promise((resolve) => setTimeout(resolve, 250));\n }\n}\n\n/** Waits until the contact confirmed my removal of a message, which is already gone here. */\nexport async function waitForRemoval(ctx: ApiContext, chat: string, messageId: string, ms: number): Promise<void> {\n const until = Date.now() + ms;\n while (node(ctx).removalPending({ linkId: chat, messageId })) {\n if (Date.now() >= until) throw new CliError(\"timeout\", `Timed out after ${Math.round(ms / 1000)} s: the message is gone here and the contact has not confirmed yet. Its removal ${goesOn(ctx)}`, { messageId });\n await new Promise((resolve) => setTimeout(resolve, 250));\n }\n}\n\n/**\n * Waits until an edge took my group message, or its edit number `edit` (WISP 902: a group has no receipts, so this is\n * as far as the author sees): a member's edge in a private group, an edge to one of my hubs in a community.\n */\nexport async function waitForGroupFrame(ctx: ApiContext, groupId: string, messageId: string, edit: number | undefined, ms: number): Promise<number> {\n const until = Date.now() + ms;\n for (;;) {\n const taken = node(ctx).groupTaken({ groupId, messageId, ...(edit ? { edit } : {}) });\n if (taken > 0) return taken;\n if (Date.now() >= until) throw new CliError(\"timeout\", `Timed out after ${Math.round(ms / 1000)} s: no member's edge took it yet (it stays in the group and goes when one opens). It ${goesOn(ctx)}`, { messageId, ...(edit ? { edits: edit } : {}) });\n await new Promise((resolve) => setTimeout(resolve, 250));\n }\n}\n\n/**\n * A one-shot whose text went over the live link waits this long for its receipt before it leaves (`waitForMessage`).\n * Left at `sent`, the engine stopping took the text for unconfirmed, the next start sent it again on the DHT, and that\n * copy took the chat's one DHT text awaiting a receipt: a script's next one-shot send waited 30 s behind it, every 5-8\n * messages, and the last text showed \"Connection closed before receipt\" though the contact had it (agents#1640).\n */\nexport const ONE_SHOT_RECEIPT_MS = 2_000;\n\n/**\n * Waits until the contact confirmed my reaction or pin in a 1:1 chat (WISP 401): until `pending` no longer finds it in\n * what the contact has not confirmed (`chatUnconfirmed`). It goes on the live session, a reaction also on the DHT\n * envelopes; one not confirmed in time is kept and said again.\n */\nexport async function waitForConfirmed(ctx: ApiContext, chat: string, what: \"reaction\" | \"pin\", pending: (left: { reactions: number[]; pin: number | null }) => boolean, ms: number): Promise<void> {\n const until = Date.now() + ms;\n while (pending(node(ctx).chatUnconfirmed({ linkId: chat }))) {\n if (Date.now() >= until) throw new CliError(\"timeout\", `Timed out after ${Math.round(ms / 1000)} s: the contact has not confirmed the ${what} yet. It is kept here and ${goesOn(ctx)}`, { chat });\n await new Promise((resolve) => setTimeout(resolve, 250));\n }\n}\n\n/**\n * Waits until a message of mine reached `target` (`sent`: on its way to the contact; `delivered`: acknowledged). A\n * one-shot's text sent over the live link waits a moment more for its receipt (`ONE_SHOT_RECEIPT_MS`).\n */\nexport async function waitForMessage(ctx: ApiContext, chat: string, messageId: string, target: \"sent\" | \"delivered\", ms: number): Promise<StoredMessage> {\n const reached = await waitForDelivery(ctx, chat, messageId, target, ms);\n if (ctx.mode !== \"one-shot\" || target !== \"sent\" || reached.delivery !== \"sent\" || reached.via !== \"datalink\") return reached;\n return waitForDelivery(ctx, chat, messageId, \"delivered\", ONE_SHOT_RECEIPT_MS).catch(async () => (await node(ctx).getMessage(chat, messageId)) ?? reached);\n}\n\nasync function waitForDelivery(ctx: ApiContext, chat: string, messageId: string, target: \"sent\" | \"delivered\", ms: number): Promise<StoredMessage> {\n const want = DELIVERY_RANK[target];\n const look = (message: StoredMessage | undefined) => {\n if (!message) return undefined;\n const delivery = message.delivery ?? \"sent\";\n if (delivery === \"failed\") throw new CliError(\"engine\", message.deliveryError ?? \"The message could not be sent\", { messageId, delivery });\n return (DELIVERY_RANK[delivery] ?? 0) >= want ? message : undefined;\n };\n return new Promise<StoredMessage>((resolve, reject) => {\n let settled = false;\n const finish = (error: unknown, message?: StoredMessage) => {\n if (settled) return;\n settled = true; clearTimeout(timer); off();\n if (error) reject(error); else resolve(message!);\n };\n const check = (last = false) => void node(ctx).getMessage(chat, messageId).then((message) => {\n try {\n const done = look(message);\n if (done) finish(null, done);\n else if (last) finish(new CliError(\"timeout\", `Timed out after ${Math.round(ms / 1000)} s: the message is ${message?.delivery ?? \"not sent yet\"} and ${goesOn(ctx)}`, { messageId, delivery: message?.delivery ?? null }));\n } catch (error) { finish(error); }\n }, finish);\n const timer = setTimeout(() => check(true), ms);\n // Any event naming the message: a message first seen already delivered comes as `message.sent`, never as\n // `message.delivery`. Listening before the first read leaves no gap for a change to slip through.\n const off = ctx.hub.onEvent((event: GhostlyEvent) => {\n if (event.chat === chat && (event.messageId === messageId || (event.message as { id?: string } | undefined)?.id === messageId)) check();\n });\n check();\n });\n}\n","import { BUTTONS_CAPABILITY, BUTTON_STYLES, STATUS_CARD_LIMITS, buttonLabelClash, checkStatusCard, randomBytes, toBase64Url, type ButtonsCard } from \"@ghostly/core\";\nimport type { LinkView, StoredMessage } from \"@ghostly/browser/shared/types\";\nimport type { Parsed } from \"./args\";\nimport { bool, chatOrGroup, messageOf, node, num, oneOf, str, type Method, type Params } from \"./apiKit\";\nimport { CliError } from \"./errors\";\nimport { findSecret } from \"../../../apps/ui/src/lib/parse/secrets\";\nimport { waitForEdit, waitForGroupFrame, waitForMessage } from \"./waits\";\n\n/*\n * Message buttons (WISP 406 · Message Buttons), the bot's side: a message whose text is the question, with up to six\n * buttons under it (`send --button yes:Yes`). A press comes back as a reply whose text is the button's label; the\n * engine marks it (`press`) and `listen` says `button.pressed`. `button update` then shows the answer (`chosen`) and\n * closes the buttons, by editing the message with the same buttons.\n */\n\n/**\n * `--button id:Label` (again for each, 1 to 6), `--style id=primary|neutral|danger`, `--once` and `--id`, as the\n * method's parameters: `buttons` and `buttonsId`. Nothing when no `--button` is given. The label may hold colons: the\n * id ends at the first one. An id given twice, two labels that read the same (ignoring case and spaces at the ends), a\n * label that is another button's id, or a style not listed are a usage error here, before the profile opens; other\n * bounds (ids, labels, how many) are the card's, checked when it is sent.\n */\nexport function buttonsOf(options: Parsed[\"options\"]): { buttons: Record<string, unknown>[]; buttonsId?: string } | undefined {\n const given = Array.isArray(options.button) ? options.button as string[] : [];\n if (!given.length) {\n for (const flag of [\"style\", \"once\", \"id\"] as const)\n if (options[flag] !== undefined) throw new CliError(\"usage\", `--${flag} goes with --button id:Label`);\n return undefined;\n }\n const buttons: Record<string, unknown>[] = given.map((value) => {\n const colon = value.indexOf(\":\");\n if (colon < 1 || colon === value.length - 1) throw new CliError(\"usage\", `--button takes id:Label, like yes:Yes, not ${JSON.stringify(value)}`);\n return { id: value.slice(0, colon), label: value.slice(colon + 1).trim() };\n });\n const twice = buttons.findIndex((button, at) => buttons.findIndex((other) => other.id === button.id) !== at);\n if (twice !== -1) throw new CliError(\"usage\", `--button ${JSON.stringify(given[twice])} repeats the id ${JSON.stringify(buttons[twice].id)}: each button takes its own`);\n // Two buttons a typed answer could not tell apart: the same label, or a label that is another's id (ignoring case).\n const clash = buttonLabelClash(buttons);\n if (clash) {\n const [at, other] = [JSON.stringify(given[clash.at]), JSON.stringify(given[clash.with])];\n throw new CliError(\"usage\", clash.kind === \"label\"\n ? `--button ${at} repeats the label of --button ${other} (ignoring case and spaces): a typed answer could not tell them apart`\n : `--button ${at} has a label that is the id of --button ${other}: a typed answer could not tell them apart`);\n }\n for (const value of Array.isArray(options.style) ? options.style as string[] : []) {\n const eq = value.indexOf(\"=\");\n const button = eq > 0 ? buttons.find((b) => b.id === value.slice(0, eq)) : undefined;\n if (!button) throw new CliError(\"usage\", `--style takes id=primary|neutral|danger for one of the buttons, not ${JSON.stringify(value)}`);\n const style = value.slice(eq + 1);\n if (!(BUTTON_STYLES as readonly string[]).includes(style)) throw new CliError(\"usage\", `--style ${JSON.stringify(value)}: a button's style is ${BUTTON_STYLES.join(\", \")}`);\n button.style = style;\n }\n if (options.once === true) for (const button of buttons) button.once = true;\n return { buttons, ...(options.id !== undefined && { buttonsId: String(options.id) }) };\n}\n\n/** A buttons card checked by the sender's rule, or a `bad_request` that says what is wrong. */\nfunction checked(card: Record<string, unknown>): ButtonsCard {\n const result = checkStatusCard(card);\n if (\"error\" in result) throw new CliError(\"bad_request\", `Buttons: ${result.error}`, { card });\n return result.card as ButtonsCard;\n}\n\n/**\n * The card a send's `buttons` (and `buttonsId`) make, or undefined when it names none. `buttons` is a list of\n * `{id, label, style?, once?}`; the id of the question is made up (`ask-…`) unless given.\n */\nexport function buttonsCard(params: Params): ButtonsCard | undefined {\n const buttons = params.buttons;\n if (buttons === undefined || buttons === null) {\n if (params.buttonsId !== undefined) throw new CliError(\"bad_request\", \"buttonsId goes with buttons\");\n return undefined;\n }\n if (!Array.isArray(buttons)) throw new CliError(\"bad_request\", \"buttons must be a list of {id, label, style?, once?}\");\n const id = str(params, \"buttonsId\") ?? `ask-${toBase64Url(randomBytes(6))}`;\n return checked({ kind: \"buttons\", id, buttons });\n}\n\n/** Whether a 1:1 contact's app shows and presses buttons: null until its app said what it offers. */\nexport function pressable(link: LinkView): boolean | null {\n const peer = link.sessionOffers?.peer;\n return peer ? peer.includes(BUTTONS_CAPABILITY) : null;\n}\n\n/** The message of mine with buttons that `button update` names, by its id here (or the id both sides know). */\nfunction buttonsMessage(message: StoredMessage | undefined, ref: string, group: boolean): StoredMessage & { card: ButtonsCard } {\n if (!message) throw new CliError(\"not_found\", `No message ${JSON.stringify(ref)} of yours in this ${group ? \"group\" : \"chat\"}: the messageId send gave`);\n if (message.card?.kind !== \"buttons\") throw new CliError(\"bad_request\", \"That message has no buttons: send one with send --button id:Label\");\n return message as StoredMessage & { card: ButtonsCard };\n}\n\n/**\n * `button update`: the answer shown on a question's buttons (`chosen`), the buttons closed (`close`), or a new text\n * (`text`), by editing the message with the same buttons. What is not given stays as it was.\n */\nasync function updateButtons(ctx: Parameters<Method>[0], params: Params): Promise<Record<string, unknown>> {\n const target = chatOrGroup(ctx, str(params, \"chat\", true));\n const ref = str(params, \"message\", true);\n const chosen = str(params, \"chosen\");\n const close = bool(params, \"close\");\n const newText = str(params, \"text\");\n if (chosen === undefined && !close && newText === undefined) throw new CliError(\"bad_request\", \"Nothing to update: give chosen, close or text\");\n // A new text is a message like any other: the same guard as `send` and `edit`.\n if (newText !== undefined && !bool(params, \"force\")) {\n const secret = findSecret(newText);\n if (secret) throw new CliError(\"confirm\", `The text looks like ${secret.kind === \"cashu\" ? \"a Cashu token (money anyone who reads it can take)\" : \"a secret (a seed or a private key)\"}; update with --force if you mean to`, { kind: secret.kind });\n }\n const message = buttonsMessage(await messageOf(ctx, target.linkId, ref, (m) => m.sender === \"me\"), ref, target.group);\n if ((message.edit?.seq ?? 0) >= STATUS_CARD_LIMITS.edits)\n throw new CliError(\"refused\", `This message took ${STATUS_CARD_LIMITS.edits} updates, the most one takes: ask again with a new send`, { messageId: message.id, edits: message.edit!.seq });\n const before = message.card;\n // Said here, with the buttons it has, as a press says it: the card's own check names only the field.\n if (chosen !== undefined && !before.buttons.some((b) => b.id === chosen))\n throw new CliError(\"bad_request\", `That message has no button ${JSON.stringify(chosen)}; its buttons: ${before.buttons.map((b) => b.id).join(\", \")}`, { card: before });\n const card = checked({ ...before, ...(chosen !== undefined && { chosen }), ...((close || before.closed) && { closed: true }) });\n const text = newText ?? message.text;\n const wait = oneOf(params, \"wait\", target.group ? [\"none\", \"sent\"] as const : [\"none\", \"confirmed\"] as const, \"none\");\n const ms = num(params, \"timeout\", 30, { min: 1, max: 3600 }) * 1000;\n const result = await node(ctx).editMessage({ linkId: target.linkId, messageId: message.id, text, card });\n if (result.error) throw new CliError(result.refused ? \"refused\" : \"unavailable\", result.error);\n let edited = await node(ctx).getMessage(target.linkId, message.id);\n if (wait === \"confirmed\" && edited?.edit?.pending) edited = await waitForEdit(ctx, target.linkId, message.id, ms);\n const edges = wait === \"sent\" && edited?.edit ? await waitForGroupFrame(ctx, target.id, message.id, edited.edit.seq, ms) : undefined;\n return {\n [target.group ? \"group\" : \"chat\"]: target.id, buttons: card.id, messageId: message.id, card, edits: edited?.edit?.seq ?? 0,\n ...(target.group ? { ...(edges !== undefined && { edges }) } : { confirmed: !!edited && !edited.edit?.pending }),\n };\n}\n\n/**\n * `button press`: the other side of a question, as the app's tap: a press on a button of someone else's message, by\n * its id here (or the id both sides know). The engine sends a reply whose text is the button's label, and refuses what\n * an app would: a button the message does not have, closed buttons, a second answer past `once`, a second press\n * within a second. A one-shot in a chat waits until the press went out, as `send` does.\n */\nasync function pressButton(ctx: Parameters<Method>[0], params: Params): Promise<Record<string, unknown>> {\n const target = chatOrGroup(ctx, str(params, \"chat\", true));\n const ref = str(params, \"message\", true);\n const buttonId = str(params, \"button\", true);\n const where = target.group ? \"group\" : \"chat\";\n const message = await messageOf(ctx, target.linkId, ref, (m) => m.sender !== \"me\");\n if (!message) throw new CliError(\"not_found\", `No message ${JSON.stringify(ref)} from someone else in this ${where}: the id its event or history gave`);\n if (message.card?.kind !== \"buttons\") throw new CliError(\"bad_request\", \"That message has no buttons\");\n const button = message.card.buttons.find((b) => b.id === buttonId);\n if (!button) throw new CliError(\"not_found\", `That message has no button ${JSON.stringify(buttonId)}; its buttons: ${message.card.buttons.map((b) => b.id).join(\", \")}`);\n const wait = target.group\n ? oneOf(params, \"wait\", [\"none\", \"sent\"] as const, \"none\")\n : oneOf(params, \"wait\", [\"none\", \"sent\", \"delivered\"] as const, ctx.mode === \"one-shot\" ? \"sent\" : \"none\");\n const ms = num(params, \"timeout\", 30, { min: 1, max: 3600 }) * 1000;\n const result = await node(ctx).pressButton({ linkId: target.linkId, messageId: message.id, buttonId });\n if (result.error) throw new CliError(result.refused ? \"refused\" : \"unavailable\", result.error, result.paced ? { paced: true } : undefined);\n const replyId = result.messageId ?? null;\n const answer = { [where]: target.id, messageId: message.id, button: button.id, label: button.label, replyId };\n if (!replyId) return answer;\n if (target.group) {\n const edges = wait === \"sent\" ? await waitForGroupFrame(ctx, target.id, replyId, undefined, ms) : node(ctx).groupTaken({ groupId: target.id, messageId: replyId });\n return { ...answer, edges };\n }\n const reply = wait === \"none\" ? await node(ctx).getMessage(target.linkId, replyId) : await waitForMessage(ctx, target.linkId, replyId, wait, ms);\n return { ...answer, delivery: reply?.delivery ?? null };\n}\n\nexport const BUTTON_METHODS: Record<string, Method> = {\n /** WISP 406 · Message Buttons: a press on a button of someone else's message, as the app's tap. */\n \"button.press\": pressButton,\n /** WISP 406 · Message Buttons: the answer chosen on a question of mine, its buttons closed, or its text changed. */\n \"button.update\": updateButtons,\n};\n"],"mappings":";;;;;;;;;;;;;;;AAOA,IAAa,eAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAsG1B,KAAK,CAAC,CAAC,MAAM,KAAK;;;ACjFpB,IAAM,mBAAmB;CAAC;CAAI;CAAI;CAAI;CAAI;AAAE;AAC5C,IAAM,QAAmB;CACvB,OAAO,IAAI,IAAI,SAAS,KAAK,MAAM,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC;CAC3D,SAAS;;;;;CAKT,cAAc,CAAC,GAAG,kBAAkB,EAAE;CACtC,eAAe;AACjB;;AAEA,IAAM,SAAoB;CACxB,OAAO,IAAI,IAAI,aAAa,KAAK,MAAM,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC;CAC/D,SAAS,CAAC,IAAI,EAAE;CAChB,cAAc,CAAC,IAAI,EAAE;CACrB,eAAe;AACjB;;AAEA,IAAM,kBAAkB;AAExB,IAAM,OAAO;AACb,IAAM,mBAAmB;AACzB,IAAM,MAAM;AACZ,IAAM,aAAa;;;;;AAKnB,IAAM,iBAAiB;;AAEvB,IAAM,gBAAgB;AACtB,IAAM,cAAc;;;;;;AAOpB,IAAM,YAAY;AAElB,IAAM,cAAc,kBAAkB,MAAM;;;;;AAM5C,SAAgB,WAAW,MAAoC;CAC7D,MAAM,UAAU,KAAK,QAAQ,WAAW,EAAE;CAC1C,MAAM,WAAW,YAAY,OAAO,CAAC,IAAI,IAAI,CAAC,MAAM,OAAO;CAC3D,IAAI,SAAS,MAAM,YAAY,YAAY,SAAS,KAAK,KAAK,YAAY,SAAS,MAAM,CAAC,GAAG,OAAO,EAAE,MAAM,WAAW;CACvH,IAAI,SAAS,MAAM,YAAY,KAAK,KAAK,OAAO,CAAC,GAAG,OAAO,EAAE,MAAM,OAAO;CAC1E,IAAI,SAAS,MAAM,YAAY,iBAAiB,KAAK,OAAO,KAAK,OAAO,OAAO,CAAC,GAAG,OAAO,EAAE,MAAM,cAAc;CAChH,IAAI,SAAS,KAAK,YAAY,GAAG,OAAO,EAAE,MAAM,UAAU;CAC1D,MAAM,SAAS,SAAS,IAAI,SAAS;CACrC,OAAO,OAAO,MAAM,UAAU,OAAO,SAAS,WAAW,MAAM,WAAW,IAAI,KAAK,OAAO,MAAM,UAAU,KAAK,KAAK;AACtH;;;;;;;;;;;AAYA,SAAS,YAAY,MAAc,MAA0B;CAC3D,MAAM,SAAS,KAAK,YAAY,CAAC,CAAC,MAAM,SAAS;CACjD,MAAM,WAAW,KAAK,IAAI,GAAG,KAAK,OAAO;CACzC,IAAI,CAAC,UAAU,OAAO,SAAS,UAAU,OAAO;CAChD,IAAI,SAAS;CACb,IAAI,MAAgB,CAAC;CACrB,MAAM,YAAY,OAAe,WAAmB;EAClD,MAAM,SAAS,IAAI,MAAM,OAAO,QAAQ,MAAM;EAC9C,MAAM,yBAAS,IAAI,IAAoB;EACvC,KAAK,MAAM,QAAQ,QAAQ,OAAO,IAAI,OAAO,OAAO,IAAI,IAAI,KAAK,KAAK,CAAC;EACvE,IAAI,OAAO,SAAS,GAAG,OAAO;EAC9B,MAAM,CAAC,MAAM,SAAS,CAAC,GAAG,MAAM,CAAC,CAAC,QAAQ,GAAG,MAAO,EAAE,KAAK,EAAE,KAAK,IAAI,CAAE;EACxE,IAAI,QAAQ,SAAS,MAAM,IAAI,QAAQ,OAAO,QAAQ,IAAI,QAAQ,YAAY,OAAO,OAAO;EAC5F,OAAO,KAAK,cAAc,MAAM;CAClC;CACA,MAAM,cAAc;EAClB,IAAI,IAAI,UAAU,UAAU;GAC1B,KAAK,MAAM,UAAU,KAAK,SACxB,KAAK,IAAI,QAAQ,GAAG,QAAQ,UAAU,IAAI,UAAU,SAAS,GAAG,SAAS,UACvE,IAAI,SAAS,OAAO,MAAM,GAAG,OAAO;GAGxC,IAAI,IAAI,WAAW,OAAO,UAAU,KAAK,aAAa,SAAS,IAAI,MAAM,KAAK,IAAI,IAAI,GAAG,CAAC,CAAC,OAAO,GAAG,OAAO;EAC9G;EACA,MAAM,CAAC;EACP,OAAO;CACT;CACA,KAAK,MAAM,SAAS,QAAQ;EAC1B,MAAM,QAAQ,KAAK,MAAM,IAAI,KAAK;EAClC,IAAI,UAAU,KAAA,GAAW,IAAI,KAAK,KAAK;OAClC,IAAI,MAAM,GAAG,OAAO;CAC3B;CACA,OAAO,MAAM;AACf;;AAGA,SAAS,mBAAmB,SAA4B;CACtD,MAAM,OAAO,QAAQ,SAAS,IAAI,eAAe,OAAO,IAAI,gBAAgB,OAAO,gBAAgB;CACnG,MAAM,QAAQ,IAAI,WAAW,KAAK,KAAK,OAAO,CAAC,CAAC;CAChD,QAAQ,SAAS,OAAO,MAAM;EAC5B,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK,IAAI,QAAS,KAAM,KAAK,GAAK;GAAE,MAAM,KAAK,IAAI,KAAK;GAAG,MAAM,MAAM,MAAM,QAAS,KAAK;EAAI;CACzH,CAAC;CAGD,OAFiB,OAAO,MAAM,SAAS,GAAG,YAAY,CAAC,CAAC,CAAC,MAAO,IAAI,iBACxD,MAAM,iBAAkB,IAAI;AAE1C;;;;;AAMA,SAAS,oBAAoB,SAA4B;CACvD,MAAM,QAAQ,QAAQ,MAAM,GAAG,EAAE;CAEjC,OAAO,MAAM,MADI,MAAM,KAAK,UAAU,aAAa,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,EACzD,CAAQ,IAAI,MAAM,YAAY,QAAQ,QAAQ,SAAS;AAC5E;AAEA,IAAM,cAAc,YAAY,KAAK,EAAE,QAAQ,IAAI,IAAI,GAAG,MAAM;CAC9D,IAAI,IAAI;CACR,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,IAAI,IAAI,IAAI,aAAc,MAAM,IAAK,MAAM;CACvE,OAAO;AACT,CAAC;;AAGD,SAAS,MAAM,MAAsB;CACnC,IAAI,MAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,MAAM,aAAa,MAAM,KAAK,WAAW,CAAC,KAAK,OAAS,QAAQ;CACtG,QAAQ,MAAM,gBAAgB;AAChC;;AAGA,SAAS,OAAO,MAAuB;CACrC,KAAK,MAAM,CAAC,cAAc,KAAK,SAAS,GAAG,GACzC,IAAI;EACF,MAAM,UAAU,YAAY,OAAO,SAAS;EAC5C,KAAK,QAAQ,OAAO,OAAQ,QAAQ,OAAO,SAAU,QAAQ,WAAW,MAAO,QAAQ,WAAW,MAAM,QAAQ,QAAQ,IAAK,OAAO;CACtI,QAAQ,CAA0C;CAEpD,OAAO;AACT;;AAGA,SAAS,aAAa,MAAuB;CAC3C,KAAK,MAAM,SAAS,KAAK,SAAS,UAAU,GAAG;EAC7C,MAAM,SAAS,KAAK,MAAM,KAAK,IAAI,GAAG,MAAM,QAAQ,aAAa,GAAG,MAAM,KAAK;EAC/E,MAAM,QAAQ,KAAK,MAAM,MAAM,QAAQ,MAAM,EAAE,CAAC,QAAQ,MAAM,QAAQ,MAAM,EAAE,CAAC,SAAS,aAAa;EACrG,IAAI,eAAe,KAAK,MAAM,KAAK,eAAe,KAAK,KAAK,GAAG,OAAO;CACxE;CACA,OAAO;AACT;;AAGA,SAAS,UAAU,MAAoC;CACrD,MAAM,SAAS,CAAC,GAAG,KAAK,SAAS,WAAW,CAAC,CAAC,CAAC,KAAK,GAAG,SAAS,UAAU,YAAY,SAAsB,IAAI,CAAC;CACjH,IAAI,CAAC,OAAO,QAAQ,OAAO;CAC3B,MAAM,OAAO,OAAO,MAAM,UAAU,KAAK,CAAC,EAAE,QAAQ;CAEpD,OAAO;EAAE,MAAM;EAAS,QADP,OAAO,OAAO,UAAU,SAAS,MAAM,SAAS,IACjC,IAAW,OAAO,QAAQ,KAAK,UAAU,MAAM,MAAO,QAAQ,CAAC,IAAI;EAAM;CAAK;AAChH;;AAGA,SAAgB,YAAY,SAAoB,MAAuD;CACrG,IAAI;EACF,MAAM,QAAQ,WAAW,IAAI;EAC7B,IAAI,YAAY,KAAK;GACnB,MAAM,QAAQ,KAAK,MAAM,IAAI,YAAY,SAAS,EAAE,OAAO,KAAK,CAAC,CAAC,CAAC,OAAO,KAAK,CAAC;GAChF,OAAO,MAAM,MAAM,OAAO,SAAS,UAAU,MAAM,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,UAAU,MAAM,MAAM,GAAG,MAAM,IAAI;EAC3G;EACA,MAAM,QAAQ,WAAW,KAAK;EAC9B,OAAO,MAAM,OAAO,GAAG,SAAS,UAAU,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,UAAU,MAAM,CAAC,GAAG,OAAO,CAAC;CAC5F,QAAQ;EACN,OAAO;CACT;AACF;AAEA,SAAS,MAAM,SAAgC,MAAwD;CACrG,IAAI,CAAC,SAAS,UAAU,CAAC,QAAQ,OAAO,MAAmB,OAAO,cAAc,CAAC,KAAM,KAAgB,CAAC,GAAG,OAAO;CAClH,MAAM,SAAS,QAAQ,QAAQ,KAAK,MAAM,MAAM,GAAG,CAAC;CACpD,OAAO,OAAO,cAAc,MAAM,IAAI;EAAE;EAAQ,MAAM,OAAO,SAAS,YAAY,OAAO,OAAO;CAAM,IAAI;AAC5G;AAEA,SAAS,WAAW,MAA0B;CAC5C,MAAM,WAAW,KAAK,QAAQ,MAAM,GAAG,CAAC,CAAC,QAAQ,MAAM,GAAG,CAAC,CAAC,QAAQ,OAAO,EAAE;CAC7E,MAAM,SAAS,KAAK,WAAW,IAAI,QAAQ,IAAK,SAAS,SAAS,KAAM,CAAC,CAAC;CAC1E,OAAO,WAAW,KAAK,SAAS,MAAM,EAAE,WAAW,CAAC,CAAC;AACvD;;AAGA,SAAS,WAAW,OAA4B;CAC9C,IAAI,KAAK,GAAG,QAAQ;CACpB,MAAM,OAAO,IAAI,SAAS,MAAM,QAAQ,MAAM,YAAY,MAAM,UAAU;CAC1E,MAAM,UAAU,SAAyB;EACvC,IAAI,OAAO,IAAI,OAAO;EACtB,MAAM,OAAO,SAAS,KAAK,IAAI,SAAS,KAAK,IAAI,SAAS,KAAK,IAAI,SAAS,KAAK,IAAI;EACrF,IAAI,CAAC,QAAQ,KAAK,OAAO,MAAM,QAAQ,MAAM,IAAI,MAAM,MAAM;EAC7D,IAAI,QAAQ;EACZ,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,KAAK,QAAQ,QAAQ,MAAM,MAAM,KAAK;EAChE,MAAM;EACN,OAAO;CACT;CACA,MAAM,aAAsB;EAC1B,IAAI,MAAM,MAAM,UAAU,EAAE,QAAQ,IAAI,MAAM,IAAI,MAAM,MAAM;EAC9D,MAAM,OAAO,MAAM,OAAO,QAAQ,QAAQ,GAAG,OAAO,OAAO;EAC3D,IAAI;GACF,IAAI,UAAU,GAAG;IACf,IAAI,SAAS,IAAI,OAAO;IACxB,IAAI,SAAS,IAAI,OAAO;IACxB,IAAI,SAAS,MAAM,SAAS,IAAI,OAAO;IACvC,IAAI,SAAS,IAAI;KAAE,MAAM;KAAG,OAAO;IAAK;IACxC,IAAI,SAAS,IAAI;KAAE,MAAM;KAAG,OAAO,KAAK,WAAW,KAAK,CAAC;IAAG;IAC5D,IAAI,SAAS,IAAI;KAAE,MAAM;KAAG,OAAO,KAAK,WAAW,KAAK,CAAC;IAAG;IAC5D,MAAM,IAAI,MAAM,MAAM;GACxB;GACA,MAAM,IAAI,OAAO,IAAI;GACrB,QAAQ,OAAR;IACE,KAAK,GAAG,OAAO;IACf,KAAK,GAAG,OAAO,KAAK;IACpB,KAAK;IAAG,KAAK,GAAG;KACd,IAAI,KAAK,IAAI,MAAM,QAAQ,MAAM,IAAI,MAAM,MAAM;KACjD,MAAM,QAAQ,MAAM,SAAS,IAAK,MAAM,CAAE;KAC1C,OAAO,UAAU,IAAI,QAAQ,IAAI,YAAY,SAAS,EAAE,OAAO,KAAK,CAAC,CAAC,CAAC,OAAO,KAAK;IACrF;IACA,KAAK;KACH,IAAI,IAAI,MAAM,SAAS,IAAI,MAAM,IAAI,MAAM,MAAM;KACjD,OAAO,MAAM,KAAK,EAAE,QAAQ,EAAE,GAAG,IAAI;IAEvC,KAAK,GAAG;KACN,IAAI,IAAI,MAAM,SAAS,IAAI,MAAM,IAAI,MAAM,MAAM;KACjD,MAAM,MAA+B,OAAO,OAAO,IAAI;KACvD,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;MAAE,MAAM,MAAM,KAAK;MAAG,IAAI,OAAO,GAAG,KAAK,KAAK;KAAG;KAC7E,OAAO;IACT;IACA,SAAS,OAAO,KAAK;GACvB;EACF,UAAU;GAAE;EAAS;CACvB;CACA,OAAO,KAAK;AACd;;;ACtQA,IAAM,gBAAwC;CAAE,SAAS;CAAG,SAAS;CAAG,QAAQ;CAAG,MAAM;CAAG,MAAM;CAAG,WAAW;AAAE;;;;;AAMlH,IAAM,UAAU,QAAoBA,SAAS,IAAI,IAAI;;AAGrD,eAAsB,YAAY,KAAiB,MAAc,WAAmB,IAAoC;CACtH,MAAM,QAAQ,KAAK,IAAI,IAAI;CAC3B,SAAS;EACP,MAAM,UAAU,MAAM,KAAK,GAAG,CAAC,CAAC,WAAW,MAAM,SAAS;EAC1D,IAAI,CAAC,SAAS,MAAM,IAAI,SAAS,aAAa,cAAc,UAAU,cAAc;EACpF,IAAI,CAAC,QAAQ,MAAM,SAAS,OAAO;EACnC,IAAI,KAAK,IAAI,KAAK,OAAO,MAAM,IAAI,SAAS,WAAW,mBAAmB,KAAK,MAAM,KAAK,GAAI,EAAE,iHAAiH,OAAO,GAAG,KAAK;GAAE;GAAW,OAAO,QAAQ,KAAK;EAAI,CAAC;EACtQ,MAAM,IAAI,SAAS,YAAY,WAAW,SAAS,GAAG,CAAC;CACzD;AACF;;AAGA,eAAsB,eAAe,KAAiB,MAAc,WAAmB,IAA2B;CAChH,MAAM,QAAQ,KAAK,IAAI,IAAI;CAC3B,OAAO,KAAK,GAAG,CAAC,CAAC,eAAe;EAAE,QAAQ;EAAM;CAAU,CAAC,GAAG;EAC5D,IAAI,KAAK,IAAI,KAAK,OAAO,MAAM,IAAI,SAAS,WAAW,mBAAmB,KAAK,MAAM,KAAK,GAAI,EAAE,kFAAkF,OAAO,GAAG,KAAK,EAAE,UAAU,CAAC;EAC9M,MAAM,IAAI,SAAS,YAAY,WAAW,SAAS,GAAG,CAAC;CACzD;AACF;;;;;AAMA,eAAsB,kBAAkB,KAAiB,SAAiB,WAAmB,MAA0B,IAA6B;CAClJ,MAAM,QAAQ,KAAK,IAAI,IAAI;CAC3B,SAAS;EACP,MAAM,QAAQ,KAAK,GAAG,CAAC,CAAC,WAAW;GAAE;GAAS;GAAW,GAAI,OAAO,EAAE,KAAK,IAAI,CAAC;EAAG,CAAC;EACpF,IAAI,QAAQ,GAAG,OAAO;EACtB,IAAI,KAAK,IAAI,KAAK,OAAO,MAAM,IAAI,SAAS,WAAW,mBAAmB,KAAK,MAAM,KAAK,GAAI,EAAE,uFAAuF,OAAO,GAAG,KAAK;GAAE;GAAW,GAAI,OAAO,EAAE,OAAO,KAAK,IAAI,CAAC;EAAG,CAAC;EACrP,MAAM,IAAI,SAAS,YAAY,WAAW,SAAS,GAAG,CAAC;CACzD;AACF;;;;;;;AAQA,IAAa,sBAAsB;;;;;;AAOnC,eAAsB,iBAAiB,KAAiB,MAAc,MAA0B,SAAyE,IAA2B;CAClM,MAAM,QAAQ,KAAK,IAAI,IAAI;CAC3B,OAAO,QAAQ,KAAK,GAAG,CAAC,CAAC,gBAAgB,EAAE,QAAQ,KAAK,CAAC,CAAC,GAAG;EAC3D,IAAI,KAAK,IAAI,KAAK,OAAO,MAAM,IAAI,SAAS,WAAW,mBAAmB,KAAK,MAAM,KAAK,GAAI,EAAE,wCAAwC,KAAK,4BAA4B,OAAO,GAAG,KAAK,EAAE,KAAK,CAAC;EAChM,MAAM,IAAI,SAAS,YAAY,WAAW,SAAS,GAAG,CAAC;CACzD;AACF;;;;;AAMA,eAAsB,eAAe,KAAiB,MAAc,WAAmB,QAA8B,IAAoC;CACvJ,MAAM,UAAU,MAAM,gBAAgB,KAAK,MAAM,WAAW,QAAQ,EAAE;CACtE,IAAI,IAAI,SAAS,cAAc,WAAW,UAAU,QAAQ,aAAa,UAAU,QAAQ,QAAQ,YAAY,OAAO;CACtH,OAAO,gBAAgB,KAAK,MAAM,WAAW,aAAa,mBAAmB,CAAC,CAAC,MAAM,YAAa,MAAM,KAAK,GAAG,CAAC,CAAC,WAAW,MAAM,SAAS,KAAM,OAAO;AAC3J;AAEA,eAAe,gBAAgB,KAAiB,MAAc,WAAmB,QAA8B,IAAoC;CACjJ,MAAM,OAAO,cAAc;CAC3B,MAAM,QAAQ,YAAuC;EACnD,IAAI,CAAC,SAAS,OAAO,KAAA;EACrB,MAAM,WAAW,QAAQ,YAAY;EACrC,IAAI,aAAa,UAAU,MAAM,IAAI,SAAS,UAAU,QAAQ,iBAAiB,iCAAiC;GAAE;GAAW;EAAS,CAAC;EACzI,QAAQ,cAAc,aAAa,MAAM,OAAO,UAAU,KAAA;CAC5D;CACA,OAAO,IAAI,SAAwB,SAAS,WAAW;EACrD,IAAI,UAAU;EACd,MAAM,UAAU,OAAgB,YAA4B;GAC1D,IAAI,SAAS;GACb,UAAU;GAAM,aAAa,KAAK;GAAG,IAAI;GACzC,IAAI,OAAO,OAAO,KAAK;QAAQ,QAAQ,OAAQ;EACjD;EACA,MAAM,SAAS,OAAO,UAAU,KAAK,KAAK,GAAG,CAAC,CAAC,WAAW,MAAM,SAAS,CAAC,CAAC,MAAM,YAAY;GAC3F,IAAI;IACF,MAAM,OAAO,KAAK,OAAO;IACzB,IAAI,MAAM,OAAO,MAAM,IAAI;SACtB,IAAI,MAAM,OAAO,IAAI,SAAS,WAAW,mBAAmB,KAAK,MAAM,KAAK,GAAI,EAAE,qBAAqB,SAAS,YAAY,eAAe,OAAO,OAAO,GAAG,KAAK;KAAE;KAAW,UAAU,SAAS,YAAY;IAAK,CAAC,CAAC;GAC3N,SAAS,OAAO;IAAE,OAAO,KAAK;GAAG;EACnC,GAAG,MAAM;EACT,MAAM,QAAQ,iBAAiB,MAAM,IAAI,GAAG,EAAE;EAG9C,MAAM,MAAM,IAAI,IAAI,SAAS,UAAwB;GACnD,IAAI,MAAM,SAAS,SAAS,MAAM,cAAc,aAAc,MAAM,SAAyC,OAAO,YAAY,MAAM;EACxI,CAAC;EACD,MAAM;CACR,CAAC;AACH;;;;;;;;;;AC7FA,SAAgB,UAAU,SAAoG;CAC5H,MAAM,QAAQ,MAAM,QAAQ,QAAQ,MAAM,IAAI,QAAQ,SAAqB,CAAC;CAC5E,IAAI,CAAC,MAAM,QAAQ;EACjB,KAAK,MAAM,QAAQ;GAAC;GAAS;GAAQ;EAAI,GACvC,IAAI,QAAQ,UAAU,KAAA,GAAW,MAAM,IAAI,SAAS,SAAS,KAAK,KAAK,6BAA6B;EACtG;CACF;CACA,MAAM,UAAqC,MAAM,KAAK,UAAU;EAC9D,MAAM,QAAQ,MAAM,QAAQ,GAAG;EAC/B,IAAI,QAAQ,KAAK,UAAU,MAAM,SAAS,GAAG,MAAM,IAAI,SAAS,SAAS,8CAA8C,KAAK,UAAU,KAAK,GAAG;EAC9I,OAAO;GAAE,IAAI,MAAM,MAAM,GAAG,KAAK;GAAG,OAAO,MAAM,MAAM,QAAQ,CAAC,CAAC,CAAC,KAAK;EAAE;CAC3E,CAAC;CACD,MAAM,QAAQ,QAAQ,WAAW,QAAQ,OAAO,QAAQ,WAAW,UAAU,MAAM,OAAO,OAAO,EAAE,MAAM,EAAE;CAC3G,IAAI,UAAU,IAAI,MAAM,IAAI,SAAS,SAAS,YAAY,KAAK,UAAU,MAAM,MAAM,EAAE,kBAAkB,KAAK,UAAU,QAAQ,MAAM,CAAC,EAAE,EAAE,4BAA4B;CAEvK,MAAM,QAAQ,iBAAiB,OAAO;CACtC,IAAI,OAAO;EACT,MAAM,CAAC,IAAI,SAAS,CAAC,KAAK,UAAU,MAAM,MAAM,GAAG,GAAG,KAAK,UAAU,MAAM,MAAM,KAAK,CAAC;EACvF,MAAM,IAAI,SAAS,SAAS,MAAM,SAAS,UACvC,YAAY,GAAG,iCAAiC,MAAM,yEACtD,YAAY,GAAG,0CAA0C,MAAM,2CAA2C;CAChH;CACA,KAAK,MAAM,SAAS,MAAM,QAAQ,QAAQ,KAAK,IAAI,QAAQ,QAAoB,CAAC,GAAG;EACjF,MAAM,KAAK,MAAM,QAAQ,GAAG;EAC5B,MAAM,SAAS,KAAK,IAAI,QAAQ,MAAM,MAAM,EAAE,OAAO,MAAM,MAAM,GAAG,EAAE,CAAC,IAAI,KAAA;EAC3E,IAAI,CAAC,QAAQ,MAAM,IAAI,SAAS,SAAS,uEAAuE,KAAK,UAAU,KAAK,GAAG;EACvI,MAAM,QAAQ,MAAM,MAAM,KAAK,CAAC;EAChC,IAAI,CAAE,cAAoC,SAAS,KAAK,GAAG,MAAM,IAAI,SAAS,SAAS,WAAW,KAAK,UAAU,KAAK,EAAE,wBAAwB,cAAc,KAAK,IAAI,GAAG;EAC1K,OAAO,QAAQ;CACjB;CACA,IAAI,QAAQ,SAAS,MAAM,KAAK,MAAM,UAAU,SAAS,OAAO,OAAO;CACvE,OAAO;EAAE;EAAS,GAAI,QAAQ,OAAO,KAAA,KAAa,EAAE,WAAW,OAAO,QAAQ,EAAE,EAAE;CAAG;AACvF;;AAGA,SAAS,QAAQ,MAA4C;CAC3D,MAAM,SAAS,gBAAgB,IAAI;CACnC,IAAI,WAAW,QAAQ,MAAM,IAAI,SAAS,eAAe,YAAY,OAAO,SAAS,EAAE,KAAK,CAAC;CAC7F,OAAO,OAAO;AAChB;;;;;AAMA,SAAgB,YAAY,QAAyC;CACnE,MAAM,UAAU,OAAO;CACvB,IAAI,YAAY,KAAA,KAAa,YAAY,MAAM;EAC7C,IAAI,OAAO,cAAc,KAAA,GAAW,MAAM,IAAI,SAAS,eAAe,6BAA6B;EACnG;CACF;CACA,IAAI,CAAC,MAAM,QAAQ,OAAO,GAAG,MAAM,IAAI,SAAS,eAAe,sDAAsD;CAErH,OAAO,QAAQ;EAAE,MAAM;EAAW,IADvB,IAAI,QAAQ,WAAW,KAAK,OAAO,YAAY,YAAY,CAAC,CAAC;EAClC;CAAQ,CAAC;AACjD;;AAGA,SAAgB,UAAU,MAAgC;CACxD,MAAM,OAAO,KAAK,eAAe;CACjC,OAAO,OAAO,KAAK,SAAS,kBAAkB,IAAI;AACpD;;AAGA,SAAS,eAAe,SAAoC,KAAa,OAAuD;CAC9H,IAAI,CAAC,SAAS,MAAM,IAAI,SAAS,aAAa,cAAc,KAAK,UAAU,GAAG,EAAE,oBAAoB,QAAQ,UAAU,OAAO,0BAA0B;CACvJ,IAAI,QAAQ,MAAM,SAAS,WAAW,MAAM,IAAI,SAAS,eAAe,mEAAmE;CAC3I,OAAO;AACT;;;;;AAMA,eAAe,cAAc,KAA4B,QAAkD;CACzG,MAAM,SAAS,YAAY,KAAK,IAAI,QAAQ,QAAQ,IAAI,CAAC;CACzD,MAAM,MAAM,IAAI,QAAQ,WAAW,IAAI;CACvC,MAAM,SAAS,IAAI,QAAQ,QAAQ;CACnC,MAAM,QAAQ,KAAK,QAAQ,OAAO;CAClC,MAAM,UAAU,IAAI,QAAQ,MAAM;CAClC,IAAI,WAAW,KAAA,KAAa,CAAC,SAAS,YAAY,KAAA,GAAW,MAAM,IAAI,SAAS,eAAe,+CAA+C;CAE9I,IAAI,YAAY,KAAA,KAAa,CAAC,KAAK,QAAQ,OAAO,GAAG;EACnD,MAAM,SAAS,WAAW,OAAO;EACjC,IAAI,QAAQ,MAAM,IAAI,SAAS,WAAW,uBAAuB,OAAO,SAAS,UAAU,uDAAuD,qCAAqC,uCAAuC,EAAE,MAAM,OAAO,KAAK,CAAC;CACrP;CACA,MAAM,UAAU,eAAe,MAAM,UAAU,KAAK,OAAO,QAAQ,MAAM,MAAM,EAAE,WAAW,IAAI,GAAG,KAAK,OAAO,KAAK;CACpH,KAAK,QAAQ,MAAM,OAAO,MAAM,mBAAmB,OACjD,MAAM,IAAI,SAAS,WAAW,qBAAqB,mBAAmB,MAAM,0DAA0D;EAAE,WAAW,QAAQ;EAAI,OAAO,QAAQ,KAAM;CAAI,CAAC;CAC3L,MAAM,SAAS,QAAQ;CAEvB,IAAI,WAAW,KAAA,KAAa,CAAC,OAAO,QAAQ,MAAM,MAAM,EAAE,OAAO,MAAM,GACrE,MAAM,IAAI,SAAS,eAAe,8BAA8B,KAAK,UAAU,MAAM,EAAE,iBAAiB,OAAO,QAAQ,KAAK,MAAM,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,KAAK,EAAE,MAAM,OAAO,CAAC;CACxK,MAAM,OAAO,QAAQ;EAAE,GAAG;EAAQ,GAAI,WAAW,KAAA,KAAa,EAAE,OAAO;EAAI,IAAK,SAAS,OAAO,WAAW,EAAE,QAAQ,KAAK;CAAG,CAAC;CAC9H,MAAM,OAAO,WAAW,QAAQ;CAChC,MAAM,OAAO,MAAM,QAAQ,QAAQ,OAAO,QAAQ,CAAC,QAAQ,MAAM,IAAa,CAAC,QAAQ,WAAW,GAAY,MAAM;CACpH,MAAM,KAAK,IAAI,QAAQ,WAAW,IAAI;EAAE,KAAK;EAAG,KAAK;CAAK,CAAC,IAAI;CAC/D,MAAM,SAAS,MAAM,KAAK,GAAG,CAAC,CAAC,YAAY;EAAE,QAAQ,OAAO;EAAQ,WAAW,QAAQ;EAAI;EAAM;CAAK,CAAC;CACvG,IAAI,OAAO,OAAO,MAAM,IAAI,SAAS,OAAO,UAAU,YAAY,eAAe,OAAO,KAAK;CAC7F,IAAI,SAAS,MAAM,KAAK,GAAG,CAAC,CAAC,WAAW,OAAO,QAAQ,QAAQ,EAAE;CACjE,IAAI,SAAS,eAAe,QAAQ,MAAM,SAAS,SAAS,MAAM,YAAY,KAAK,OAAO,QAAQ,QAAQ,IAAI,EAAE;CAChH,MAAM,QAAQ,SAAS,UAAU,QAAQ,OAAO,MAAM,kBAAkB,KAAK,OAAO,IAAI,QAAQ,IAAI,OAAO,KAAK,KAAK,EAAE,IAAI,KAAA;CAC3H,OAAO;GACJ,OAAO,QAAQ,UAAU,SAAS,OAAO;EAAI,SAAS,KAAK;EAAI,WAAW,QAAQ;EAAI;EAAM,OAAO,QAAQ,MAAM,OAAO;EACzH,GAAI,OAAO,QAAQ,EAAE,GAAI,UAAU,KAAA,KAAa,EAAE,MAAM,EAAG,IAAI,EAAE,WAAW,CAAC,CAAC,UAAU,CAAC,OAAO,MAAM,QAAQ;CAChH;AACF;;;;;;;AAQA,eAAe,YAAY,KAA4B,QAAkD;CACvG,MAAM,SAAS,YAAY,KAAK,IAAI,QAAQ,QAAQ,IAAI,CAAC;CACzD,MAAM,MAAM,IAAI,QAAQ,WAAW,IAAI;CACvC,MAAM,WAAW,IAAI,QAAQ,UAAU,IAAI;CAC3C,MAAM,QAAQ,OAAO,QAAQ,UAAU;CACvC,MAAM,UAAU,MAAM,UAAU,KAAK,OAAO,QAAQ,MAAM,MAAM,EAAE,WAAW,IAAI;CACjF,IAAI,CAAC,SAAS,MAAM,IAAI,SAAS,aAAa,cAAc,KAAK,UAAU,GAAG,EAAE,6BAA6B,MAAM,mCAAmC;CACtJ,IAAI,QAAQ,MAAM,SAAS,WAAW,MAAM,IAAI,SAAS,eAAe,6BAA6B;CACrG,MAAM,SAAS,QAAQ,KAAK,QAAQ,MAAM,MAAM,EAAE,OAAO,QAAQ;CACjE,IAAI,CAAC,QAAQ,MAAM,IAAI,SAAS,aAAa,8BAA8B,KAAK,UAAU,QAAQ,EAAE,iBAAiB,QAAQ,KAAK,QAAQ,KAAK,MAAM,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,GAAG;CACvK,MAAM,OAAO,OAAO,QAChB,MAAM,QAAQ,QAAQ,CAAC,QAAQ,MAAM,GAAY,MAAM,IACvD,MAAM,QAAQ,QAAQ;EAAC;EAAQ;EAAQ;CAAW,GAAY,IAAI,SAAS,aAAa,SAAS,MAAM;CAC3G,MAAM,KAAK,IAAI,QAAQ,WAAW,IAAI;EAAE,KAAK;EAAG,KAAK;CAAK,CAAC,IAAI;CAC/D,MAAM,SAAS,MAAM,KAAK,GAAG,CAAC,CAAC,YAAY;EAAE,QAAQ,OAAO;EAAQ,WAAW,QAAQ;EAAI;CAAS,CAAC;CACrG,IAAI,OAAO,OAAO,MAAM,IAAI,SAAS,OAAO,UAAU,YAAY,eAAe,OAAO,OAAO,OAAO,QAAQ,EAAE,OAAO,KAAK,IAAI,KAAA,CAAS;CACzI,MAAM,UAAU,OAAO,aAAa;CACpC,MAAM,SAAS;GAAG,QAAQ,OAAO;EAAI,WAAW,QAAQ;EAAI,QAAQ,OAAO;EAAI,OAAO,OAAO;EAAO;CAAQ;CAC5G,IAAI,CAAC,SAAS,OAAO;CACrB,IAAI,OAAO,OAAO;EAChB,MAAM,QAAQ,SAAS,SAAS,MAAM,kBAAkB,KAAK,OAAO,IAAI,SAAS,KAAA,GAAW,EAAE,IAAI,KAAK,GAAG,CAAC,CAAC,WAAW;GAAE,SAAS,OAAO;GAAI,WAAW;EAAQ,CAAC;EACjK,OAAO;GAAE,GAAG;GAAQ;EAAM;CAC5B;CACA,MAAM,QAAQ,SAAS,SAAS,MAAM,KAAK,GAAG,CAAC,CAAC,WAAW,OAAO,QAAQ,OAAO,IAAI,MAAM,eAAe,KAAK,OAAO,QAAQ,SAAS,MAAM,EAAE;CAC/I,OAAO;EAAE,GAAG;EAAQ,UAAU,OAAO,YAAY;CAAK;AACxD;AAEA,IAAa,iBAAyC;;CAEpD,gBAAgB;;CAEhB,iBAAiB;AACnB"}
|
|
@@ -1,236 +0,0 @@
|
|
|
1
|
-
import { d as lockPath } from "./profiles-MFtCmJwK.js";
|
|
2
|
-
import { closeSync, lstatSync, openSync, readFileSync, rmSync, writeSync } from "node:fs";
|
|
3
|
-
import { join } from "node:path";
|
|
4
|
-
import { createHmac, randomBytes, timingSafeEqual } from "node:crypto";
|
|
5
|
-
var CALL_RATES = [
|
|
6
|
-
8e3,
|
|
7
|
-
12e3,
|
|
8
|
-
16e3,
|
|
9
|
-
24e3,
|
|
10
|
-
48e3
|
|
11
|
-
];
|
|
12
|
-
var DEFAULT_RATE = 48e3;
|
|
13
|
-
var frameSamples = (rate) => rate * 20 / 1e3;
|
|
14
|
-
var frameBytes = (rate) => frameSamples(rate) * 2;
|
|
15
|
-
var bytesToMs = (rate, bytes) => Math.round(bytes / 2 / rate * 1e3);
|
|
16
|
-
function isCallRate(value) {
|
|
17
|
-
return CALL_RATES.includes(value);
|
|
18
|
-
}
|
|
19
|
-
/** The most a program may queue ahead of the call: five minutes of speech. What goes past it is dropped. */
|
|
20
|
-
var MAX_QUEUE_MS = 3e5;
|
|
21
|
-
/**
|
|
22
|
-
* What the program wrote, waiting to be sent: taken one 20 ms frame per tick, silence when there is nothing, and
|
|
23
|
-
* dropped whole by a flush (barge-in). The program may write any amount at any time, faster than real time too.
|
|
24
|
-
*/
|
|
25
|
-
var PlaybackQueue = class {
|
|
26
|
-
rate;
|
|
27
|
-
now;
|
|
28
|
-
chunks = [];
|
|
29
|
-
head = 0;
|
|
30
|
-
length = 0;
|
|
31
|
-
lastPush = 0;
|
|
32
|
-
frame;
|
|
33
|
-
max;
|
|
34
|
-
silence;
|
|
35
|
-
/** Bytes dropped because the queue was full, since the start. */
|
|
36
|
-
dropped = 0;
|
|
37
|
-
constructor(rate, now = Date.now, maxMs = MAX_QUEUE_MS) {
|
|
38
|
-
this.rate = rate;
|
|
39
|
-
this.now = now;
|
|
40
|
-
this.frame = frameBytes(rate);
|
|
41
|
-
this.max = Math.floor(rate * maxMs / 1e3) * 2;
|
|
42
|
-
this.silence = Buffer.alloc(this.frame);
|
|
43
|
-
}
|
|
44
|
-
/** Adds what the program wrote. Returns the bytes it could not keep (the queue was full). */
|
|
45
|
-
push(chunk) {
|
|
46
|
-
if (!chunk.length) return 0;
|
|
47
|
-
this.lastPush = this.now();
|
|
48
|
-
const room = this.max - this.length;
|
|
49
|
-
const kept = chunk.length <= room ? chunk : chunk.subarray(0, Math.max(0, room));
|
|
50
|
-
const lost = chunk.length - kept.length;
|
|
51
|
-
this.dropped += lost;
|
|
52
|
-
if (kept.length) {
|
|
53
|
-
this.chunks.push(Buffer.from(kept));
|
|
54
|
-
this.length += kept.length;
|
|
55
|
-
}
|
|
56
|
-
return lost;
|
|
57
|
-
}
|
|
58
|
-
/** Queued audio, in milliseconds (whole frames and a partial one). */
|
|
59
|
-
get queuedMs() {
|
|
60
|
-
return bytesToMs(this.rate, this.length - this.length % 2);
|
|
61
|
-
}
|
|
62
|
-
/** One frame to send now, and whether it is the program's audio or silence. */
|
|
63
|
-
next() {
|
|
64
|
-
if (this.length >= this.frame) return {
|
|
65
|
-
frame: this.take(this.frame),
|
|
66
|
-
silent: false
|
|
67
|
-
};
|
|
68
|
-
const whole = this.length - this.length % 2;
|
|
69
|
-
if (whole > 0 && this.now() - this.lastPush >= 60) {
|
|
70
|
-
const frame = Buffer.alloc(this.frame);
|
|
71
|
-
this.take(whole).copy(frame);
|
|
72
|
-
return {
|
|
73
|
-
frame,
|
|
74
|
-
silent: false
|
|
75
|
-
};
|
|
76
|
-
}
|
|
77
|
-
return {
|
|
78
|
-
frame: this.silence,
|
|
79
|
-
silent: true
|
|
80
|
-
};
|
|
81
|
-
}
|
|
82
|
-
/** Drops everything queued; returns how much, in milliseconds. */
|
|
83
|
-
flush() {
|
|
84
|
-
const ms = this.queuedMs;
|
|
85
|
-
this.chunks = [];
|
|
86
|
-
this.head = 0;
|
|
87
|
-
this.length = 0;
|
|
88
|
-
return ms;
|
|
89
|
-
}
|
|
90
|
-
/** Drops up to that much from the front, in whole frames (audio whose time went by); returns how much, in milliseconds. */
|
|
91
|
-
skip(ms) {
|
|
92
|
-
const frames = Math.min(Math.floor(ms / 20), Math.floor(this.length / this.frame));
|
|
93
|
-
if (frames > 0) this.take(frames * this.frame);
|
|
94
|
-
return Math.max(0, frames) * 20;
|
|
95
|
-
}
|
|
96
|
-
take(bytes) {
|
|
97
|
-
const out = Buffer.allocUnsafe(bytes);
|
|
98
|
-
let filled = 0;
|
|
99
|
-
while (filled < bytes) {
|
|
100
|
-
const chunk = this.chunks[0];
|
|
101
|
-
const n = Math.min(bytes - filled, chunk.length - this.head);
|
|
102
|
-
chunk.copy(out, filled, this.head, this.head + n);
|
|
103
|
-
filled += n;
|
|
104
|
-
this.head += n;
|
|
105
|
-
if (this.head === chunk.length) {
|
|
106
|
-
this.chunks.shift();
|
|
107
|
-
this.head = 0;
|
|
108
|
-
}
|
|
109
|
-
}
|
|
110
|
-
this.length -= bytes;
|
|
111
|
-
return out;
|
|
112
|
-
}
|
|
113
|
-
};
|
|
114
|
-
//#endregion
|
|
115
|
-
//#region src/daemonProof.ts
|
|
116
|
-
/**
|
|
117
|
-
* How a client knows the process on the profile's socket is the profile's daemon (WISP 1100 § Local control API).
|
|
118
|
-
* On Windows the socket is a named pipe whose name follows from the profile's path, and any account of the machine
|
|
119
|
-
* may open that name first; the pipe itself has no owner a client can check. So the daemon writes a fresh random
|
|
120
|
-
* secret in the profile's owner-only folder at every start, and the client sends nothing but a `daemon.hello` with a
|
|
121
|
-
* nonce of its own until the answer proves, over that nonce, that its sender read the secret. Same on every platform.
|
|
122
|
-
*
|
|
123
|
-
* Before even the hello, the daemon speaks first: a greeting that proves, with the same secret, its pid (the
|
|
124
|
-
* profile's lock holder) and the time. The client writes nothing at all until the greeting checks out. A process
|
|
125
|
-
* holding `SeImpersonatePrivilege` that opened the pipe's name first can impersonate the client from the first
|
|
126
|
-
* message it reads (Node's pipe client sets no security quality of service, so the level is SecurityImpersonation),
|
|
127
|
-
* and Windows refuses to impersonate a pipe's client until data has been read from it (ERROR_CANNOT_IMPERSONATE):
|
|
128
|
-
* a client that writes nothing to it cannot be impersonated.
|
|
129
|
-
*/
|
|
130
|
-
var HELLO = "daemon.hello";
|
|
131
|
-
function daemonSecretPath(dir) {
|
|
132
|
-
return join(dir, "daemon.secret");
|
|
133
|
-
}
|
|
134
|
-
/** HMAC-SHA256 over the role's domain and the nonce, hex: a daemon's proof is never a client's, nor one for another nonce. */
|
|
135
|
-
function proof(secret, role, nonce) {
|
|
136
|
-
return createHmac("sha256", secret).update(`ghostly-${role}:${nonce}`).digest("hex");
|
|
137
|
-
}
|
|
138
|
-
function newNonce() {
|
|
139
|
-
return randomBytes(16).toString("hex");
|
|
140
|
-
}
|
|
141
|
-
/**
|
|
142
|
-
* The daemon's: a new secret, 32 random bytes as hex, made 0600 (`wx`, so a file or link put there in the meantime is
|
|
143
|
-
* an error, not something written through). The one a daemon before it left is removed first: whoever could have
|
|
144
|
-
* read that one learns nothing about this one.
|
|
145
|
-
*/
|
|
146
|
-
function newDaemonSecret(dir) {
|
|
147
|
-
const file = daemonSecretPath(dir);
|
|
148
|
-
rmSync(file, { force: true });
|
|
149
|
-
const secret = randomBytes(32);
|
|
150
|
-
const fd = openSync(file, "wx", 384);
|
|
151
|
-
try {
|
|
152
|
-
writeSync(fd, secret.toString("hex") + "\n");
|
|
153
|
-
} finally {
|
|
154
|
-
closeSync(fd);
|
|
155
|
-
}
|
|
156
|
-
return secret;
|
|
157
|
-
}
|
|
158
|
-
/** The daemon's, when it stops: a greeting copied from it proves nothing once it is gone. */
|
|
159
|
-
function removeDaemonSecret(dir) {
|
|
160
|
-
rmSync(daemonSecretPath(dir), { force: true });
|
|
161
|
-
}
|
|
162
|
-
/** The daemon's first line on every connection, before it has read anything. */
|
|
163
|
-
function greeting(secret, pid = process.pid, at = Date.now()) {
|
|
164
|
-
return { greeting: {
|
|
165
|
-
pid,
|
|
166
|
-
at,
|
|
167
|
-
proof: proof(secret, "greeting", `${pid}:${at}`)
|
|
168
|
-
} };
|
|
169
|
-
}
|
|
170
|
-
/**
|
|
171
|
-
* Whether `message` (the first line the client read) is the profile's daemon's greeting: proved with the secret, made
|
|
172
|
-
* within `GREETING_WINDOW_MS` of `now`, by the process that holds the profile's lock, alive and one this user may
|
|
173
|
-
* signal (`process.kill(pid, 0)`: EPERM on Unix for another user's; on Windows libuv opens the process to terminate
|
|
174
|
-
* it, which another account's process normally denies). A greeting copied from a daemon that died fails on its pid,
|
|
175
|
-
* unless a process this user may signal took that pid within the window.
|
|
176
|
-
*/
|
|
177
|
-
function provesGreeting(secret, dir, message, now = Date.now()) {
|
|
178
|
-
const given = message?.greeting;
|
|
179
|
-
if (!given || !Number.isSafeInteger(given.pid) || given.pid <= 0 || !Number.isSafeInteger(given.at)) return false;
|
|
180
|
-
if (typeof given.proof !== "string" || !/^[0-9a-f]{64}$/.test(given.proof)) return false;
|
|
181
|
-
const { pid, at } = given;
|
|
182
|
-
if (Math.abs(now - at) > 1e4) return false;
|
|
183
|
-
if (!timingSafeEqual(Buffer.from(given.proof, "hex"), Buffer.from(proof(secret, "greeting", `${pid}:${at}`), "hex"))) return false;
|
|
184
|
-
return holdsProfile(dir, pid);
|
|
185
|
-
}
|
|
186
|
-
/**
|
|
187
|
-
* Whether a daemon of this release holds the profile: its secret is there (an older release's never writes one, and a
|
|
188
|
-
* daemon removes its own when it stops) and the lock's holder is alive and this user's. One whose greeting is late is
|
|
189
|
-
* busy (its event loop held by one long task), not something else on its socket: the client waits for it.
|
|
190
|
-
*/
|
|
191
|
-
function daemonOfThisRelease(dir) {
|
|
192
|
-
if (!readDaemonSecret(dir)) return false;
|
|
193
|
-
let pid;
|
|
194
|
-
try {
|
|
195
|
-
pid = Number(readFileSync(lockPath(dir), "utf8").trim());
|
|
196
|
-
} catch {
|
|
197
|
-
return false;
|
|
198
|
-
}
|
|
199
|
-
return Number.isSafeInteger(pid) && pid > 0 && holdsProfile(dir, pid);
|
|
200
|
-
}
|
|
201
|
-
function holdsProfile(dir, pid) {
|
|
202
|
-
try {
|
|
203
|
-
if (readFileSync(lockPath(dir), "utf8").trim() !== String(pid)) return false;
|
|
204
|
-
process.kill(pid, 0);
|
|
205
|
-
return true;
|
|
206
|
-
} catch {
|
|
207
|
-
return false;
|
|
208
|
-
}
|
|
209
|
-
}
|
|
210
|
-
/**
|
|
211
|
-
* The client's: the secret the profile's daemon wrote, or null when there is none, or it is not a file of this user's
|
|
212
|
-
* alone (a link, another user's file, one others may read): then it proves nothing. On Windows the file has the
|
|
213
|
-
* folder's ACL (owner-only in the user's home); Node can check no more than that it is a plain file.
|
|
214
|
-
*/
|
|
215
|
-
function readDaemonSecret(dir) {
|
|
216
|
-
const file = daemonSecretPath(dir);
|
|
217
|
-
try {
|
|
218
|
-
const info = lstatSync(file);
|
|
219
|
-
if (!info.isFile()) return null;
|
|
220
|
-
if (process.platform !== "win32" && (process.getuid && info.uid !== process.getuid() || (info.mode & 63) !== 0)) return null;
|
|
221
|
-
const text = readFileSync(file, "utf8").trim();
|
|
222
|
-
return /^[0-9a-f]{64}$/.test(text) ? Buffer.from(text, "hex") : null;
|
|
223
|
-
} catch {
|
|
224
|
-
return null;
|
|
225
|
-
}
|
|
226
|
-
}
|
|
227
|
-
/** Whether `answer` (the result of a `daemon.hello` with `nonce`) is the daemon's proof over it, in constant time. */
|
|
228
|
-
function provesDaemon(secret, nonce, answer) {
|
|
229
|
-
const given = answer?.proof;
|
|
230
|
-
if (typeof given !== "string" || !/^[0-9a-f]{64}$/.test(given)) return false;
|
|
231
|
-
return timingSafeEqual(Buffer.from(given, "hex"), Buffer.from(proof(secret, "daemon", nonce), "hex"));
|
|
232
|
-
}
|
|
233
|
-
//#endregion
|
|
234
|
-
export { isCallRate as _, newNonce as a, provesGreeting as c, CALL_RATES as d, DEFAULT_RATE as f, frameSamples as g, frameBytes as h, newDaemonSecret as i, readDaemonSecret as l, bytesToMs as m, daemonOfThisRelease as n, proof as o, PlaybackQueue as p, greeting as r, provesDaemon as s, HELLO as t, removeDaemonSecret as u };
|
|
235
|
-
|
|
236
|
-
//# sourceMappingURL=daemonProof-DtrL5lE5.js.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"daemonProof-DtrL5lE5.js","names":[],"sources":["../../src/calls/pcm.ts","../../src/daemonProof.ts"],"sourcesContent":["/**\n * The audio a call hands to an outside program, and takes from it (WISP 1100 § Calls): raw PCM, signed 16-bit\n * little-endian, mono, at the call's rate, in frames of 20 ms. Opus runs at every one of these rates itself, so\n * nothing is resampled.\n */\nexport const FRAME_MS = 20;\nexport const CALL_RATES = [8000, 12000, 16000, 24000, 48000] as const;\nexport type CallRate = (typeof CALL_RATES)[number];\nexport const DEFAULT_RATE: CallRate = 48000;\n\nexport const frameSamples = (rate: CallRate): number => (rate * FRAME_MS) / 1000;\nexport const frameBytes = (rate: CallRate): number => frameSamples(rate) * 2;\nexport const bytesToMs = (rate: CallRate, bytes: number): number => Math.round((bytes / 2 / rate) * 1000);\n\nexport function isCallRate(value: unknown): value is CallRate {\n return CALL_RATES.includes(value as CallRate);\n}\n\n/** The most a program may queue ahead of the call: five minutes of speech. What goes past it is dropped. */\nexport const MAX_QUEUE_MS = 5 * 60_000;\n\n/**\n * A partial frame waits this long for the rest of it before it is played padded with silence: a program writing at\n * real time, a little late, is not cut into gaps; a program that stopped mid-frame is still heard to its end.\n */\nexport const PARTIAL_WAIT_MS = 60;\n\n/**\n * What the program wrote, waiting to be sent: taken one 20 ms frame per tick, silence when there is nothing, and\n * dropped whole by a flush (barge-in). The program may write any amount at any time, faster than real time too.\n */\nexport class PlaybackQueue {\n private chunks: Buffer[] = [];\n private head = 0;\n private length = 0;\n private lastPush = 0;\n private readonly frame: number;\n private readonly max: number;\n private readonly silence: Buffer;\n /** Bytes dropped because the queue was full, since the start. */\n dropped = 0;\n\n constructor(readonly rate: CallRate, private readonly now: () => number = Date.now, maxMs = MAX_QUEUE_MS) {\n this.frame = frameBytes(rate);\n // Whole samples only: an odd byte waits for its other half.\n this.max = Math.floor((rate * maxMs) / 1000) * 2;\n this.silence = Buffer.alloc(this.frame);\n }\n\n /** Adds what the program wrote. Returns the bytes it could not keep (the queue was full). */\n push(chunk: Buffer): number {\n if (!chunk.length) return 0;\n this.lastPush = this.now();\n const room = this.max - this.length;\n const kept = chunk.length <= room ? chunk : chunk.subarray(0, Math.max(0, room));\n const lost = chunk.length - kept.length;\n this.dropped += lost;\n if (kept.length) { this.chunks.push(Buffer.from(kept)); this.length += kept.length; }\n return lost;\n }\n\n /** Queued audio, in milliseconds (whole frames and a partial one). */\n get queuedMs(): number {\n return bytesToMs(this.rate, this.length - (this.length % 2));\n }\n\n /** One frame to send now, and whether it is the program's audio or silence. */\n next(): { frame: Buffer; silent: boolean } {\n if (this.length >= this.frame) return { frame: this.take(this.frame), silent: false };\n const whole = this.length - (this.length % 2);\n if (whole > 0 && this.now() - this.lastPush >= PARTIAL_WAIT_MS) {\n const frame = Buffer.alloc(this.frame);\n this.take(whole).copy(frame);\n return { frame, silent: false };\n }\n return { frame: this.silence, silent: true };\n }\n\n /** Drops everything queued; returns how much, in milliseconds. */\n flush(): number {\n const ms = this.queuedMs;\n this.chunks = [];\n this.head = 0;\n this.length = 0;\n return ms;\n }\n\n /** Drops up to that much from the front, in whole frames (audio whose time went by); returns how much, in milliseconds. */\n skip(ms: number): number {\n const frames = Math.min(Math.floor(ms / FRAME_MS), Math.floor(this.length / this.frame));\n if (frames > 0) this.take(frames * this.frame);\n return Math.max(0, frames) * FRAME_MS;\n }\n\n private take(bytes: number): Buffer {\n const out = Buffer.allocUnsafe(bytes);\n let filled = 0;\n while (filled < bytes) {\n const chunk = this.chunks[0];\n const n = Math.min(bytes - filled, chunk.length - this.head);\n chunk.copy(out, filled, this.head, this.head + n);\n filled += n;\n this.head += n;\n if (this.head === chunk.length) { this.chunks.shift(); this.head = 0; }\n }\n this.length -= bytes;\n return out;\n }\n}\n","import { createHmac, randomBytes, timingSafeEqual } from \"node:crypto\";\nimport { closeSync, lstatSync, openSync, readFileSync, rmSync, writeSync } from \"node:fs\";\nimport { join } from \"node:path\";\nimport { lockPath } from \"./profiles\";\n\n/**\n * How a client knows the process on the profile's socket is the profile's daemon (WISP 1100 § Local control API).\n * On Windows the socket is a named pipe whose name follows from the profile's path, and any account of the machine\n * may open that name first; the pipe itself has no owner a client can check. So the daemon writes a fresh random\n * secret in the profile's owner-only folder at every start, and the client sends nothing but a `daemon.hello` with a\n * nonce of its own until the answer proves, over that nonce, that its sender read the secret. Same on every platform.\n *\n * Before even the hello, the daemon speaks first: a greeting that proves, with the same secret, its pid (the\n * profile's lock holder) and the time. The client writes nothing at all until the greeting checks out. A process\n * holding `SeImpersonatePrivilege` that opened the pipe's name first can impersonate the client from the first\n * message it reads (Node's pipe client sets no security quality of service, so the level is SecurityImpersonation),\n * and Windows refuses to impersonate a pipe's client until data has been read from it (ERROR_CANNOT_IMPERSONATE):\n * a client that writes nothing to it cannot be impersonated.\n */\nexport const HELLO = \"daemon.hello\";\n\n/**\n * How far a greeting's time may be from the client's clock (the same machine's): a greeting is no fresh challenge, so\n * one copied from a daemon that has since died could otherwise stand in for it as long as its secret file is left.\n */\nexport const GREETING_WINDOW_MS = 10_000;\n\nexport interface Greeting { pid: number; at: number; proof: string }\n\nexport function daemonSecretPath(dir: string): string {\n return join(dir, \"daemon.secret\");\n}\n\n/** HMAC-SHA256 over the role's domain and the nonce, hex: a daemon's proof is never a client's, nor one for another nonce. */\nexport function proof(secret: Buffer, role: \"daemon\" | \"client\" | \"greeting\", nonce: string): string {\n return createHmac(\"sha256\", secret).update(`ghostly-${role}:${nonce}`).digest(\"hex\");\n}\n\nexport function newNonce(): string {\n return randomBytes(16).toString(\"hex\");\n}\n\n/**\n * The daemon's: a new secret, 32 random bytes as hex, made 0600 (`wx`, so a file or link put there in the meantime is\n * an error, not something written through). The one a daemon before it left is removed first: whoever could have\n * read that one learns nothing about this one.\n */\nexport function newDaemonSecret(dir: string): Buffer {\n const file = daemonSecretPath(dir);\n rmSync(file, { force: true });\n const secret = randomBytes(32);\n const fd = openSync(file, \"wx\", 0o600);\n try { writeSync(fd, secret.toString(\"hex\") + \"\\n\"); } finally { closeSync(fd); }\n return secret;\n}\n\n/** The daemon's, when it stops: a greeting copied from it proves nothing once it is gone. */\nexport function removeDaemonSecret(dir: string): void {\n rmSync(daemonSecretPath(dir), { force: true });\n}\n\n/** The daemon's first line on every connection, before it has read anything. */\nexport function greeting(secret: Buffer, pid = process.pid, at = Date.now()): { greeting: Greeting } {\n return { greeting: { pid, at, proof: proof(secret, \"greeting\", `${pid}:${at}`) } };\n}\n\n/**\n * Whether `message` (the first line the client read) is the profile's daemon's greeting: proved with the secret, made\n * within `GREETING_WINDOW_MS` of `now`, by the process that holds the profile's lock, alive and one this user may\n * signal (`process.kill(pid, 0)`: EPERM on Unix for another user's; on Windows libuv opens the process to terminate\n * it, which another account's process normally denies). A greeting copied from a daemon that died fails on its pid,\n * unless a process this user may signal took that pid within the window.\n */\nexport function provesGreeting(secret: Buffer, dir: string, message: unknown, now = Date.now()): boolean {\n const given = (message as { greeting?: Partial<Greeting> } | null)?.greeting;\n if (!given || !Number.isSafeInteger(given.pid) || (given.pid as number) <= 0 || !Number.isSafeInteger(given.at)) return false;\n if (typeof given.proof !== \"string\" || !/^[0-9a-f]{64}$/.test(given.proof)) return false;\n const { pid, at } = given as Greeting;\n if (Math.abs(now - at) > GREETING_WINDOW_MS) return false;\n if (!timingSafeEqual(Buffer.from(given.proof, \"hex\"), Buffer.from(proof(secret, \"greeting\", `${pid}:${at}`), \"hex\"))) return false;\n return holdsProfile(dir, pid);\n}\n\n/**\n * Whether a daemon of this release holds the profile: its secret is there (an older release's never writes one, and a\n * daemon removes its own when it stops) and the lock's holder is alive and this user's. One whose greeting is late is\n * busy (its event loop held by one long task), not something else on its socket: the client waits for it.\n */\nexport function daemonOfThisRelease(dir: string): boolean {\n if (!readDaemonSecret(dir)) return false;\n let pid: number;\n try { pid = Number(readFileSync(lockPath(dir), \"utf8\").trim()); } catch { return false; }\n return Number.isSafeInteger(pid) && pid > 0 && holdsProfile(dir, pid);\n}\n\nfunction holdsProfile(dir: string, pid: number): boolean {\n try {\n if (readFileSync(lockPath(dir), \"utf8\").trim() !== String(pid)) return false;\n process.kill(pid, 0);\n return true;\n } catch { return false; }\n}\n\n/**\n * The client's: the secret the profile's daemon wrote, or null when there is none, or it is not a file of this user's\n * alone (a link, another user's file, one others may read): then it proves nothing. On Windows the file has the\n * folder's ACL (owner-only in the user's home); Node can check no more than that it is a plain file.\n */\nexport function readDaemonSecret(dir: string): Buffer | null {\n const file = daemonSecretPath(dir);\n try {\n const info = lstatSync(file);\n if (!info.isFile()) return null;\n if (process.platform !== \"win32\" && ((process.getuid && info.uid !== process.getuid()) || (info.mode & 0o077) !== 0)) return null;\n const text = readFileSync(file, \"utf8\").trim();\n return /^[0-9a-f]{64}$/.test(text) ? Buffer.from(text, \"hex\") : null;\n } catch { return null; }\n}\n\n/** Whether `answer` (the result of a `daemon.hello` with `nonce`) is the daemon's proof over it, in constant time. */\nexport function provesDaemon(secret: Buffer, nonce: string, answer: unknown): boolean {\n const given = (answer as { proof?: unknown } | null)?.proof;\n if (typeof given !== \"string\" || !/^[0-9a-f]{64}$/.test(given)) return false;\n return timingSafeEqual(Buffer.from(given, \"hex\"), Buffer.from(proof(secret, \"daemon\", nonce), \"hex\"));\n}\n"],"mappings":";;;;AAMA,IAAa,aAAa;CAAC;CAAM;CAAO;CAAO;CAAO;AAAK;AAE3D,IAAa,eAAyB;AAEtC,IAAa,gBAAgB,SAA4B,OAAA,KAAmB;AAC5E,IAAa,cAAc,SAA2B,aAAa,IAAI,IAAI;AAC3E,IAAa,aAAa,MAAgB,UAA0B,KAAK,MAAO,QAAQ,IAAI,OAAQ,GAAI;AAExG,SAAgB,WAAW,OAAmC;CAC5D,OAAO,WAAW,SAAS,KAAiB;AAC9C;;AAGA,IAAa,eAAe;;;;;AAY5B,IAAa,gBAAb,MAA2B;CAWJ;CAAiC;CAVtD,SAA2B,CAAC;CAC5B,OAAe;CACf,SAAiB;CACjB,WAAmB;CACnB;CACA;CACA;;CAEA,UAAU;CAEV,YAAY,MAAyB,MAAqC,KAAK,KAAK,QAAQ,cAAc;EAArF,KAAA,OAAA;EAAiC,KAAA,MAAA;EACpD,KAAK,QAAQ,WAAW,IAAI;EAE5B,KAAK,MAAM,KAAK,MAAO,OAAO,QAAS,GAAI,IAAI;EAC/C,KAAK,UAAU,OAAO,MAAM,KAAK,KAAK;CACxC;;CAGA,KAAK,OAAuB;EAC1B,IAAI,CAAC,MAAM,QAAQ,OAAO;EAC1B,KAAK,WAAW,KAAK,IAAI;EACzB,MAAM,OAAO,KAAK,MAAM,KAAK;EAC7B,MAAM,OAAO,MAAM,UAAU,OAAO,QAAQ,MAAM,SAAS,GAAG,KAAK,IAAI,GAAG,IAAI,CAAC;EAC/E,MAAM,OAAO,MAAM,SAAS,KAAK;EACjC,KAAK,WAAW;EAChB,IAAI,KAAK,QAAQ;GAAE,KAAK,OAAO,KAAK,OAAO,KAAK,IAAI,CAAC;GAAG,KAAK,UAAU,KAAK;EAAQ;EACpF,OAAO;CACT;;CAGA,IAAI,WAAmB;EACrB,OAAO,UAAU,KAAK,MAAM,KAAK,SAAU,KAAK,SAAS,CAAE;CAC7D;;CAGA,OAA2C;EACzC,IAAI,KAAK,UAAU,KAAK,OAAO,OAAO;GAAE,OAAO,KAAK,KAAK,KAAK,KAAK;GAAG,QAAQ;EAAM;EACpF,MAAM,QAAQ,KAAK,SAAU,KAAK,SAAS;EAC3C,IAAI,QAAQ,KAAK,KAAK,IAAI,IAAI,KAAK,YAAA,IAA6B;GAC9D,MAAM,QAAQ,OAAO,MAAM,KAAK,KAAK;GACrC,KAAK,KAAK,KAAK,CAAC,CAAC,KAAK,KAAK;GAC3B,OAAO;IAAE;IAAO,QAAQ;GAAM;EAChC;EACA,OAAO;GAAE,OAAO,KAAK;GAAS,QAAQ;EAAK;CAC7C;;CAGA,QAAgB;EACd,MAAM,KAAK,KAAK;EAChB,KAAK,SAAS,CAAC;EACf,KAAK,OAAO;EACZ,KAAK,SAAS;EACd,OAAO;CACT;;CAGA,KAAK,IAAoB;EACvB,MAAM,SAAS,KAAK,IAAI,KAAK,MAAM,KAAA,EAAa,GAAG,KAAK,MAAM,KAAK,SAAS,KAAK,KAAK,CAAC;EACvF,IAAI,SAAS,GAAG,KAAK,KAAK,SAAS,KAAK,KAAK;EAC7C,OAAO,KAAK,IAAI,GAAG,MAAM,IAAA;CAC3B;CAEA,KAAa,OAAuB;EAClC,MAAM,MAAM,OAAO,YAAY,KAAK;EACpC,IAAI,SAAS;EACb,OAAO,SAAS,OAAO;GACrB,MAAM,QAAQ,KAAK,OAAO;GAC1B,MAAM,IAAI,KAAK,IAAI,QAAQ,QAAQ,MAAM,SAAS,KAAK,IAAI;GAC3D,MAAM,KAAK,KAAK,QAAQ,KAAK,MAAM,KAAK,OAAO,CAAC;GAChD,UAAU;GACV,KAAK,QAAQ;GACb,IAAI,KAAK,SAAS,MAAM,QAAQ;IAAE,KAAK,OAAO,MAAM;IAAG,KAAK,OAAO;GAAG;EACxE;EACA,KAAK,UAAU;EACf,OAAO;CACT;AACF;;;;;;;;;;;;;;;;;ACzFA,IAAa,QAAQ;AAUrB,SAAgB,iBAAiB,KAAqB;CACpD,OAAO,KAAK,KAAK,eAAe;AAClC;;AAGA,SAAgB,MAAM,QAAgB,MAAwC,OAAuB;CACnG,OAAO,WAAW,UAAU,MAAM,CAAC,CAAC,OAAO,WAAW,KAAK,GAAG,OAAO,CAAC,CAAC,OAAO,KAAK;AACrF;AAEA,SAAgB,WAAmB;CACjC,OAAO,YAAY,EAAE,CAAC,CAAC,SAAS,KAAK;AACvC;;;;;;AAOA,SAAgB,gBAAgB,KAAqB;CACnD,MAAM,OAAO,iBAAiB,GAAG;CACjC,OAAO,MAAM,EAAE,OAAO,KAAK,CAAC;CAC5B,MAAM,SAAS,YAAY,EAAE;CAC7B,MAAM,KAAK,SAAS,MAAM,MAAM,GAAK;CACrC,IAAI;EAAE,UAAU,IAAI,OAAO,SAAS,KAAK,IAAI,IAAI;CAAG,UAAU;EAAE,UAAU,EAAE;CAAG;CAC/E,OAAO;AACT;;AAGA,SAAgB,mBAAmB,KAAmB;CACpD,OAAO,iBAAiB,GAAG,GAAG,EAAE,OAAO,KAAK,CAAC;AAC/C;;AAGA,SAAgB,SAAS,QAAgB,MAAM,QAAQ,KAAK,KAAK,KAAK,IAAI,GAA2B;CACnG,OAAO,EAAE,UAAU;EAAE;EAAK;EAAI,OAAO,MAAM,QAAQ,YAAY,GAAG,IAAI,GAAG,IAAI;CAAE,EAAE;AACnF;;;;;;;;AASA,SAAgB,eAAe,QAAgB,KAAa,SAAkB,MAAM,KAAK,IAAI,GAAY;CACvG,MAAM,QAAS,SAAqD;CACpE,IAAI,CAAC,SAAS,CAAC,OAAO,cAAc,MAAM,GAAG,KAAM,MAAM,OAAkB,KAAK,CAAC,OAAO,cAAc,MAAM,EAAE,GAAG,OAAO;CACxH,IAAI,OAAO,MAAM,UAAU,YAAY,CAAC,iBAAiB,KAAK,MAAM,KAAK,GAAG,OAAO;CACnF,MAAM,EAAE,KAAK,OAAO;CACpB,IAAI,KAAK,IAAI,MAAM,EAAE,IAAA,KAAwB,OAAO;CACpD,IAAI,CAAC,gBAAgB,OAAO,KAAK,MAAM,OAAO,KAAK,GAAG,OAAO,KAAK,MAAM,QAAQ,YAAY,GAAG,IAAI,GAAG,IAAI,GAAG,KAAK,CAAC,GAAG,OAAO;CAC7H,OAAO,aAAa,KAAK,GAAG;AAC9B;;;;;;AAOA,SAAgB,oBAAoB,KAAsB;CACxD,IAAI,CAAC,iBAAiB,GAAG,GAAG,OAAO;CACnC,IAAI;CACJ,IAAI;EAAE,MAAM,OAAO,aAAa,SAAS,GAAG,GAAG,MAAM,CAAC,CAAC,KAAK,CAAC;CAAG,QAAQ;EAAE,OAAO;CAAO;CACxF,OAAO,OAAO,cAAc,GAAG,KAAK,MAAM,KAAK,aAAa,KAAK,GAAG;AACtE;AAEA,SAAS,aAAa,KAAa,KAAsB;CACvD,IAAI;EACF,IAAI,aAAa,SAAS,GAAG,GAAG,MAAM,CAAC,CAAC,KAAK,MAAM,OAAO,GAAG,GAAG,OAAO;EACvE,QAAQ,KAAK,KAAK,CAAC;EACnB,OAAO;CACT,QAAQ;EAAE,OAAO;CAAO;AAC1B;;;;;;AAOA,SAAgB,iBAAiB,KAA4B;CAC3D,MAAM,OAAO,iBAAiB,GAAG;CACjC,IAAI;EACF,MAAM,OAAO,UAAU,IAAI;EAC3B,IAAI,CAAC,KAAK,OAAO,GAAG,OAAO;EAC3B,IAAI,QAAQ,aAAa,YAAa,QAAQ,UAAU,KAAK,QAAQ,QAAQ,OAAO,MAAO,KAAK,OAAO,QAAW,IAAI,OAAO;EAC7H,MAAM,OAAO,aAAa,MAAM,MAAM,CAAC,CAAC,KAAK;EAC7C,OAAO,iBAAiB,KAAK,IAAI,IAAI,OAAO,KAAK,MAAM,KAAK,IAAI;CAClE,QAAQ;EAAE,OAAO;CAAM;AACzB;;AAGA,SAAgB,aAAa,QAAgB,OAAe,QAA0B;CACpF,MAAM,QAAS,QAAuC;CACtD,IAAI,OAAO,UAAU,YAAY,CAAC,iBAAiB,KAAK,KAAK,GAAG,OAAO;CACvE,OAAO,gBAAgB,OAAO,KAAK,OAAO,KAAK,GAAG,OAAO,KAAK,MAAM,QAAQ,UAAU,KAAK,GAAG,KAAK,CAAC;AACtG"}
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"endpoint-BdaeBw2L.js","names":[],"sources":["../../../../native/transports/hyperdht/redial.mjs","../../../../native/transports/hyperdht/endpoint.mjs"],"sourcesContent":["/**\n * How long a HyperDHT dial whose stream opened may go without the contact's preface before it is dialled again.\n *\n * The first connection a freshly started process makes sometimes opens (the handshake went through the DHT and the\n * stream is connected to the right address) and then carries nothing: the contact never sees it, and UDX gives up\n * only after 13 s. A connection made again at once goes through in milliseconds. Found as a chat moved to HyperDHT\n * right after the contact's app restarted taking about 28 s in CI (the move's 8 s, then its 20 s retry), 1 run in 6;\n * reproduced with hyperdht alone under load (bug hunt r11h). On loopback the preface comes within milliseconds of\n * the stream opening, one round trip on the internet.\n */\nexport const PREFACE_WAIT_MS = 2000\n\n/**\n * The longest a stream that opened waits for the preface on a slow path: the 8 s a chat's move gives its dial. Past\n * it nobody is waiting for the dial made again, and UDX gives a silent stream up at 13 s anyway.\n */\nexport const PREFACE_MAX_WAIT_MS = 8000\n\n/**\n * How many of the stream's smoothed round trips the preface may take. A contact that waits for our first packet\n * before its side of the stream connects (we are behind a firewall) writes its preface one round trip after our\n * stream opened; a lost packet adds a retransmission timeout (at least one round trip more). Three keep a slow path's\n * preface from being dialled again for nothing (a fixed 2 s on a 3 s path made three dials) and leave every path\n * under 667 ms on the 2 s.\n */\nexport const RTT_FACTOR = 3\n\n/**\n * Before the stream has its first RTT sample, how many times the dial's own opening (from the dial to the stream\n * open) the preface may take. The opening is the DHT lookup plus the handshake through a DHT node, so it took at\n * least two round trips of the path, and the preface comes one round trip after the stream opened: once covers it\n * (on a 3 s path the first sample comes only 3 s after the stream opened, past the 2 s). It is not more because a\n * stalled stream never gets a sample, and its opening is mostly the lookup (1-3 s on the public DHT even for a near\n * contact): twice a 2.5 s opening would dial again only 7.5 s after the dial, past the move's 8 s once the second\n * dial's own opening is added. A dial that opened in milliseconds (loopback, a near contact) stays on the 2 s.\n */\nexport const OPENING_FACTOR = 1\n\n/**\n * The preface wait for a stream whose smoothed RTT is `rtt` ms and whose dial took `opening` ms to open: three round\n * trips once there is a sample, the opening itself before, between `floor` and `ceiling`.\n */\nexport function prefaceWait(rtt, opening = 0, floor = PREFACE_WAIT_MS, ceiling = PREFACE_MAX_WAIT_MS) {\n const wait = rtt > 0 ? RTT_FACTOR * rtt : OPENING_FACTOR * (opening || 0)\n return Math.min(ceiling, Math.max(floor, wait))\n}\n\n/**\n * At most this many dials for one `connect`: the first, and two more if they stalled, 2 s apart, all within the 8 s a\n * chat's move gives its dial. Under load a dial made again stalled too about once in 20 (bug hunt r11h).\n */\nexport const MAX_DIALS = 3\n\n/**\n * Dials with `dialOnce` until one brings the contact's preface. `dialOnce()` starts a connection and returns\n * `{ opened, ready, close }`: `opened` resolves true once the stream is open (the handshake is done), `ready` with the\n * bound channel once the contact's preface came, and `close()` drops it; `rtt()`, if given, is the stream's smoothed\n * RTT in ms so far, 0 before its first sample (UDX's `rawStream.rtt`). A dial that opened and brought no preface\n * within `waitMs`, or longer on a slow path (`prefaceWait`, at most `maxWaitMs`), is closed and made again, up to\n * `maxDials` in all. The RTT is read again whenever the wait would end, so a sample taken after the stream opened\n * counts. A dial that fails before it opened (the contact not found, refused) fails the whole connect at once, as\n * before: there is nothing to wait for.\n */\nexport function redial(dialOnce, { waitMs = PREFACE_WAIT_MS, maxWaitMs = PREFACE_MAX_WAIT_MS, maxDials = MAX_DIALS } = {}) {\n return new Promise((resolve, reject) => {\n let settled = false\n let dials = 0\n const attempt = () => {\n dials++\n const dialledAt = Date.now()\n const dial = dialOnce()\n let timer = null\n let stalled = false\n dial.opened.then(open => {\n if (!open || settled) return\n const openedAt = Date.now()\n const check = () => {\n if (settled) return\n const left = openedAt + prefaceWait(dial.rtt?.(), openedAt - dialledAt, waitMs, maxWaitMs) - Date.now()\n if (left > 0) { timer = setTimeout(check, left); return }\n if (dials >= maxDials) return\n stalled = true\n dial.close()\n attempt()\n }\n timer = setTimeout(check, waitMs)\n }, () => {})\n dial.ready.then(bound => {\n clearTimeout(timer)\n if (settled || stalled) { bound.channel.close(); return }\n settled = true\n resolve(bound)\n }, error => {\n clearTimeout(timer)\n // A dial closed here for stalling ends as closed: the next one carries the connect.\n if (settled || stalled) return\n settled = true\n reject(error)\n })\n }\n attempt()\n })\n}\n","import DHT from 'hyperdht'\nimport { redial } from './redial.mjs'\n\nexport const MAX_FRAME = 60 * 1024\n/** The top bit of a frame's length word: the frame is a binary message, not UTF-8 text (WISP 103). */\nconst BINARY = 0x80000000\nconst PREFACE = 'ghostly/paired-chat/1'\n/** How long a closing channel waits for what it sent last to go out before the stream is destroyed anyway. */\nconst CLOSE_FLUSH_MS = 300\n/**\n * Bytes a channel may hold before `send` throws: above what every sender here lets itself queue (the CLI's 1 MiB high\n * water mark and an app's quarter above it; the Desktop page, which stops a file once the sidecar says `full` past its\n * `SEND_ROOM`), so it trips only for one that ignores its own line.\n */\nconst MAX_BUFFERED = 2 * 1024 * 1024\n/**\n * `drained()` resolves once a channel holds no more than this: no more than the sidecar's `SEND_ROOM`, so its wait for\n * room never spins on a `drained()` that resolves at once.\n */\nconst DRAINED_AT = 64 * 1024\n/**\n * How often a wait in `drained()` looks again. Each stream says `drain` only once its own queue is empty, which on a fast\n * link comes first; on a slow one this finds the queue at `DRAINED_AT` before it runs dry.\n */\nconst DRAIN_POLL_MS = 10\n\n/**\n * What a connection's stream still holds: secret-stream's queue and the UDX stream's under it. Both are streamx\n * streams, which count it in `_writableState.buffered` (hyperdht is pinned; hyperdhtEndpointBuffered.test.ts reads it).\n * secret-stream has no `writableLength`: read from there, it was always 0.\n */\nfunction held(socket) {\n return (socket._writableState?.buffered ?? 0) + (socket.rawStream?._writableState?.buffered ?? 0)\n}\n\n/** Native UDP + NoiseSecretStream. The binding comes from the authenticated\n * stream itself, never from an application frame supplied by the other peer. */\nexport async function createHyperEndpoint(seed, options = {}) {\n if (!(seed instanceof Uint8Array) || seed.length !== 32) throw new Error('Invalid HyperDHT seed')\n const keyPair = DHT.keyPair(Buffer.from(seed))\n // A chat's listener is a DHT client for good: an adaptive node turns persistent after ~20 min wherever its UDP port is\n // reachable, and then joins the routing table and keeps strangers' records and values. Ephemeral, it still listens\n // (announced through other nodes) and holepunches.\n const node = new DHT({ ...options, keyPair, ephemeral: true })\n const channels = new Set()\n let stopped = false\n let incomingHandler = null\n const waiting = []\n const descriptor = { publicKey: keyPair.publicKey.toString('hex') }\n\n /** `onChannel`: hears the channel as soon as it counts against the limit (a dial that stalls is dropped from it). */\n async function attach(socket, onChannel) {\n if (stopped || channels.size >= 2) { socket.destroy(); throw new Error('Native connection limit reached') }\n let reader = null\n let closeHandler = null\n let closed = false\n let ending = null\n let pending = []\n let buffer = Buffer.alloc(0)\n let preface = false\n let resolveOpen, rejectOpen\n const ready = new Promise((resolve, reject) => { resolveOpen = resolve; rejectOpen = reject })\n const timer = setTimeout(() => { socket.destroy(new Error('HyperDHT handshake timed out')) }, 20000)\n const channel = {\n // It carries binary messages (WISP 100 § Text and binary messages): a capability that needs them may be offered.\n binary: true,\n get bufferedAmount() { return held(socket) },\n get onMessage() { return reader },\n set onMessage(value) { reader = value; if (value) for (const text of pending.splice(0)) value(text) },\n get onClose() { return closeHandler },\n set onClose(value) { closeHandler = value; if (closed) value?.() },\n send(data) {\n const binary = data instanceof Uint8Array\n if (closed || !(binary || typeof data === 'string') || !data.length || (binary ? data.length : Buffer.byteLength(data)) > MAX_FRAME || this.bufferedAmount > MAX_BUFFERED)\n throw new Error('Native channel is closed or exceeds its frame budget')\n const payload = binary ? Buffer.from(data.buffer, data.byteOffset, data.byteLength) : Buffer.from(data)\n const header = Buffer.alloc(4); header.writeUInt32BE((binary ? BINARY : 0) + payload.length)\n socket.write(Buffer.concat([header, payload]))\n },\n drained() {\n if (this.bufferedAmount <= DRAINED_AT) return Promise.resolve()\n if (closed) return Promise.reject(new Error('Native channel closed'))\n return new Promise((resolve, reject) => {\n const raw = socket.rawStream\n const check = () => { if (this.bufferedAmount <= DRAINED_AT) finish(resolve) }\n const gone = () => finish(() => reject(new Error('Native channel closed')))\n const poll = setInterval(check, DRAIN_POLL_MS)\n poll.unref?.()\n function finish(settle) {\n clearInterval(poll); socket.off('drain', check); raw?.off('drain', check); socket.off('close', gone); settle()\n }\n socket.on('drain', check); raw?.on('drain', check); socket.once('close', gone)\n })\n },\n // What was sent last (a goodbye, as an app stops) goes out before the stream ends: destroyed at once, it was\n // dropped unsent. A contact that never finishes the stream has CLOSE_FLUSH_MS.\n close() {\n if (closed || ending) return ending ?? Promise.resolve()\n ending = new Promise(resolve => { socket.once('close', resolve) })\n const timer = setTimeout(() => socket.destroy(), CLOSE_FLUSH_MS)\n timer.unref?.()\n socket.end()\n return ending\n },\n }\n channels.add(channel)\n onChannel?.(channel)\n socket.on('error', error => rejectOpen(error))\n // The contact ended its side (its channel closed): this one ends too, so the stream closes now, not on its timer.\n socket.on('end', () => socket.end())\n socket.on('close', () => {\n closed = true; pending = []; clearTimeout(timer); channels.delete(channel)\n rejectOpen(new Error('Native channel closed')); closeHandler?.()\n })\n const opened = () => {\n if (socket.handshakeHash?.length !== 64 || socket.publicKey?.length !== 32 || socket.remotePublicKey?.length !== 32) {\n socket.destroy(new Error('Noise session binding unavailable')); return\n }\n channel.send(PREFACE)\n }\n socket.on('data', chunk => {\n // Secretstream chunks are bounded by its record layer. Process all frames\n // before retaining a partial one; never allocate based on an unchecked size.\n buffer = Buffer.concat([buffer, chunk])\n while (buffer.length >= 4) {\n const word = buffer.readUInt32BE(0)\n const binary = word >= BINARY, length = word % BINARY\n // A binary frame before the preface is another protocol.\n if (length === 0 || length > MAX_FRAME || (binary && !preface)) { socket.destroy(new Error('Invalid frame length')); return }\n if (buffer.length < 4 + length) break\n let text\n if (binary) text = new Uint8Array(buffer.subarray(4, 4 + length))\n else {\n try { text = new TextDecoder('utf-8', { fatal: true }).decode(buffer.subarray(4, 4 + length)) }\n catch { socket.destroy(new Error('Invalid UTF-8 frame')); return }\n }\n buffer = buffer.subarray(4 + length)\n if (!preface) {\n if (text !== PREFACE) { socket.destroy(new Error('Unexpected application protocol')); return }\n preface = true; clearTimeout(timer)\n resolveOpen({ channel, binding: { transport: 'hyperdht/1', context: socket.handshakeHash.toString('hex'),\n identities: [socket.publicKey.toString('hex'), socket.remotePublicKey.toString('hex')].sort() } })\n } else if (reader) reader(text)\n else if (pending.length < 64) pending.push(text)\n else { socket.destroy(new Error('Receive queue exceeded')); return }\n }\n })\n void socket.opened.then(ok => { if (ok) opened(); else rejectOpen(new Error('Noise handshake failed')) })\n return ready\n }\n\n const server = node.createServer(socket => {\n void attach(socket).then(bound => {\n if (stopped) bound.channel.close()\n else if (incomingHandler) incomingHandler(bound)\n else waiting.push(bound)\n }).catch(() => {})\n })\n try { await server.listen(keyPair) }\n catch (error) { await node.destroy(); throw error }\n return {\n transport: 'hyperdht/1', descriptor, onDescriptor: null,\n get onConnection() { return incomingHandler },\n set onConnection(value) { incomingHandler = value; if (value) for (const bound of waiting.splice(0)) value(bound) },\n async connect(address) {\n if (stopped || !address || !/^[a-f0-9]{64}$/.test(address.publicKey)) throw new Error('Invalid HyperDHT endpoint')\n const remote = Buffer.from(address.publicKey, 'hex')\n // A dial whose stream opened and carried nothing is made again (`redial.mjs`): it is dropped from the limit at\n // once, so the next one has its place even while another channel is live. The wait follows the stream's RTT.\n return redial(() => {\n const socket = node.connect(remote, { keyPair })\n let counted = null\n const ready = attach(socket, channel => { counted = channel })\n return { opened: socket.opened, ready, rtt: () => socket.rawStream?.rtt ?? 0,\n close() { if (counted) channels.delete(counted); socket.destroy() } }\n })\n },\n // The channels end first (their last frames out, CLOSE_FLUSH_MS at most): the node's socket goes with it.\n async close() { stopped = true; const ended = [...channels].map(channel => channel.close()); waiting.length = 0; await Promise.all(ended); await server.close(); await node.destroy() },\n }\n}\n"],"mappings":";;;;;;;;;;;;AAUA,IAAa,kBAAkB;;;;;AAM/B,IAAa,sBAAsB;;;;;AA0BnC,SAAgB,YAAY,KAAK,UAAU,GAAG,QAAQ,iBAAiB,UAAU,qBAAqB;CACpG,MAAM,OAAO,MAAM,IAAA,IAAiB,MAAA,KAAwB,WAAW;CACvE,OAAO,KAAK,IAAI,SAAS,KAAK,IAAI,OAAO,IAAI,CAAC;AAChD;;;;;;;;;;;AAkBA,SAAgB,OAAO,UAAU,EAAE,SAAS,iBAAiB,YAAY,qBAAqB,WAAA,MAAyB,CAAC,GAAG;CACzH,OAAO,IAAI,SAAS,SAAS,WAAW;EACtC,IAAI,UAAU;EACd,IAAI,QAAQ;EACZ,MAAM,gBAAgB;GACpB;GACA,MAAM,YAAY,KAAK,IAAI;GAC3B,MAAM,OAAO,SAAS;GACtB,IAAI,QAAQ;GACZ,IAAI,UAAU;GACd,KAAK,OAAO,MAAK,SAAQ;IACvB,IAAI,CAAC,QAAQ,SAAS;IACtB,MAAM,WAAW,KAAK,IAAI;IAC1B,MAAM,cAAc;KAClB,IAAI,SAAS;KACb,MAAM,OAAO,WAAW,YAAY,KAAK,MAAM,GAAG,WAAW,WAAW,QAAQ,SAAS,IAAI,KAAK,IAAI;KACtG,IAAI,OAAO,GAAG;MAAE,QAAQ,WAAW,OAAO,IAAI;MAAG;KAAO;KACxD,IAAI,SAAS,UAAU;KACvB,UAAU;KACV,KAAK,MAAM;KACX,QAAQ;IACV;IACA,QAAQ,WAAW,OAAO,MAAM;GAClC,SAAS,CAAC,CAAC;GACX,KAAK,MAAM,MAAK,UAAS;IACvB,aAAa,KAAK;IAClB,IAAI,WAAW,SAAS;KAAE,MAAM,QAAQ,MAAM;KAAG;IAAO;IACxD,UAAU;IACV,QAAQ,KAAK;GACf,IAAG,UAAS;IACV,aAAa,KAAK;IAElB,IAAI,WAAW,SAAS;IACxB,UAAU;IACV,OAAO,KAAK;GACd,CAAC;EACH;EACA,QAAQ;CACV,CAAC;AACH;;;ACnGA,IAAa,YAAY;;AAEzB,IAAM,SAAS;AACf,IAAM,UAAU;;AAEhB,IAAM,iBAAiB;;;;;;AAMvB,IAAM,eAAe;;;;;AAKrB,IAAM,aAAa;;;;;AAKnB,IAAM,gBAAgB;;;;;;AAOtB,SAAS,KAAK,QAAQ;CACpB,QAAQ,OAAO,gBAAgB,YAAY,MAAM,OAAO,WAAW,gBAAgB,YAAY;AACjG;;;AAIA,eAAsB,oBAAoB,MAAM,UAAU,CAAC,GAAG;CAC5D,IAAI,EAAE,gBAAgB,eAAe,KAAK,WAAW,IAAI,MAAM,IAAI,MAAM,uBAAuB;CAChG,MAAM,UAAU,IAAI,QAAQ,OAAO,KAAK,IAAI,CAAC;CAI7C,MAAM,OAAO,IAAI,IAAI;EAAE,GAAG;EAAS;EAAS,WAAW;CAAK,CAAC;CAC7D,MAAM,2BAAW,IAAI,IAAI;CACzB,IAAI,UAAU;CACd,IAAI,kBAAkB;CACtB,MAAM,UAAU,CAAC;CACjB,MAAM,aAAa,EAAE,WAAW,QAAQ,UAAU,SAAS,KAAK,EAAE;;CAGlE,eAAe,OAAO,QAAQ,WAAW;EACvC,IAAI,WAAW,SAAS,QAAQ,GAAG;GAAE,OAAO,QAAQ;GAAG,MAAM,IAAI,MAAM,iCAAiC;EAAE;EAC1G,IAAI,SAAS;EACb,IAAI,eAAe;EACnB,IAAI,SAAS;EACb,IAAI,SAAS;EACb,IAAI,UAAU,CAAC;EACf,IAAI,SAAS,OAAO,MAAM,CAAC;EAC3B,IAAI,UAAU;EACd,IAAI,aAAa;EACjB,MAAM,QAAQ,IAAI,SAAS,SAAS,WAAW;GAAE,cAAc;GAAS,aAAa;EAAO,CAAC;EAC7F,MAAM,QAAQ,iBAAiB;GAAE,OAAO,wBAAQ,IAAI,MAAM,8BAA8B,CAAC;EAAE,GAAG,GAAK;EACnG,MAAM,UAAU;GAEd,QAAQ;GACR,IAAI,iBAAiB;IAAE,OAAO,KAAK,MAAM;GAAE;GAC3C,IAAI,YAAY;IAAE,OAAO;GAAO;GAChC,IAAI,UAAU,OAAO;IAAE,SAAS;IAAO,IAAI,OAAO,KAAK,MAAM,QAAQ,QAAQ,OAAO,CAAC,GAAG,MAAM,IAAI;GAAE;GACpG,IAAI,UAAU;IAAE,OAAO;GAAa;GACpC,IAAI,QAAQ,OAAO;IAAE,eAAe;IAAO,IAAI,QAAQ,QAAQ;GAAE;GACjE,KAAK,MAAM;IACT,MAAM,SAAS,gBAAgB;IAC/B,IAAI,UAAU,EAAE,UAAU,OAAO,SAAS,aAAa,CAAC,KAAK,WAAW,SAAS,KAAK,SAAS,OAAO,WAAW,IAAI,KAAA,SAAkB,KAAK,iBAAiB,cAC3J,MAAM,IAAI,MAAM,sDAAsD;IACxE,MAAM,UAAU,SAAS,OAAO,KAAK,KAAK,QAAQ,KAAK,YAAY,KAAK,UAAU,IAAI,OAAO,KAAK,IAAI;IACtG,MAAM,SAAS,OAAO,MAAM,CAAC;IAAG,OAAO,eAAe,SAAS,SAAS,KAAK,QAAQ,MAAM;IAC3F,OAAO,MAAM,OAAO,OAAO,CAAC,QAAQ,OAAO,CAAC,CAAC;GAC/C;GACA,UAAU;IACR,IAAI,KAAK,kBAAkB,YAAY,OAAO,QAAQ,QAAQ;IAC9D,IAAI,QAAQ,OAAO,QAAQ,uBAAO,IAAI,MAAM,uBAAuB,CAAC;IACpE,OAAO,IAAI,SAAS,SAAS,WAAW;KACtC,MAAM,MAAM,OAAO;KACnB,MAAM,cAAc;MAAE,IAAI,KAAK,kBAAkB,YAAY,OAAO,OAAO;KAAE;KAC7E,MAAM,aAAa,aAAa,uBAAO,IAAI,MAAM,uBAAuB,CAAC,CAAC;KAC1E,MAAM,OAAO,YAAY,OAAO,aAAa;KAC7C,KAAK,QAAQ;KACb,SAAS,OAAO,QAAQ;MACtB,cAAc,IAAI;MAAG,OAAO,IAAI,SAAS,KAAK;MAAG,KAAK,IAAI,SAAS,KAAK;MAAG,OAAO,IAAI,SAAS,IAAI;MAAG,OAAO;KAC/G;KACA,OAAO,GAAG,SAAS,KAAK;KAAG,KAAK,GAAG,SAAS,KAAK;KAAG,OAAO,KAAK,SAAS,IAAI;IAC/E,CAAC;GACH;GAGA,QAAQ;IACN,IAAI,UAAU,QAAQ,OAAO,UAAU,QAAQ,QAAQ;IACvD,SAAS,IAAI,SAAQ,YAAW;KAAE,OAAO,KAAK,SAAS,OAAO;IAAE,CAAC;IAEjE,iBAD+B,OAAO,QAAQ,GAAG,cAC7C,CAAC,CAAC,QAAQ;IACd,OAAO,IAAI;IACX,OAAO;GACT;EACF;EACA,SAAS,IAAI,OAAO;EACpB,YAAY,OAAO;EACnB,OAAO,GAAG,UAAS,UAAS,WAAW,KAAK,CAAC;EAE7C,OAAO,GAAG,aAAa,OAAO,IAAI,CAAC;EACnC,OAAO,GAAG,eAAe;GACvB,SAAS;GAAM,UAAU,CAAC;GAAG,aAAa,KAAK;GAAG,SAAS,OAAO,OAAO;GACzE,2BAAW,IAAI,MAAM,uBAAuB,CAAC;GAAG,eAAe;EACjE,CAAC;EACD,MAAM,eAAe;GACnB,IAAI,OAAO,eAAe,WAAW,MAAM,OAAO,WAAW,WAAW,MAAM,OAAO,iBAAiB,WAAW,IAAI;IACnH,OAAO,wBAAQ,IAAI,MAAM,mCAAmC,CAAC;IAAG;GAClE;GACA,QAAQ,KAAK,OAAO;EACtB;EACA,OAAO,GAAG,SAAQ,UAAS;GAGzB,SAAS,OAAO,OAAO,CAAC,QAAQ,KAAK,CAAC;GACtC,OAAO,OAAO,UAAU,GAAG;IACzB,MAAM,OAAO,OAAO,aAAa,CAAC;IAClC,MAAM,SAAS,QAAQ,QAAQ,SAAS,OAAO;IAE/C,IAAI,WAAW,KAAK,SAAA,SAAuB,UAAU,CAAC,SAAU;KAAE,OAAO,wBAAQ,IAAI,MAAM,sBAAsB,CAAC;KAAG;IAAO;IAC5H,IAAI,OAAO,SAAS,IAAI,QAAQ;IAChC,IAAI;IACJ,IAAI,QAAQ,OAAO,IAAI,WAAW,OAAO,SAAS,GAAG,IAAI,MAAM,CAAC;SAE9D,IAAI;KAAE,OAAO,IAAI,YAAY,SAAS,EAAE,OAAO,KAAK,CAAC,CAAC,CAAC,OAAO,OAAO,SAAS,GAAG,IAAI,MAAM,CAAC;IAAE,QACxF;KAAE,OAAO,wBAAQ,IAAI,MAAM,qBAAqB,CAAC;KAAG;IAAO;IAEnE,SAAS,OAAO,SAAS,IAAI,MAAM;IACnC,IAAI,CAAC,SAAS;KACZ,IAAI,SAAS,SAAS;MAAE,OAAO,wBAAQ,IAAI,MAAM,iCAAiC,CAAC;MAAG;KAAO;KAC7F,UAAU;KAAM,aAAa,KAAK;KAClC,YAAY;MAAE;MAAS,SAAS;OAAE,WAAW;OAAc,SAAS,OAAO,cAAc,SAAS,KAAK;OACrG,YAAY,CAAC,OAAO,UAAU,SAAS,KAAK,GAAG,OAAO,gBAAgB,SAAS,KAAK,CAAC,CAAC,CAAC,KAAK;MAAE;KAAE,CAAC;IACrG,OAAO,IAAI,QAAQ,OAAO,IAAI;SACzB,IAAI,QAAQ,SAAS,IAAI,QAAQ,KAAK,IAAI;SAC1C;KAAE,OAAO,wBAAQ,IAAI,MAAM,wBAAwB,CAAC;KAAG;IAAO;GACrE;EACF,CAAC;EACD,OAAY,OAAO,MAAK,OAAM;GAAE,IAAI,IAAI,OAAO;QAAQ,2BAAW,IAAI,MAAM,wBAAwB,CAAC;EAAE,CAAC;EACxG,OAAO;CACT;CAEA,MAAM,SAAS,KAAK,cAAa,WAAU;EACzC,OAAY,MAAM,CAAC,CAAC,MAAK,UAAS;GAChC,IAAI,SAAS,MAAM,QAAQ,MAAM;QAC5B,IAAI,iBAAiB,gBAAgB,KAAK;QAC1C,QAAQ,KAAK,KAAK;EACzB,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;CACnB,CAAC;CACD,IAAI;EAAE,MAAM,OAAO,OAAO,OAAO;CAAE,SAC5B,OAAO;EAAE,MAAM,KAAK,QAAQ;EAAG,MAAM;CAAM;CAClD,OAAO;EACL,WAAW;EAAc;EAAY,cAAc;EACnD,IAAI,eAAe;GAAE,OAAO;EAAgB;EAC5C,IAAI,aAAa,OAAO;GAAE,kBAAkB;GAAO,IAAI,OAAO,KAAK,MAAM,SAAS,QAAQ,OAAO,CAAC,GAAG,MAAM,KAAK;EAAE;EAClH,MAAM,QAAQ,SAAS;GACrB,IAAI,WAAW,CAAC,WAAW,CAAC,iBAAiB,KAAK,QAAQ,SAAS,GAAG,MAAM,IAAI,MAAM,2BAA2B;GACjH,MAAM,SAAS,OAAO,KAAK,QAAQ,WAAW,KAAK;GAGnD,OAAO,aAAa;IAClB,MAAM,SAAS,KAAK,QAAQ,QAAQ,EAAE,QAAQ,CAAC;IAC/C,IAAI,UAAU;IACd,MAAM,QAAQ,OAAO,SAAQ,YAAW;KAAE,UAAU;IAAQ,CAAC;IAC7D,OAAO;KAAE,QAAQ,OAAO;KAAQ;KAAO,WAAW,OAAO,WAAW,OAAO;KACzE,QAAQ;MAAE,IAAI,SAAS,SAAS,OAAO,OAAO;MAAG,OAAO,QAAQ;KAAE;IAAE;GACxE,CAAC;EACH;EAEA,MAAM,QAAQ;GAAE,UAAU;GAAM,MAAM,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC,KAAI,YAAW,QAAQ,MAAM,CAAC;GAAG,QAAQ,SAAS;GAAG,MAAM,QAAQ,IAAI,KAAK;GAAG,MAAM,OAAO,MAAM;GAAG,MAAM,KAAK,QAAQ;EAAE;CACxL;AACF"}
|