diff --git a/index.html b/index.html
index 6dccbc0de..369208444 100644
--- a/index.html
+++ b/index.html
@@ -4163,10 +4163,10 @@ <h3>Securing Mechanism Specifications</h3>
 JOSE/COSE header parameters and signatures. Specifications MAY provide additional mechanisms to convey
 other information that might be helpful (for example, during validation or for
 debugging purposes), such as securing mechanism data. A securing mechanism's
-verification algorithm MUST provide an interface that receives a sequence of
-bytes ([=byte sequence=] |inputBytes|) or a document ([=map=] |inputDocument|)
-and a media type ([=string=] |inputMediaType|) as inputs and returns a
-verification result with at least the following [=struct/items=]:
+verification algorithm MUST provide an interface that receives inputs of a media
+type ([=string=] |inputMediaType|) paired with either a sequence of bytes 
+([=byte sequence=] |inputBytes|) or a document ([=map=] |inputDocument|), and
+returns a verification result with at least the following [=struct/items=]:
         </p>
 
         <dl>
@@ -4758,11 +4758,10 @@ <h3>Verification</h3>
         <p>
 This section contains an algorithm that [=conforming verifier
 implementations=] MUST run when verifying a [=verifiable credential=] or a
-[=verifiable presentation=]. This algorithm takes a sequence of bytes
-([=byte sequence=] |inputBytes|) or a document
-([=map=] |inputDocument|) and a media type
-([=string=] |inputMediaType|) as inputs, and returns a [=map=]
-that contains the following:
+[=verifiable presentation=]. This algorithm takes inputs of a media
+type ([=string=] |inputMediaType|) paired with either a sequence of bytes 
+([=byte sequence=] |inputBytes|) or a document ([=map=] |inputDocument|), 
+and returns a [=map=] that contains the following:
         </p>
 
         <ul>
@@ -4814,7 +4813,7 @@ <h3>Verification</h3>
 had an issue determining the proper |verifyProof| algorithm to use, but the
 Working Group is attempting to see if saying more here would be worthwhile.
 Additional example language could be added that says that an implementation
-might have an allow list of acceptable cryptosuites -- and these will be used as
+might have an allow list of acceptable cryptosuites — and these will be used as
 inputs for finding matching proofs to be verified.
                 </div>
               </li>