← All parts of this equation

Equation 2 · Part 5 · Ten Failure Modes in Agentic Coding, from Prompt Injection to False Completion

multiplication

Risk⁡(a)=P(unsafe proposal)⋅P(authorization∣proposal)⋅P(escape detection)⋅L(a),\operatorname{Risk}(a)= P(\text{unsafe proposal}) \cdot P(\text{authorization}\mid\text{proposal}) \cdot P(\text{escape detection}) \cdot L(a),
multiplication

What this part means

Multiply the quantities on either side.

Its job in the formula

Multiply the quantities on either side.

The passage around this formula

The risk of an action a is not reducible to model error probability. A simple decomposition is Risk⁡(a)=P(unsafe proposal)⋅P(authorization∣proposal)⋅P(escape detection)⋅L(a)\operatorname{Risk}(a)= P(\text{unsafe proposal}) \cdot P(\text{authorization}\mid\text{proposal}) \cdot P(\text{escape detection}) \cdot L(a). where L(a) is consequence. Better models can reduce the first factor. Sandboxes, permission policy, independent evaluators, and staged execution reduce the others. Security architecture should assume every factor is nonzero.

Read this part in the article →

Learn the underlying idea

Multiplication scales one quantity by another. A dot, a cross, or adjacent symbols can indicate a product.

Open the illustrated multiplication: combining factors guide →

Sources cited in the article section

These citations provide research context; check each source for the exact claim it supports.