Hate

LilMGenius/paperthin/skills/depth/hate

作者 LilMGenius7d5dc6235990230e45a24a25c527d81701da5458无许可证收录于 2026年10月9日更新于 2026年10月9日

Attack a plan, design, or argument like you want it to fail before you commit real effort — return the single load-bearing objection and the cheapest experiment that would prove it matters, not a checklist. User-invoked on purpose: a hate-it reflex always in the agent's reach would bias it toward demolition. Weighs many failure axes but owns the synthesis to one root.

AI 生成的概览

攻击计划或论证,找出唯一的承重异议,以及能验证它的最低成本实验。

功能
该技能接收计划、设计或论证,刻意攻击其承重结构,而不是提出改进建议。它找出整个计划所依赖的假设,从虚假事实、虚构叙事、错误类比、依赖尚未出现的结果、数据泄漏和统计功效等失效维度进行攻击,再把发现收敛为一个根本异议。它还会给出第一颗钉子:对该假设最便宜的证伪方式,并以 root 与 first_nail 的形式返回,而不是清单。
适用场景
在为一个计划、设计或论证投入真实精力之前使用,适合想要敌意式预演而非鼓励的场合。它适用于一个致命缺陷比一长串担忧更重要的决策,也适用于可以用低成本早期测试提前排除昂贵方案的情况。
运行要求
无需脚本、软件包或凭据;这是仅含说明、由用户主动调用的技能。

Refuse to be nice to the plan — return the one objection that could kill it and the cheapest shot that proves it matters.

Goal

hate asks "what would someone who wants this to fail attack first?" (validity). It attacks the whole plan — not one fact or one line, but the load-bearing structure — and collapses the attack to a single root. The highest-value output is never a checklist — it's one objection plus the cheaper experiment hiding inside the elaborate plan.

Workflow

  1. Pin the load-bearing assumption(s) — what must hold for the whole thing to stand.
  2. Attack on whatever axes apply — the general ones first: a load-bearing fact that may be false, confabulation (a post-hoc story treated as ground truth), analogy-mistaken-for-isomorphism (structure assumed to transfer across domains where it doesn't), future-tense suture (the argument leans on a result that doesn't exist yet), and the sharpest — cites a principle but implements its opposite; and for empirical / research plans, leakage (no external ground-truth enters the validation independently) and statistical power / family-wise α (a true hypothesis auto-failing from uncorrected tests; a near-zero-power condition that rubber-stamps regardless of truth).
  3. Collapse the findings to the single root objection — the one whose failure makes the others moot.
  4. Find the first nail — the cheapest falsification of the load-bearing assumption: the check (in time / cost / sample) that could kill it before the expensive program runs.
  5. Return { root, first_nail } — not a list.

Rules

  • Attack, don't improve — improving is a different reflex.
  • Own the synthesis — many axes may fire, but collapse them to the single load-bearing root; return that, never a list.

Verification

Before finishing:

  1. The root is genuinely load-bearing — the plan falls without it.
  2. The first nail is genuinely cheaper than the plan it would pre-empt.

来源与署名

来源:LilMGenius/paperthin位于skills/depth/hate提交7d5dc62

许可证: 无许可证

内容归原作者所有。SourceWeft 从公开仓库中收录这些内容。

举报或申请下架