// 扩容方案评分与决策模拟：根据用户权重推荐最优路径

type Solution = {
  name: string;
  decentralization: number;  // 1-5
  security: number;
  throughput: number;
  latency: number;            // 越高越好（低延迟=高分）
  maturity: number;
  bridgeRisk: number;          // 反向指标，越高=风险越低
};

const SOLUTIONS: Solution[] = [
  { name: '大区块优化',       decentralization: 2, security: 5, throughput: 2, latency: 3, maturity: 5, bridgeRisk: 5 },
  { name: '分片 / Dankshard',   decentralization: 4, security: 4, throughput: 4, latency: 3, maturity: 2, bridgeRisk: 5 },
  { name: '侧链 / Polygon-PoS', decentralization: 1, security: 2, throughput: 3, latency: 4, maturity: 5, bridgeRisk: 1 },
  { name: '状态通道',           decentralization: 3, security: 4, throughput: 5, latency: 5, maturity: 4, bridgeRisk: 4 },
  { name: 'Optimistic Rollup',   decentralization: 4, security: 5, throughput: 3, latency: 1, maturity: 5, bridgeRisk: 4 },
  { name: 'ZK Rollup',          decentralization: 3, security: 5, throughput: 3, latency: 4, maturity: 3, bridgeRisk: 4 },
  { name: 'DA 层+Rollup',       decentralization: 4, security: 5, throughput: 4, latency: 3, maturity: 3, bridgeRisk: 4 },
  { name: '模块化堆栈',        decentralization: 4, security: 4, throughput: 4, latency: 3, maturity: 2, bridgeRisk: 3 },
];

type Weights = {
  decentralization: number;
  security: number;
  throughput: number;
  latency: number;
  maturity: number;
  bridgeRisk: number;
};

function recommend(
  solutions: Solution[],
  weights: Weights
): { scores: { name: string; score: number }[]; best: string } {
  const normW = Object.values(weights).reduce((a, b) => a + b, 0);

  const scores = solutions.map((s) => {
    const score =
      (s.decentralization  * weights.decentralization +
       s.security           * weights.security +
       s.throughput         * weights.throughput +
       s.latency            * weights.latency +
       s.maturity           * weights.maturity +
       s.bridgeRisk         * weights.bridgeRisk) / normW;
    return { name: s.name, score: parseFloat(score.toFixed(3)) };
  });

  scores.sort((a, b) => b.score - a.score);
  return { scores, best: scores[0].name };
}

// 场景 1: 安全第一、去中心化第一 = 以太坊开发者
const w1: Weights = {
  decentralization: 5, security: 5, throughput: 1, latency: 1, maturity: 3, bridgeRisk: 4,
};
const r1 = recommend(SOLUTIONS, w1);
console.log(`场景 1 (安全 > 去中心化): 最优 = ${r1.best}`);
r1.scores.slice(0, 3).forEach((s) => console.log(`  - ${s.name}:${s.score}`));

// 场景 2: 速度为王 = 游戏/高频应用
const w2: Weights = {
  decentralization: 1, security: 2, throughput: 5, latency: 5, maturity: 3, bridgeRisk: 2,
};
const r2 = recommend(SOLUTIONS, w2);
console.log(`\n场景 2 (速度 > 吞吐): 最优 = ${r2.best}`);
r2.scores.slice(0, 3).forEach((s) => console.log(`  - ${s.name}:${s.score}`));

// 场景 3: 平衡需求 = 新公链团队
const w3: Weights = {
  decentralization: 3, security: 4, throughput: 4, latency: 3, maturity: 3, bridgeRisk: 3,
};
const r3 = recommend(SOLUTIONS, w3);
console.log(`\n场景 3 (均衡): 最优 = ${r3.best}`);
r3.scores.slice(0, 3).forEach((s) => console.log(`  - ${s.name}:${s.score}`));