i.SrSSKrSSKJr SSKJr SSKJrJrJ r J r SSK J r "SS\5r \"S S 55r/S Qr/S Qr/S Qr/SQr0SS_SS_SS_SS_SS_SS_SS_SS_SS_SS_SS_SS_SS_SS_SS_S S_S!S_0S"S_S#S_S$S_S%S_S&S'_S(S'_S)S'_S*S'_S+S'_S,S'_S-S'_S.S'_S/S'_S0S1_S2S1_S3S1_S4S1_Er\ R(S5\ R*S6\ R,S7\ R.S8\ R0S7\ R2S9\ R4S90r"S:S;5r\S<:XaSSKr\"5r/S=Qr \!"\RD5S':a6S>RG\RDS'S5r$\%"\RM\$55 g\%"S?5 \ HDr$\RO\$5r(\RS\$5r*\%"S@\(RVSASB\*SC\$SSD35 MF gg)Eud GENESIS TASK ROUTER ==================== Classifies incoming tasks and routes them to the optimal executor. Routing table: Simple file/text ops → Claude Haiku (cost: ~$0.001) Standard implementation → Claude Sonnet (cost: ~$0.01) Complex reasoning/arch → Claude Opus (cost: ~$0.10) Bulk parallel execution → Gemini Swarm (cost: ~$0.002/task) 100-agent parallelism → Kimi K2.5 (cost: minimal) Browser automation → Playwright MCP (cost: 0) Memory read/write → RLM Bloodstream (cost: 0) Research/intelligence → Research Scout (Haiku) Decision logic: 1. Check for browser keywords → Playwright MCP 2. Check for memory keywords → RLM 3. Estimate complexity score → select model tier 4. If bulk/parallel → Gemini swarm or Kimi 5. Otherwise → Claude tier based on complexity Usage: from core.task_router import TaskRouter router = TaskRouter() executor = router.classify_and_route("implement feature X") explanation = router.explain_routing("implement feature X") N) dataclass)Enum)DictListOptionalTuple)Pathc0\rSrSrSrSrSrSrSrSr Sr S r g ) ExecutorType' claude-opus claude-sonnet claude-haiku gemini-swarmkimi-k2 playwrightrlmN) __name__ __module__ __qualname____firstlineno__ CLAUDE_OPUS CLAUDE_SONNET CLAUDE_HAIKU GEMINI_SWARMKIMI_K2 PLAYWRIGHTRLM_BLOODSTREAM__static_attributes__r%E:\genesis-system\core\task_router.pyr r 's%K#M!L!LGJOr!r cV\rSrSr%\\S'\\S'\\S'\\S'\\S'Sr \\S'S r g ) RoutingDecision1executor confidencecomplexity_scorereasonestimated_cost_usdparallel_workersrN) rrrrr __annotations__floatintstrr,r rr!r"r$r$1s* Kcr!r$)loginclickbrowserrnavigatez form fillwebsitewebpageportal dashboardghlz telnyx portal cloudflarez stripe portalscroll screenshotdom authenticatezsign inz open browserzweb automation) memoryr bloodstreamrememberrecallzknowledge graphz kg entityaxiomz titan memoryzsession contextsunaiva) researchfindsearchdiscoverscoutexplorez gather intel investigatezwhat iszwho iszanalyze market) swarmparallelbatchz 100 agentskimizfan outmultiplez all domainsbulkmassfleetscale architect orchestratdesignrefactorsecurity cryptographoptimizestrategyz multi-agent distributed implementbuildcreatedevelop integratepipelinesystemapidatabaseasync concurrentupdater+fixaddwritelistshowreadformatrenamewhatwhenwheresimpleg333333?g{Gz?gMbP?g~jth?gc \rSrSrSrSS\S\S\S\4SjjrSS\S\S\4Sjjr SS\S\S\S\ 4S jjr SS\S \S\ 4S jjr S \S \\S\4SjrS\\\44SjrS\\S\\\\44SjrSrg) TaskRouterraE Classifies and routes Genesis tasks to the optimal executor. Implements RULE 9 (Native-First) and RULE 10 (Capability-First): - Always checks if a simpler/cheaper executor can do the job - Prefers browser automation over asking Kinan - Prefers Gemini swarm for bulk work - Uses Claude Opus only for genuine reasoning tasks taskcomplexity_hintforce_parallelreturnc>URXU5nUR$)z Main routing method. Returns the optimal ExecutorType. Args: task: Natural language task description complexity_hint: "low", "medium", "high", "auto" force_parallel: If True, prefer swarm/Kimi for parallelism )_make_routing_decisionr&)selfr|r}r~decisions r"classify_and_routeTaskRouter.classify_and_route}s"..tnU   r!c URX5nSURRSURSURSSUR SSUR SUR3 $) z7Returns human-readable explanation of routing decision.z Executor: z Complexity: z/10 Confidence: z.0%z Est. Cost: $z.4fz Workers: z Reason: )rr&valuer(r'r*r,r))rr|r}rs r"explain_routingTaskRouter.explain_routings..tE**0012#4456#..s34#66s;< 1123'  ) r!c UR5nURU[5(a0[[R SSS[ [R S9$URU[5(a0[[RSSS[ [RS9$URU[5(dU(atSU;d S U;dS U;a1[[RS S S [ [RSS9$[[RSSS[ [RSS9$URU[5(a6US:Xa0[[RSSS[ [RS9$URX5nUS:a4[[RS USUS3[ [RS9$US :a4[[R SUSUS3[ [R S9$[[RSUSUS3[ [RS9$)zCore routing logic.gffffff?rVuFBrowser keywords detected — Playwright MCP handles this autonomously)r&r'r(r)r*g?r`u4Memory/KG operation — RLM bloodstream handles this100rSrOg333333?u@Massive parallel scale detected — Kimi K2.5 swarm (100 agents)d)r&r'r(r)r*r,u8Bulk/parallel work — Gemini swarm executes in parallel lowg?uNResearch/discovery task — Haiku research-scout handles this cost-effectivelyzHigh complexity (u*/10) — Opus required for reasoning depthg)\(?zMedium complexity (u+/10) — Sonnet handles implementation wellgq= ףp?zLow complexity (u#/10) — Haiku is cost-optimal here)lower _matches_anyBROWSER_KEYWORDSr$r rCOST_ESTIMATESMEMORY_KEYWORDSr BULK_KEYWORDSrrRESEARCH_KEYWORDSr_estimate_complexityrr)rr|r}r~ task_lower complexitys r"r!TaskRouter._make_routing_decisions7ZZ\    Z)9 : :"%00!"_#1,2I2I#J     Z 9 9"%55!"M#1,2N2N#O     Z 7 7> "g&;v?S&)11#%&]'5l6J6J'K%( #%22!"Q#1,2K2K#L!#     Z): ; ;SX@X"%22!"g#1,2K2K#L  ..tE ?"%11!+*:,6`a#1,2J2J#K  1_"%33!+,ZL8cd#1,2L2L#M  #%22!+)*5XY#1,2K2K#L  r!hintc^ US:XagUS:XagUS:XagUR5m Sn[R5HupEUT ;dM X5- nM [UR 55nUS:aUS- nO US :aUS - n/S Qn[ U 4S jU55nU[ US5- n[S [ S U55$)zU Score task complexity on 1-10 scale. Uses keyword signals + length + hint override. highrr`mediumrrVr2r+)firstthenfinallyalsozand thenstepc36># UHoT;dM Sv M g7f)r+Nr).0srs r" 2TaskRouter._estimate_complexity..sGOqJOs  r)rCOMPLEXITY_SIGNALSitemslensplitsumminmax) rr|rscorekeywordpoints word_countstep_indicators step_countrs @r"rTaskRouter._estimate_complexitys 6> 5= 8 ZZ\  2779OG*$ : &   QJE "_ QJESGOGG  Z##1c"en%%r!textkeywordsc.^[U4SjU55$)z-Check if text contains any keyword from list.c3,># UH oT;v M g7f)Nr)rkwrs r"r*TaskRouter._matches_any..s1":s)any)rrrs ` r"rTaskRouter._matches_anys1111r!cSSSSSSSS.$) z;Returns the full routing table for documentation/debugging.rrrrr rr)zbrowser/portal/loginzmemory/kg/rlm/bloodstreamzbulk/swarm/parallel/batchz100-agent/fleet/kimizcomplexity 7-10zcomplexity 4-6zcomplexity 1-3r)rs r"get_routing_tableTaskRouter.get_routing_tables#%1).)7$-,-,  r!taskscRUVs/sHo"URU54PM sn$s snf)z9Route a batch of tasks, returning (task, executor) pairs.)r)rrr|s r" batch_routeTaskRouter.batch_route$s(BGH%$t..t45%HHHs$rN)autoF)r)rrrr__doc__r0boolr rrr$rr/rrrrrrrr rr!r"rzrzrs &$ !!! !  !"  C  #  3   &$ VVV V  Vp & &C &S &D22S 2d2  4S>  IcItE#|:K4L/MIr!rz__main__)z-Login to GHL and activate the review workflowz0Remember this axiom: always check existing firstz:Implement the voice agent registration endpoint in FastAPIzDDesign the multi-agent orchestration architecture for ReceptionistAIz4Batch scrape 500 tradie businesses from Yellow Pagesz!What is the capital of Australia?z4Research Telnyx pricing for Australian phone numbers u+Genesis Task Router — Routing Table Demo z [20sz] (complexity=z) <),rre dataclassesrenumrtypingrrrrpathlibr r r$rrrrrrrrrrrrrrzrsysrouter test_tasksrargvjoinr|printrrr&rrrrr!r"rs< !..4      !%-q2%49+N O)r!