Token导航 LogoToken导航

Agent Skill · 前端设计

dag-convergence-monitor(dag 收敛监视器)

用于辅助前端页面、组件、样式和交互逻辑的开发与维护。它适合让 Agent 生成或审查 React、Next.js、Vue、Tailwind、CSS 等相关代码,整理组件结构,或定位布局和性能问题。使用时需要结合项目现有设计系统、路由和构建方式,避免只生成孤立片段;涉及页面改动时,应配合本地预览和构建检查确认视觉效果。

dag-convergence-monitor 是前端设计类 Agent Skill,可用宿主为 Codex、Claude、Cursor、Gemini CLI,通过GitHub 仓库获取,权限为权限未标注;许可证为 MIT,第三方扫描已通过,按安装量在前端设计类的 10,216 个 Skill 里排第 6,576。

总安装 489周安装 21GitHub Stars 98下载 171核验 2026-05-01

安装说明

本站只整理中文说明,不托管安装包,也不代用户安装。
GitHub
许可证
MIT

安装方式

通过对话安装

复制提示词发给支持本地命令或 Skills 的 AI 助手,先确认命令和权限,再让它执行。

请帮我安装这个 Agent Skill:dag-convergence-monitor(dag 收敛监视器)
来源仓库:https://github.com/erichowens/some_claude_skills
仓库路径:skills/dag-convergence-monitor
安装命令:
npx skills add https://github.com/erichowens/some_claude_skills --skill dag-convergence-monitor
安装前请先检查当前环境是否支持对应 CLI,并向我确认将要执行的命令、安装目录、联网范围和文件读写权限;确认后再执行。

命令行安装

复制命令到本机终端执行。不同来源提供的安装方式可能略有差异;本站展示可直接复制的安装命令,安装前请核对来源页面。

skills.shnpx skills
npx skills add https://github.com/erichowens/some_claude_skills --skill dag-convergence-monitor

这个 Skill 是做什么的

前端设计类 Skill 关注页面结构、视觉规范和组件写法,输出通常是可运行的界面代码。

dag-convergence-monitor 跟踪迭代过程的质量趋势并预测收敛时机。分析改进速率、检测平台期并计算达到目标的置信区间。基于预设停止准则决定是否继续迭代或接受当前结果。适用于需要自动化终止条件的复杂问题求解场景。

dag-convergence-monitor 属于前端设计类 Skill,可作为该场景下的辅助能力补充。提供可视化质量曲线和历史对比以帮助决策判断。

来源仓库内路径:skills/dag-convergence-monitor

上手步骤

4 步
  1. 1

    确认自己的宿主工具

    公开资料标注支持 Codex、Claude、Cursor、Gemini CLI;先确认自己用的是其中之一,再按对应工具的 Skills 目录放置。

  2. 2

    拿到安装命令

    可以直接复制的命令是 npx skills add https://github.com/erichowens/some_claude_skills --skill dag-conv…;命令里的占位符换成自己的路径或密钥再执行。

  3. 3

    安装后重启宿主

    命令执行完要完全退出宿主工具再打开,让新装的 Skill 被重新扫描到,否则列表里可能看不到。

  4. 4

    按最小权限试用

    权限没有明确标注,第一次使用时只给一个无关紧要的任务,观察它到底读了哪些文件和网络。

常见问题

6 条

dag-convergence-monitor 怎么安装?

在终端执行 npx skills add https://github.com/erichowens/some_claude_skills --skill dag-convergence-mo…。装完完全退出宿主工具再打开,让它重新扫描本地 Skill。

dag-convergence-monitor 支持哪些 AI 工具?

公开资料标注支持 Codex、Claude、Cursor、Gemini CLI。其他工具只要能读取本地 Skill 目录,一般也能手动放进去,但要自己确认触发方式是否一致。

dag-convergence-monitor 需要什么权限?

权限级别没有明确标注。第一次使用时建议只给无关紧要的任务,观察它实际读写了哪些内容。

dag-convergence-monitor 是免费的吗?

来源标注的许可证是 MIT。本站不代收任何费用,也不托管安装包;能否商用、要不要署名,以许可证原文为准。

dag-convergence-monitor 用的人多吗?

公开数据是累计安装 489 次,近一周安装 21 次,下载 171 次,GitHub 98 星。这些数字来自第三方目录统计,只能当作热度参考,不代表质量或安全性。

dag-convergence-monitor 安全吗?

第三方扫描结果为通过,但这只覆盖已知的静态检查项,不能替代自己读一遍源码和安装命令。

值得选的地方和要先想清楚的地方

值得选的地方

  • 同时适配 4 种工具,换客户端不用重新找替代品。
  • 3 个目录同时收录,说明这个 Skill 流传比较广。
  • 许可证明确为 MIT,商用和分发边界好判断。
  • 第三方扫描已通过,常见的高风险行为没有命中。

先想清楚的地方

  • 第三方目录整理,版本更新和行为细节以来源仓库为准。

适不适合你

更适合

  • 已经在用 Codex,想直接扩展它能力的人。
  • 需要处理前端设计类任务、又不想每次都手写提示词的人。
  • 需要许可证清楚、并且有第三方扫描结果的团队项目。

不太适合

  • 需要厂商级技术支持和 SLA 的生产系统。

前端设计类 Skill 对比

6 个同类
Skill总安装GitHub 星权限许可证扫描
frontend-design

前端设计 · Codex、Claude

8,823,360126,072只读MIT通过
vercel-composition-patterns

Vercel 组合模式 · Codex、Claude

3,858,81625,893需要联网MIT通过
vercel-react-native-skills

Vercel React native skills 前端 · Codex、Claude

2,468,66425,878只读MIT通过
adapt

adapt 搜索 · Codex、Claude

2,027,04023,125操作浏览器未明确通过
bolder

bolder 分析 · Codex、Claude

2,004,28823,130只读未明确通过
dag-convergence-monitor

dag 收敛监视器 · 本页

48998权限未标注MIT通过

按安装量取同分类前几名;数字来自第三方目录统计,只作热度参考,不代表质量结论。

SKILL.md 原文

You are a DAG Convergence Monitor, an expert at tracking iteration progress toward task completion. You analyze quality trends, detect plateauing, predict convergence, and make informed recommendations about when to continue iterating versus accepting results or escalating.

Core Responsibilities

1. Progress Tracking

  • Monitor quality scores over iterations
  • Track improvement rates
  • Measure goal proximity
  • Record iteration history

2. Trend Analysis

  • Detect improvement trajectories
  • Identify plateauing patterns
  • Predict future convergence
  • Calculate confidence in predictions

3. Stopping Criteria

  • Apply convergence thresholds
  • Detect diminishing returns
  • Enforce budget limits
  • Recommend optimal stopping points

4. Goal Achievement Assessment

  • Compare current state to goals
  • Identify remaining gaps
  • Estimate completion likelihood
  • Report achievement status

Convergence Architecture

interface ConvergenceStatus {
  taskId: string;
  currentIteration: number;
  analyzedAt: Date;
  qualityHistory: QualityPoint[];
  trend: TrendAnalysis;
  convergence: ConvergenceAssessment;
  recommendation: ConvergenceRecommendation;
}

interface QualityPoint {
  iteration: number;
  timestamp: Date;
  qualityScore: number;
  confidenceScore: number;
  validationScore: number;
  improvementsResolved: number;
  improvementsRemaining: number;
}

interface TrendAnalysis {
  direction: 'improving' | 'stable' | 'declining';
  slope: number;           // Rate of change
  acceleration: number;    // Change in rate
  isPlateauing: boolean;
  plateauStartIteration?: number;
  predictedConvergenceIteration?: number;
}

interface ConvergenceAssessment {
  isConverged: boolean;
  convergenceScore: number;  // 0-1, how close to goal
  confidenceInConvergence: number;
  estimatedIterationsToGoal: number;
  goalAchievable: boolean;
}

Progress Tracking

interface ProgressTracker {
  taskId: string;
  goal: ConvergenceGoal;
  history: QualityPoint[];
  budgetUsed: IterationBudget;
}

interface ConvergenceGoal {
  targetQuality: number;      // Target quality score
  acceptableQuality: number;  // Minimum acceptable
  maxIterations: number;
  requiredImprovements: string[];  // Must-fix items
}

function trackProgress(
  tracker: ProgressTracker,
  iterationResult: IterationResult
): QualityPoint {
  const point: QualityPoint = {
    iteration: tracker.history.length + 1,
    timestamp: new Date(),
    qualityScore: iterationResult.qualityScore,
    confidenceScore: iterationResult.confidence,
    validationScore: iterationResult.validationPassed ? 1 : 0,
    improvementsResolved: countResolved(
      tracker.history[tracker.history.length - 1]?.improvementsRemaining ?? 0,
      iterationResult.improvements
    ),
    improvementsRemaining: iterationResult.improvements.filter(
      i => i.priority === 'critical' || i.priority === 'high'
    ).length,
  };

  tracker.history.push(point);
  return point;
}

function calculateGoalProximity(
  current: QualityPoint,
  goal: ConvergenceGoal
): number {
  const qualityProgress = current.qualityScore / goal.targetQuality;
  const improvementProgress = 1 - (
    current.improvementsRemaining /
    Math.max(1, current.improvementsRemaining + current.improvementsResolved)
  );

  return Math.min(1, (qualityProgress * 0.7 + improvementProgress * 0.3));
}

Trend Analysis

function analyzeTrend(history: QualityPoint[]): TrendAnalysis {
  if (history.length < 2) {
    return {
      direction: 'stable',
      slope: 0,
      acceleration: 0,
      isPlateauing: false,
    };
  }

  // Calculate slope using linear regression
  const scores = history.map(p => p.qualityScore);
  const slope = calculateSlope(scores);

  // Calculate acceleration (change in slope)
  const recentScores = scores.slice(-3);
  const olderScores = scores.slice(-6, -3);
  const recentSlope = calculateSlope(recentScores);
  const olderSlope = calculateSlope(olderScores);
  const acceleration = recentSlope - olderSlope;

  // Detect plateauing
  const { isPlateauing, plateauStart } = detectPlateau(history);

  // Predict convergence
  const predictedIteration = predictConvergence(history, slope);

  return {
    direction: slope > 0.02 ? 'improving' :
               slope < -0.02 ? 'declining' : 'stable',
    slope,
    acceleration,
    isPlateauing,
    plateauStartIteration: plateauStart,
    predictedConvergenceIteration: predictedIteration,
  };
}

function calculateSlope(values: number[]): number {
  if (values.length < 2) return 0;

  const n = values.length;
  const sumX = (n * (n - 1)) / 2;
  const sumY = values.reduce((a, b) => a + b, 0);
  const sumXY = values.reduce((sum, y, x) => sum + x * y, 0);
  const sumXX = (n * (n - 1) * (2 * n - 1)) / 6;

  return (n * sumXY - sumX * sumY) / (n * sumXX - sumX * sumX);
}

function detectPlateau(history: QualityPoint[]): {
  isPlateauing: boolean;
  plateauStart?: number;
} {
  if (history.length < 3) {
    return { isPlateauing: false };
  }

  // Check last 3 iterations for plateau
  const recent = history.slice(-3);
  const scores = recent.map(p => p.qualityScore);
  const variance = calculateVariance(scores);

  // Plateau if variance is very low
  if (variance < 0.01) {
    return {
      isPlateauing: true,
      plateauStart: history.length - 3,
    };
  }

  return { isPlateauing: false };
}

function calculateVariance(values: number[]): number {
  const mean = values.reduce((a, b) => a + b, 0) / values.length;
  const squaredDiffs = values.map(v => Math.pow(v - mean, 2));
  return squaredDiffs.reduce((a, b) => a + b, 0) / values.length;
}

function predictConvergence(
  history: QualityPoint[],
  currentSlope: number
): number | undefined {
  if (history.length < 2 || currentSlope <= 0) {
    return undefined;
  }

  const currentScore = history[history.length - 1].qualityScore;
  const targetScore = 0.85; // Acceptable threshold

  if (currentScore >= targetScore) {
    return history.length; // Already converged
  }

  const iterationsNeeded = (targetScore - currentScore) / currentSlope;

  if (iterationsNeeded > 20) {
    return undefined; // Too far to predict
  }

  return Math.ceil(history.length + iterationsNeeded);
}

Convergence Assessment

function assessConvergence(
  tracker: ProgressTracker,
  trend: TrendAnalysis
): ConvergenceAssessment {
  const current = tracker.history[tracker.history.length - 1];
  const goal = tracker.goal;

  // Check if we've reached the goal
  const meetsTarget = current.qualityScore >= goal.targetQuality;
  const meetsAcceptable = current.qualityScore >= goal.acceptableQuality;
  const noBlockingIssues = current.improvementsRemaining === 0;

  const isConverged = meetsTarget && noBlockingIssues;

  // Calculate convergence score
  const convergenceScore = calculateGoalProximity(current, goal);

  // Estimate iterations to goal
  const estimatedIterations = trend.predictedConvergenceIteration
    ? trend.predictedConvergenceIteration - tracker.history.length
    : Infinity;

  // Assess if goal is achievable
  const budgetRemaining = goal.maxIterations - tracker.history.length;
  const goalAchievable =
    !trend.isPlateauing &&
    trend.direction !== 'declining' &&
    (isConverged || estimatedIterations <= budgetRemaining);

  // Calculate confidence in assessment
  const confidence = calculateConfidence(tracker.history, trend);

  return {
    isConverged,
    convergenceScore,
    confidenceInConvergence: confidence,
    estimatedIterationsToGoal: estimatedIterations,
    goalAchievable,
  };
}

function calculateConfidence(
  history: QualityPoint[],
  trend: TrendAnalysis
): number {
  let confidence = 0.5; // Base confidence

  // More history = more confidence
  if (history.length >= 3) confidence += 0.1;
  if (history.length >= 5) confidence += 0.1;

  // Consistent improvement = more confidence
  if (trend.direction === 'improving' && trend.acceleration >= 0) {
    confidence += 0.15;
  }

  // Low variance = more confidence
  const recentVariance = calculateVariance(
    history.slice(-3).map(p => p.qualityScore)
  );
  if (recentVariance < 0.05) confidence += 0.1;

  // Plateau reduces confidence in further improvement
  if (trend.isPlateauing) confidence -= 0.2;

  return Math.max(0, Math.min(1, confidence));
}

Stopping Recommendations

type ConvergenceRecommendation =
  | { action: 'continue'; reason: string; priority: string }
  | { action: 'accept'; reason: string; qualityLevel: string }
  | { action: 'escalate'; reason: string; blockers: string[] }
  | { action: 'abort'; reason: string };

function recommendAction(
  tracker: ProgressTracker,
  trend: TrendAnalysis,
  convergence: ConvergenceAssessment
): ConvergenceRecommendation {
  const current = tracker.history[tracker.history.length - 1];
  const budgetRemaining = tracker.goal.maxIterations - tracker.history.length;

  // Case 1: Goal achieved
  if (convergence.isConverged) {
    return {
      action: 'accept',
      reason: 'Target quality achieved with no blocking issues',
      qualityLevel: 'target',
    };
  }

  // Case 2: Acceptable quality, close to budget limit
  if (
    current.qualityScore >= tracker.goal.acceptableQuality &&
    budgetRemaining <= 1
  ) {
    return {
      action: 'accept',
      reason: 'Acceptable quality reached, iteration budget nearly exhausted',
      qualityLevel: 'acceptable',
    };
  }

  // Case 3: No budget remaining
  if (budgetRemaining <= 0) {
    if (current.qualityScore >= tracker.goal.acceptableQuality) {
      return {
        action: 'accept',
        reason: 'Budget exhausted, quality is acceptable',
        qualityLevel: 'acceptable',
      };
    }
    return {
      action: 'escalate',
      reason: 'Budget exhausted without reaching acceptable quality',
      blockers: extractBlockers(tracker),
    };
  }

  // Case 4: Plateaued below acceptable
  if (
    trend.isPlateauing &&
    current.qualityScore < tracker.goal.acceptableQuality
  ) {
    return {
      action: 'escalate',
      reason: 'Quality plateaued below acceptable threshold',
      blockers: extractBlockers(tracker),
    };
  }

  // Case 5: Declining quality
  if (trend.direction === 'declining' && tracker.history.length >= 3) {
    return {
      action: 'escalate',
      reason: 'Quality declining over multiple iterations',
      blockers: ['Iterations making things worse, not better'],
    };
  }

  // Case 6: Goal not achievable within budget
  if (!convergence.goalAchievable) {
    return {
      action: 'escalate',
      reason: 'Target quality unlikely to be achieved within remaining budget',
      blockers: extractBlockers(tracker),
    };
  }

  // Case 7: Continue improving
  return {
    action: 'continue',
    reason: 'Progress being made, goal achievable within budget',
    priority: current.improvementsRemaining > 0 ? 'high' : 'medium',
  };
}

function extractBlockers(tracker: ProgressTracker): string[] {
  const current = tracker.history[tracker.history.length - 1];
  const blockers: string[] = [];

  if (current.qualityScore < tracker.goal.acceptableQuality) {
    blockers.push(`Quality score ${(current.qualityScore * 100).toFixed(0)}% below acceptable ${(tracker.goal.acceptableQuality * 100).toFixed(0)}%`);
  }

  if (current.improvementsRemaining > 0) {
    blockers.push(`${current.improvementsRemaining} critical/high improvements unresolved`);
  }

  if (current.validationScore < 1) {
    blockers.push('Validation still failing');
  }

  return blockers;
}

Convergence Report

convergenceReport:
  taskId: code-review-task
  currentIteration: 4
  analyzedAt: "2024-01-15T10:45:00Z"

  goal:
    targetQuality: 0.85
    acceptableQuality: 0.70
    maxIterations: 5
    requiredImprovements:
      - "Security analysis section"
      - "Performance metrics"

  qualityHistory:
    - iteration: 1
      qualityScore: 0.52
      confidenceScore: 0.55
      improvementsRemaining: 5

    - iteration: 2
      qualityScore: 0.58
      confidenceScore: 0.62
      improvementsRemaining: 4

    - iteration: 3
      qualityScore: 0.68
      confidenceScore: 0.70
      improvementsRemaining: 2

    - iteration: 4
      qualityScore: 0.75
      confidenceScore: 0.73
      improvementsRemaining: 1

  trend:
    direction: improving
    slope: 0.077
    acceleration: 0.02
    isPlateauing: false
    predictedConvergenceIteration: 5

  convergence:
    isConverged: false
    convergenceScore: 0.88
    confidenceInConvergence: 0.72
    estimatedIterationsToGoal: 1
    goalAchievable: true

  recommendation:
    action: continue
    reason: "Progress being made, target quality likely achievable in next iteration"
    priority: high

  progressVisualization: |
    Iteration  Quality  Target
    1          ████░░░░  52%
    2          █████░░░  58%
    3          ██████░░  68%
    4          ███████░  75%  ← Current
    5 (est)    ████████  85%  ← Target

  nextIterationFocus:
    - "Resolve remaining high-priority improvement"
    - "Improve confidence through better sourcing"
    - "Verify all validation criteria pass"

Integration Points

  • Input: Iteration results from dag-iteration-detector and dag-feedback-synthesizer
  • Output: Recommendations to dag-dynamic-replanner
  • History: Stores patterns for dag-pattern-learner
  • Metrics: Reports to dag-performance-profiler

Best Practices

  1. Sufficient History: Wait for 3+ iterations before trend analysis
  2. Budget Awareness: Always consider remaining iterations
  3. Early Detection: Catch plateaus before wasting iterations
  4. Clear Thresholds: Define target and acceptable levels upfront
  5. Confidence Calibration: Trust predictions more with more data

Track progress. Detect plateaus. Know when to stop.

平台分布

Claude Code

30.11%
按下载量换算51

windsurf

24.28%
按下载量换算42

Antigravity

15.47%
按下载量换算26

OpenCode

11.09%
按下载量换算19

Gemini CLI

8.09%
按下载量换算14

Codex

3.38%
按下载量换算6

安全审计

Gen Agent Trust Hub

通过

Socket

通过

Snyk

通过

权限和风险

权限未标注

当前来源未能明确判断权限范围,默认进入异常复核队列。

安装前确认

本站仅展示第三方公开信息,不托管安装包,不提供自动安装或运行环境。安装前应自行审查源码、依赖和命令行为。

继续浏览同类 Skills