Base58Check encoding: Difference between revisions

[[Category:Encodings]]

[[Category:Checksums]]

 

The popular encoding of small and medium-sized [[:Category:Checksums|checksums]] is [[wp:base16|base16]], that is more compact than usual base10 and is human readable... For checksums resulting in ''hash digests'' bigger than ~100 bits, the base16 is too long: [[wp:base58|base58]] is shorter and (when using good alphabet) preserves secure human readability. The most popular alphabet of base58 is the variant used in bitcoin address (see [[Bitcoin/address validation]]), so it is the "default base58 alphabet".

<br><br>

 

{{trans|Java}}

using System.Collections.Generic;

using System.Numerics;

}

}

{{out}}

<pre>25420294593250030202636073700053352635053786165627414518 -> 6UwLL9Risc3QfPqBUvKofHmBQ7wMtjvM

0xecac89cad93923c02321 -> EJDM8drfXA6uyA

0x10c8511e -> Rt5zm</pre>

 

=={{header|FreeBASIC}}==

{{libheader|GMP}}

' compile with: fbc -s console

' uses GMP

Print : Print "hit any key to end program"

Sleep

{{out}}

<pre>OkobppXBkab(58) --> RosettaCode

0xecac89cad93923c02321 --> EJDM8drfXA6uyA

0x10c8511e --> Rt5zm</pre>

 

=={{header|Go}}==

{{trans|Kotlin}}

 

import (

fmt.Printf("%-56s -> %s\n", hash, b58)

}

 

{{out}}

0x10c8511e -> Rt5zm

</pre>

 

=={{header|Haskell}}==

 

chars = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"

0x572e4794,

0xecac89cad93923c02321,

{{out}}

<pre>

EJDM8drfXA6uyA

Rt5zm</pre>

 

and for bulk encoding, Array access would be one of various slightly faster alternatives to recursive subscripting of linked lists:

 

 

 

main :: IO ()

main =

{{Out}}

 

=={{header|Java}}==

{{trans|Kotlin}}

{{works with|Java|9}}

import java.util.List;

 

}

}

{{out}}

<pre>25420294593250030202636073700053352635053786165627414518 -> 6UwLL9Risc3QfPqBUvKofHmBQ7wMtjvM

0xecac89cad93923c02321 -> EJDM8drfXA6uyA

0x10c8511e -> Rt5zm</pre>

 

=={{header|Julia}}==

{{works with|Julia|0.6}}

 

 

function encodebase58(hsh::AbstractString, base::Integer=16)

"0x10c8511e"]

println("# $s\n -> ", encodebase58(s))

 

{{out}}

 

=={{header|Kotlin}}==

 

import java.math.BigInteger

println("${hash.padEnd(56)} -> $b58")

}

 

{{out}}

0x10c8511e -> Rt5zm

</pre>

 

=={{header|Perl}}==

 

sub encode_base58 {

0xecac89cad93923c02321

0x10c8511e

{{out}}

<pre>25420294593250030202636073700053352635053786165627414518 -> 6UwLL9Risc3QfPqBUvKofHmBQ7wMtjvM

0xecac89cad93923c02321 -> EJDM8drfXA6uyA

0x10c8511e -> Rt5zm</pre>

 

=={{header|Phix}}==

Slight variation from [[Bitcoin/public_point_to_address#Phix]] in that it accepts any length string (which can be binary or text).<br>

Includes leading zeroes, if you don't want that just comment out the three lines defining/using the integer lz.

{{out}}

<pre>

"EJDM8drfXA6uyA"

"Rt5zm"

</pre>

 

=={{header|Python}}==

===Procedural===

{{trans|C#}}

 

def convertToBase58(num):

r = num % 58

sb = sb + ALPHABET[r]

return sb[::-1]

 

s = 25420294593250030202636073700053352635053786165627414518

b = convertToBase58(s)

 

hash_arr = [0x61, 0x626262, 0x636363, 0x73696d706c792061206c6f6e6720737472696e67, 0x516b6fcd0f, 0xbf4f89001e670274dd, 0x572e4794, 0xecac89cad93923c02321, 0x10c8511e]

for num in hash_arr:

b = convertToBase58(num)

{{out}}

<pre>25420294593250030202636073700053352635053786165627414518 -> 6UwLL9Risc3QfPqBUvKofHmBQ7wMtjvM

===Composition of pure functions===

{{Works with|Python|3.7}}

 

from functools import reduce

# MAIN ---

if __name__ == '__main__':

{{Out}}

<pre>Base 58 check encoding:

0xecac89cad93923c02321 -> EJDM8drfXA6uyA

0x10c8511e -> Rt5zm</pre>

 

=={{header|Racket}}==

(Examples from some other task)

 

(define ((base-n-alphabet-encode alphabet) hash-string (in-base 16))

"0x572e4794"

"0xecac89cad93923c02321"

{{out}}

<pre>"6UwLL9Risc3QfPqBUvKofHmBQ7wMtjvM"

'("2g" "a3gV" "aPEr" "2cFupjhnEsSn59qHXstmK2ffpLv2" "ABnLTmg" "3SEo3LWLoPntC" "3EFU7m" "EJDM8drfXA6uyA" "Rt5zm")</pre>

 

=={{header|REXX}}==

I get the result expected there.

Apart for the leading 1 the program works also for the inputs shown above.

s="123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"

Numeric Digits 100

End

o=o||substr(s,1,1)

{{out}}

<pre>16UwLL9Risc3QfPqBUvKofHmBQ7wMtjvM</pre>

===version 2===

does what the others do

s="123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"

Numeric Digits 1000

Say 'found :' o

End

{{out}}

<pre>expected: check_error_handlimng

 

The algorithm used doesn't need to &nbsp; ''reverse'' &nbsp; the residual string &nbsp; (it uses &nbsp; ''prepend'' &nbsp; instead of &nbsp; ''append'').

/*──────────────────────────────────────────────────────────────────────────────────────*/

end /*until*/

<pre>

25420294593250030202636073700053352635053786165627414518 ───► 6UwLL9Risc3QfPqBUvKofHmBQ7wMtjvM

'ECAC89CAD93923C02321'x ───► 000EJDM8drfXA6uyA

'10C8511E'x ───► Rt5zm

</pre>

 

=={{header|Ruby}}==

nums = [25420294593250030202636073700053352635053786165627414518,

0x61,

 

puts nums.map{|n| n.digits(58).reverse.map{|i| ALPHABET[i]}.join}

{{out}}

<pre>6UwLL9Risc3QfPqBUvKofHmBQ7wMtjvM

EJDM8drfXA6uyA

Rt5zm

</pre>

 

=={{header|Visual Basic .NET}}==

{{trans|C#}}

Imports System.Text

 

End Sub

 

{{out}}

<pre>25420294593250030202636073700053352635053786165627414518 -> 6UwLL9Risc3QfPqBUvKofHmBQ7wMtjvM

0xecac89cad93923c02321 -> EJDM8drfXA6uyA

0x10c8511e -> Rt5zm</pre>

 

=={{header|zkl}}==

Uses libGMP

src="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuv",

dst="123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz";

0x516b6fcd0f, "bf4f89001e670274dd", 0x572e4794,

"ecac89cad93923c02321", 0x10c8511e);

{{out}}

<pre>