Javadoc fixes after testing with JDK 14 build 36

core/java/src/net/i2p/crypto/eddsa/math/ed25519/Ed25519LittleEndianEncoding.java

@@ -27,7 +27,7 @@ public class Ed25519LittleEndianEncoding extends Encoding {
      * </ol><p>
      * The idea for the modulo $p$ reduction algorithm is as follows:
      * </p>
-     * <h2>Assumption:</h2>
+     * <h4>Assumption:</h4>
      * <ul>
      * <li>$p = 2^{255} - 19$
      * <li>$h = h_0 + 2^{25} * h_1 + 2^{(26+25)} * h_2 + \dots + 2^{230} * h_9$ where $0 \le |h_i| \lt 2^{27}$ for all $i=0,\dots,9$.
@@ -35,7 +35,7 @@ public class Ed25519LittleEndianEncoding extends Encoding {
      * </ul><p>
      * Then $q = [2^{-255} * (h + 19 * 2^{-25} * h_9 + 1/2)]$ where $[x] = floor(x)$.
      * </p>
-     * <h2>Proof:</h2>
+     * <h4>Proof:</h4>
      * <p>
      * We begin with some very raw estimation for the bounds of some expressions:
      * <p>

core/java/src/net/i2p/data/i2cp/package.html

@@ -22,7 +22,7 @@ be added in the future. I2CP however does not expose any private keys across the
 wire - proof of authorization to collect messages for a Destination is provided by
 public key signatures.
 </p>
-<h1>Messages</h1>
+<h2>Messages</h2>
 <p>
 These classes are the currently defined messages in the Invisible Internet Client
 Protocol (I2CP), though common data structures are located in the I2P Common Data