virtuoso-bridge-lite is a bridge that lets AI coding agents control Cadence Virtuoso and Spectre, electronic-design tools for analog and mixed-signal circuits, through Python, SKILL, or the command line. Engineers can use it locally or connect to a remote server to automate design work with an agent. The catalogue entries provide agent skills and instructions for working with the bridge.
Getting it into your agent
One page per mod, every tool's command on it. A separate URL per tool would split the same page into five that compete with each other.
npx skills add Arcadia-1/virtuoso-bridge-lite --skill optimizergit clone --depth 1 https://github.com/Arcadia-1/virtuoso-bridge-liteWrote this? Show the measurements
A badge with what this costs and how it scanned, read live from this page, so it follows the numbers instead of freezing them. Markdown for a README, HTML for a documentation site or a project page.
[](https://agentmods.dev/skills/arcadia-1/virtuoso-bridge-lite/optimizer)<a href="https://agentmods.dev/skills/arcadia-1/virtuoso-bridge-lite/optimizer"><img src="https://agentmods.dev/badge/skills/arcadia-1/virtuoso-bridge-lite/optimizer/github.svg" alt="Measured on agentmods" height="20"></a>Or the 80×15 button, for a site that already has a row of RSS and ATOM ones. Only the verdict fits; the numbers stay here.
<a href="https://agentmods.dev/skills/arcadia-1/virtuoso-bridge-lite/optimizer"><img src="https://agentmods.dev/badge/skills/arcadia-1/virtuoso-bridge-lite/optimizer.svg" alt="Reviewed on agentmods" width="80" height="20"></a>- NVIDIA SkillSpector pass
What it costs to keep this loaded
Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.
| Model | Per session | Once invoked |
|---|---|---|
| Fable 5.1 | $0.00140 | $0.01540 |
| Opus 5.5 | $0.00056 | $0.00616 |
| Sonnet 5.5 | $0.00028 | $0.00308 |
| Haiku 4.5 | $0.00014 | $0.00154 |
Grade A, and why
optimizer scanned grade A with 0 findings against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured 2mo ago.
A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.
Nothing flagged
None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.
How it starts
The opening of the file, as written. The whole thing — 140 lines — stays where its author put it; the contents beside it link to each section on GitHub.
Optimizer
What this is
A black-box optimization framework. You give it:
- A set of parameters with bounds (e.g. transistor widths, bias currents, resistor values)
- An evaluation function that takes parameters and returns performance metrics
- An objective that combines metrics into a single scalar to minimize
The optimizer iteratively picks parameter values, evaluates them, and converges toward the optimum. It treats the evaluation as a black box — it doesn't need to know whether you're running Spectre, Maestro, a Python model, or anything else.
When to use
- Circuit sizing — find W/L, bias currents, passive values that meet gain/BW/noise/power specs
- Design space exploration — sweep a high-dimensional parameter space that's too large for manual tuning or parametric sweeps
- Multi-objective tradeoffs — minimize power-delay product, noise-power FOM, etc.
- Any expensive black-box function — the evaluation can be slow (seconds to minutes per point); TuRBO is sample-efficient
When NOT to use
- Single-variable sweep — just use a parametric sweep in Maestro or a for-loop
- Analytical solution exists — if you can derive the optimum, don't search for it
- < 5 evaluations budget — TuRBO needs at least
2 * n_paramsinitial samples
Algorithm choice
| Situation | Algorithm | Why |
|---|---|---|
| ≤ 3 params, smooth | scipy.optimize.minimize |
Fast, no GP overhead |
| 3–20 params, noisy/expensive | TuRBO (turbo.Turbo1) |
Sample-efficient Bayesian optimization with trust regions |
| > 20 params | Consider random search + refinement | GP doesn't scale well beyond ~20D |
Prerequisites
- For TuRBO:
pip install torch gpytorchand local TuRBO install (pip install -e TuRBO/)- TuRBO (Trust Region Bayesian Optimization) comes from uber-research/TuRBO
- For scipy: included in standard Python scientific stack
Core pattern
import numpy as np
from turbo import Turbo1
# 1. Define parameters and bounds
PARAMS = ["W_tail", "W_inp", "R_load"]
LB = np.array([0.5, 0.5, 100.])
UB = np.array([10., 10., 5000.])
# 2. Objective: params → scalar (minimize)
def objective(x):
try:
result = evaluate(x, PARAMS)
except Exception:
return 1e6 # penalty on failure, never nan/inf
return compute_metric(result)
# 3. Run
turbo = Turbo1(f=objective, lb=LB, ub=UB,
n_init=2*len(LB), max_evals=100, batch_size=1)
turbo.optimize()
best = turbo.X[turbo.fX.argmin()]
What this file has done since we first saw it
Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.
- 2mo ago First seen · 140 lines · 140 tokens per session scan A a22019e2fa64
optimizer is a skill published in the GitHub repository Arcadia-1/virtuoso-bridge-lite (1,012 stars, last pushed yesterday), licensed MIT. It adds 140 tokens to every session and 1,540 once invoked, about $0.0006 per session on Opus 5.5. A static security scan graded it A with 0 findings. No closer match exists in the catalogue, so it is treated as the original; first seen 2026-08-30.
optimizer compared with skills from other repositories
| Mod | Type | Stars | Last push | Licence | Scan | Tokens | Works with |
|---|---|---|---|---|---|---|---|
| optimizerArcadia-1/virtuoso-bridge-lite | Skill | 1.0k | yesterday | MIT | A | 140 | Claude Code, Codex |
| instrument-data-to-allotropeanthropics/knowledge-work-plugins | Skill | 35k | 2d ago | Apache-2.0 | A | 123 | Claude Code |
| exploratory-data-analysisK-Dense-AI/scientific-agent-skills | Skill | 56k | 4d ago | MIT | A | 83 | Claude Code |
| matlabK-Dense-AI/scientific-agent-skills | Skill | 56k | 4d ago | MIT | A | 44 | Claude Code |
| phylogeneticsK-Dense-AI/scientific-agent-skills | Skill | 56k | 4d ago | MIT | A | 71 | Claude Code, Codex |
| research-engineerdavila7/claude-code-templates | Skill | 33k | yesterday | MIT | A | 43 | Claude Code, Codex |
| mapping-to-snomedmaziyarpanahi/openmed | Skill | 5.8k | yesterday | Apache-2.0 | A | 205 | Claude Code |