audio-signal-flow-explainer — independently scanned and version-tracked by SaferSkills.
SaferSkills independently audited audio-signal-flow-explainer (Agent Skill) and scored it 100/100 (green). The audit ran 55 deterministic rules across Security, Supply Chain, Maintenance, Transparency, and Community; it found 0 high-severity and 0 lower-severity findings. The full rule-by-rule trace and per-finding evidence are below. Free, methodology-open.
Findings & checks · 0 flagged
Every scanned point with the score it earned and what moved between them.
First recorded scan — no prior version to compare against.
The primary manifest — the file an agent reads to learn what this artifact does.
Core principle: Audio signal flow is a directed graph. Tracing it reveals hidden coupling, latency paths, and places where the signal can be corrupted.
| Node type | What to note |
|---|---|
| Source (oscillator, audio input, file reader) | Sample rate, channel count, sync source |
| Processor (filter, effect, gain) | In/out channel count, latency added, stateful or stateless |
| Router (bus send, parallel split, sidechain tap) | Where signal copies go, gain staging at split |
| Sink (audio output, recorder, meter) | Expected format, callback timing, buffer size |
Use this format:
## Signal Flow: [component/system]
### Graph
Source → [gain: 1.0] → [Biquad LPF] → [Comp sidechain tap] → [Output]
↓
[Compressor] → [Output]
### Latency path
Source → LPF (0 samples) → Compressor (64 samples lookahead) → Output
Total: 64 samples
### Issues found
- Parallel path to Output has no latency compensation for the 64-sample compressor delay| Pattern | What to check |
|---|---|
| Parallel split rejoining | Latency of each branch must match before summing |
| Sidechain compressor | Verify sidechain input is connected and level-matched |
| Send/return bus | Check send gain, return gain, and whether send is pre- or post-fader |
| Feedback loop | Confirm a delay of at least 1 sample exists to break algebraic loop |
| Multi-rate graph | Confirm resampling nodes at every rate boundary |
~30 seconds. Free. No account. Every finding cites a rule and a line of evidence.