Update spec/data_flow_presentation_verify.md

Co-authored-by: Michael Lodder <[email protected]>
Signed-off-by: Aritra Bhaduri <[email protected]>

spec/data_flow_presentation_verify.md

@@ -95,7 +95,7 @@ $$\widehat{T_8} \leftarrow \left(\frac{e(\mathcal{G},u)}{e(g,\mathcal{U})}\right
 Then all these values are added to $\widehat{T}$. This is then added with the validity proof which when hashed with $\mathcal{C}$ and $n_1$(recieved from [[ref: holder]]) re constructs the challenge hash $\widehat{c_H}$
 Now, if $\widehat{c_H} = c_H$ then the proof is valid.
 
-The NRP is bound to the credential by the $\widehat{m_2}$ value that is present in the proof.
+The NRP is bound to the primary credential by the $\widehat{m_2}$ value that is presented in both proofs.
 
 The verification code MUST surface to the [[ref: verifier]] if any part of the
 presentation, including any NRP(s), fail cryptographic verification. The