diff --git a/docs/index.html b/docs/index.html
index fac3be1..f7580fd 100644
--- a/docs/index.html
+++ b/docs/index.html
@@ -152,7 +152,7 @@ <h1><a class="anchor" id="codesample_sec"></a>
 <div class="ttc" id="astructhashtable__t_html"><div class="ttname"><a href="structhashtable__t.html">hashtable_t</a></div><div class="ttdoc">All data for a single hashtable instance.</div><div class="ttdef"><b>Definition:</b> hashtable_api.h:183</div></div>
 </div><!-- fragment --><h1><a class="anchor" id="perftest_sec"></a>
 Performance visualization</h1>
-<p>The following graph shows the results from a test program which creates a hashtable instance with a 16MB buffer, and inserts items until the buffer is full (each key is a 32-bit unsigned integer, and all values are NULL / 0 bytes).</p>
+<p>The following graph shows the results from a test program which creates a hashtable instance with a 32MB buffer, and inserts items until the buffer is full (each key is a 32-bit unsigned integer, and all values are NULL / 0 bytes).</p>
 <p>After every 2,000 items inserted, the test program performs the following checks;</p>
 <ul>
 <li>Divide the time taken for the last 2,000 item insertions, by 2,000, to get the average insertion time</li>
diff --git a/hashtable_api.h b/hashtable_api.h
index 1c83938..8b861bf 100644
--- a/hashtable_api.h
+++ b/hashtable_api.h
@@ -29,7 +29,7 @@
  * \section perftest_sec Performance visualization
  *
  * The following graph shows the results from a test program which creates a hashtable
- * instance with a 16MB buffer, and inserts items until the buffer is full (each key
+ * instance with a 32MB buffer, and inserts items until the buffer is full (each key
  * is a 32-bit unsigned integer, and all values are NULL / 0 bytes).
  *
  * After every 2,000 items inserted, the test program performs the following checks;