<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://en.zaoniao.it/index.php?action=history&amp;feed=atom&amp;title=Verhoeff_algorithm</id>
	<title>Verhoeff algorithm - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://en.zaoniao.it/index.php?action=history&amp;feed=atom&amp;title=Verhoeff_algorithm"/>
	<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=Verhoeff_algorithm&amp;action=history"/>
	<updated>2026-05-15T07:42:45Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.32.0</generator>
	<entry>
		<id>http://en.zaoniao.it/index.php?title=Verhoeff_algorithm&amp;diff=7487&amp;oldid=prev</id>
		<title>Admin: Created page with &quot;'''Verhoeff algorithm''' is a checksum formula for error detection developed by the Dutch mathematician Jacobus Verhoeff and was first published in 1969. It was the first deci...&quot;</title>
		<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=Verhoeff_algorithm&amp;diff=7487&amp;oldid=prev"/>
		<updated>2019-08-11T15:19:42Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;&amp;#039;&amp;#039;&amp;#039;Verhoeff algorithm&amp;#039;&amp;#039;&amp;#039; is a checksum formula for error detection developed by the Dutch mathematician Jacobus Verhoeff and was first published in 1969. It was the first deci...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;'''Verhoeff algorithm''' is a checksum formula for error detection developed by the Dutch mathematician Jacobus Verhoeff and was first published in 1969. It was the first decimal check digit algorithm which detects all single-digit errors, and all transposition errors involving two adjacent digits, which was at the time thought impossible with such a code.&lt;br /&gt;
&lt;br /&gt;
Verhoeff had the goal of finding a decimal code—one where the check digit is a single decimal digit—which detected all single-digit errors and all transpositions of adjacent digits. At the time, supposed proofs of the nonexistence of these codes made base-11 codes popular, for example in the ISBN check digit.&lt;br /&gt;
&lt;br /&gt;
==External links==&lt;br /&gt;
* [http://www.cs.utsa.edu/~wagner/laws/verhoeff.html Detailed description of the Verhoeff algorithm]&lt;br /&gt;
&lt;br /&gt;
==Source==&lt;br /&gt;
[http://wikipedia.org/ http://wikipedia.org/]&lt;br /&gt;
==See Also on BitcoinWiki==&lt;br /&gt;
* [[TomoChain]]&lt;br /&gt;
* [[Dieppalaw]]&lt;br /&gt;
* [[FReeStart platform]]&lt;br /&gt;
* [[Bitwoex]]&lt;br /&gt;
* [[Background Intelligent Transfer Service]]&lt;/div&gt;</summary>
		<author><name>Admin</name></author>
		
	</entry>
</feed>