Product Code Database
Example Keywords: tetris -trousers $44-165
   » » Wiki: Ascii85
Tag Wiki 'Ascii85'.

Ascii85, also called Base85, is a form of binary-to-text encoding developed by Paul E. Rutter for the utility. By using five characters to represent four bytes of (making the encoded size ¹⁄₄ larger than the original, assuming eight bits per ASCII character), it is more efficient than or Base64, which use four characters to represent three bytes of data (¹⁄₃ increase, assuming eight bits per ASCII character).

Its main modern uses are in 's and Portable Document Format file formats, as well as in the patch encoding for used by .

Basic idea
The basic need for a binary-to-text encoding comes from a need to communicate arbitrary over preexisting communications protocols that were designed to carry only English language text. Those communication protocols may only be 7-bit safe (and within that avoid certain ASCII control codes), and may require line breaks at certain maximum intervals, and may not maintain whitespace. Thus, only the 95 printable ASCII characters are "safe" to use to convey data.

Four bytes can represent 232 = 4,294,967,296 possible values. Five -85 digits provide 855 = 4,437,053,125 possible values, enough to provide for a unique representation for each possible 32-bit value. Because five radix-84 digits only provide 845 = 4,182,119,424 representable values, 85 is the minimum possible integral base that will represent four bytes in five characters, hence its choice.

When encoding, each group of 4 bytes is taken as a 32-bit binary number, most significant byte first (Ascii85 uses a convention). This is converted, by repeatedly dividing by 85 and taking the remainder, into 5 radix-85 digits. Then each digit (again, most significant first) is encoded as an ASCII printable character by adding 33 to it, giving the ASCII characters 33 ("!") through 117 ("u").

Because all-zero data is quite common, an exception is made for the sake of , and an all-zero group is encoded as a single character "z" instead of "!!!!!".

Groups of characters that decode to a value greater than (encoded as "s8W-!") will cause a decoding error, as will "z" characters in the middle of a group. White space between the characters is ignored and may occur anywhere to accommodate line-length limitations.

One disadvantage of Ascii85 is that encoded data may contain such as backslash and quote, which have special meaning in many programming languages and in some text-based protocols. Other base-85 encodings like Z85 are designed to be safe in source code. "Z85 - ZeroMQ Base-85 Encoding Algorithm"


btoa version
The original btoa program always encoded full groups (padding the source as necessary), with a prefix line of "xbtoa Begin", and suffix line of "xbtoa End", followed by the original file length (in decimal and ) and three 32-bit . The decoder needs to use the file length to see how much of the group was padding. The initial proposal for btoa encoding used an encoding alphabet starting at the ASCII space character through "t" inclusive, but this was replaced with an encoding alphabet of "!" to "u" to avoid "problems with some mailers (stripping off trailing blanks)." This program also introduced the special "z" short form for an all-zero group. Version 4.2 added a "y" exception for a group of all ASCII space characters (0x20202020).

ZMODEM version
"ZMODEM Pack-7 encoding" encodes groups of 4 octets into groups of 5 printable ASCII characters, similar to Ascii85 (or perhaps exactly the same?). When programs send pre-compressed 8-bit data files over 7-bit data channels, it uses "ZMODEM Pack-7 encoding".Chuck Forsberg. . "ZMODEM Pack-7 packs 4 bytes into 5 printing characters."

Adobe version
Adobe adopted the basic btoa encoding, but with slight changes, and gave it the name Ascii85. The characters used are the ASCII characters 33 (!) through 117 (u) inclusive (to represent the base-85 digits 0 through 84), together with the letter z (as a special case to represent a 32-bit 0 value), and white space is ignored. Adobe uses the delimiter "~>" to mark the end of an Ascii85-encoded string, and represents the length by truncating the final group: If the last block of source bytes contains fewer than 4 bytes, the block is padded with up to three null bytes before encoding. After encoding, as many bytes as were added as padding are removed from the end of the output.

The reverse is applied when decoding: The last block is padded to 5 bytes with the Ascii85 character "u", and as many bytes as were added as padding are omitted from the end of the output (see example).

NOTE: The padding is not arbitrary. Converting from binary to base 64 only regroups bits and does not change them or their order (a high bit in binary does not affect the low bits in the base64 representation). In converting a binary number to base85 (85 is not a power of two) high bits do affect the low order base85 digits and conversely. Padding the binary low (with zero bits) while encoding and padding the base85 value high (with 'u's) in decoding assures that the high order bits are preserved (the zero padding in the binary gives enough room so that a small addition is trapped and there is no "carry" to the high bits).

In Ascii85-encoded blocks, whitespace and line-break characters may be present anywhere, including in the middle of a 5-character block, but they must be silently ignored.

Adobe's specification does not support the "y" exception.

ZeroMQ Version (Z85)
Z85, the base-85 encoding algorithm, is a string-safe variant of base85. By avoiding the double-quote, single-quote, and backslash characters, Z85-encoded data can be better embedded in command-line interpreter strings. Z85 uses the characters 0...9, a...z, A...Z, ., -, :, +, =, ^, !, /, *, ?, &, <, >, (, ), [, ], {, }, @, %, $, #.Pieter Hintjens RFC 32/Z85 - ZeroMQ Base-85 Encoding Algorithm

Example for Ascii85
A quote from Leviathan:

Man is distinguished, not only by his reason, but by this singular passion from other animals, which is a lust of the mind, that by a perseverance of delight in the continued and indefatigable generation of knowledge, exceeds the short vehemence of any carnal pleasure.

If this is initially encoded using US-ASCII, it can be reencoded in Ascii85 as follows:


! Text content
'''M''''''a''''''n'''''' '''...'''s''''''u''''''r''''''e'''
! ASCII| colspan="8" align="center" 77 9711032...115117114101
! Bit pattern|0||1||0||0||1||1||0||1||0||1||1||0||0||0||0||1||0||1||1||0||1||1||1||0||0||0||1||0||0||0||0||00 ... 0||1||1||1||0||0||1||1||0||1||1||1||0||1||0||1||0||1||1||1||0||0||1||0||0||1||1||0||0||1||0|1
! 32-bit Value| colspan="32" align="center" 1,298,230,816 = 24×854 + 73×853 + 80×852 + 78×85 + 61 ...1,937,076,837 = 37×854 + 9×853 + 17×852 + 44×85 + 22
! Base 85 (+33)| colspan="6" align="center" 24 (57) 73 (106)80 (113)78 (111)61 (94)...37 (70)9 (42)17 (50)44 (77)22 (55)
! ASCII| colspan="6" align="center" 9 jqo^...F*2M7

Since the last 4-tuple is incomplete, it must be padded with three zero bytes:

! Text content
! ASCII| colspan="8" align="center" 46 000
! Bit pattern 0||0||1||0||1||1||1||0||0||0||0||0||0||0||0||0||0||0||0||0||0||0||0||0||0||0||0||0||0||0||0|0
! 32-bit Value| colspan="32" align="center" 771,751,936 = 14×854 + 66×853 + 56×852 + 74×85 + 46
! Base 85 (+33)| colspan="6" align="center" 14 (47) 66 (99)56 (89)74 (107)46 (79)
! ASCII| colspan="6" align="center" / c''Y''''k''''O''

Since three bytes of padding had to be added, the three final characters 'YkO' are omitted from the output.

Decoding is done inversely, except that the last 5-tuple is padded with 'u' characters:

! Base 85 (+33)| colspan="6" align="center" 14 (47) 66 (99)84 (117)84 (117)84 (117)
! 32-bit Value| colspan="32" align="center" 771,955,124 = 14×854 + 66×853 + 84×852 + 84×85 + 84
! Bit pattern 0||0||1||0||1||1||1||0||0||0||0||0||0||0||1||1||0||0||0||1||1||0||0||1||1||0||1||1||0||1||0|0
! ASCII| colspan="8" align="center" 46 325180
! Text content| colspan="8" align="center" '''.''' ''[ ETX ]''''[ EM ]''''´ ([[Extended ASCII]])''

Since the input had to be padded with three 'u' bytes, the last three bytes of the output are ignored and we end up with the original period.

The input sentence does not contain 4 consecutive zero bytes, so the example does not show the use of the 'z' abbreviation.

The Ascii85 encoding is compatible with 7-bit and 8-bit , while having less overhead than Base64.

One potential compatibility issue of Ascii85 is that 'single' and "double" quotation marks, brackets, and ampersands (&) cannot be used unescaped in markup languages like XML or SGML.

RFC 1924 version
Published on April 1, 1996, informational : "A Compact Representation of IPv6 Addresses" by Robert Elz suggests a base-85 encoding of IPv6 addresses. This differs from the scheme used above in that he proposes a different set of 85 ASCII characters, and proposes to do all arithmetic on the 128-bit number, converting it to a single 20-digit base-85 number (internal whitespace not allowed), rather than breaking it into four 32-bit groups.

The proposed character set is, in order, 0–9, A–Z, a–z, and then the 23 characters !#$%&amp;()*+-;&lt;=&gt;?@^_`{|}~. The highest possible representable address, 2128−1 = 74×8519 + 53×8518 + 5×8517 + ..., would be encoded as =r54lj&amp;NUUO~Hi%c2ym0.

This character set excludes the characters "',./:[\]&nbsp;, making it suitable for use in strings (where " and \ would require escaping). However, for -based protocols, notably including , string escapes may still be required (to accommodate &lt;, &gt; and &amp;).

See also
  • Base32
  • Base36
  • Base64
  • Binary-to-text encoding for a comparison of various encoding algorithms
  • PostScript Standard Encoding

External links

Page 1 of 1
Page 1 of 1


Pages:  ..   .. 
Items:  .. 


General: Atom Feed Atom Feed  .. 
Help:  ..   .. 
Category:  ..   .. 
Media:  ..   .. 
Posts:  ..   ..   .. 


Page:  .. 
Summary:  .. 
1 Tags
10/10 Page Rank
5 Page Refs