diff --git a/appveyor.yml b/appveyor.yml
index c5f65837e..3b90697f1 100644
--- a/appveyor.yml
+++ b/appveyor.yml
@@ -21,7 +21,7 @@ environment:
       CMAKE_PARAM: 'Visual Studio 15 2017 Win64'
       JAVA_HOME: C:\Program Files\Java\jdk1.8.0
 
-    - DB: '10.1.46'
+    - DB: '10.6.4'
       APPVEYOR_BUILD_WORKER_IMAGE: Visual Studio 2017
       CMAKE_PARAM: 'Visual Studio 15 2017 Win64'
       JAVA_HOME: C:\Program Files\Java\jdk1.8.0
diff --git a/src/main/java/org/mariadb/jdbc/internal/com/send/authentication/ed25519/math/ed25519/Ed25519LittleEndianEncoding.java b/src/main/java/org/mariadb/jdbc/internal/com/send/authentication/ed25519/math/ed25519/Ed25519LittleEndianEncoding.java
index 8d302f5e9..cdbf39484 100644
--- a/src/main/java/org/mariadb/jdbc/internal/com/send/authentication/ed25519/math/ed25519/Ed25519LittleEndianEncoding.java
+++ b/src/main/java/org/mariadb/jdbc/internal/com/send/authentication/ed25519/math/ed25519/Ed25519LittleEndianEncoding.java
@@ -44,7 +44,7 @@ static long load_4(byte[] in, int offset) {
    *
    * <p>The idea for the modulo $p$ reduction algorithm is as follows:
    *
-   * <h2>Assumption:</h2>
+   * <p>Assumption:
    *
    * <ul>
    *   <li>$p = 2^{255} - 19$
@@ -56,7 +56,7 @@ static long load_4(byte[] in, int offset) {
    *
    * <p>Then $q = [2^{-255} * (h + 19 * 2^{-25} * h_9 + 1/2)]$ where $[x] = floor(x)$.
    *
-   * <h2>Proof:</h2>
+   * <p>Proof:
    *
    * <p>We begin with some very raw estimation for the bounds of some expressions:
    *