Binary numeral system

Binary numeral system
Name	Binary numeral system
Other names	Base-2, bin
Digits	0, 1
Invented	Ancient and modern developments
Designer	Multiple contributors

Binary numeral system The binary numeral system is a positional notation using two symbols, commonly 0 and 1, that underpins modern Turing-era computer architecture, digital electronics, and information theory. Originating in antiquity and formalized through contributions by figures such as Gottfried Wilhelm Leibniz, the system provides a compact representation for integers, rational numbers, and encodings used in protocols by organizations like International Organization for Standardization and implementations by Intel Corporation and IBM. Its mathematical simplicity enables implementations across devices from ENIAC-era machines to contemporary ARM processors and cloud datacenters run by Amazon and Google.

History

Binary concepts appear in texts from Pingala, whose work influenced later scholars and was revisited in contexts like the I Ching. Formal modernization is often attributed to Gottfried Wilhelm Leibniz, who published on binary representation and linked it to Christianity and metaphysical ideas in his correspondence with Princess Caroline of Brandenburg-Ansbach and others. Developments in Boolean algebra by George Boole and switching theory by Claude Shannon provided the theoretical and practical bridge to electrical implementations by firms such as Bell Labs and early computers like Manchester Mark 1. Later milestones include the adoption of binary in hardware design at companies such as IBM, proposals by John von Neumann for stored-program computers, and advances in microprocessor design at Intel Corporation and ARM Holdings.

Mathematical properties

Working in base-2 imposes algebraic properties exploited in number theory and computer science. Integers expressed in binary correspond to polynomials evaluated at 2, a viewpoint used by Évariste Galois-inspired finite field constructions and algorithms in Richard Dedekind-influenced algebraic number theory. Binary arithmetic follows ring and group axioms under addition and multiplication, with carries and borrow operations analogous to structures studied by Carl Friedrich Gauss. Bitwise operations correspond to Boolean algebra introduced by George Boole and later axiomatized by Emil Post and Alonzo Church, with complexity results related to classes studied by Stephen Cook and Alan Turing. Representation limits and periodic expansions connect to results from Joseph Fourier in spectral analysis and to coding theorems by Claude Shannon.

Representation and notation

Binary notation uses sequences of bits; positional weights are powers of two (2^n). Standard notations include unsigned binary used in systems from Intel Corporation CPUs to microcontrollers by ARM, two's complement developed to simplify subtraction in processors influenced by designs at Bell Labs and described in contexts by John von Neumann, sign-magnitude representation, and one's complement. Floating-point formats standardized by IEEE 754 utilize binary significands and exponents for representation in processors from Intel Corporation and AMD. Text encodings mapping characters to bit patterns include standards by ISO/IEC 10646 and earlier specifications like ASCII created by the American National Standards Institute and implemented across systems by IBM and Hewlett-Packard.

Arithmetic and algorithms

Binary arithmetic algorithms mirror decimal methods but optimize for bit-level operations; addition uses full-adder and half-adder circuits popularized in designs from Texas Instruments and Fairchild Semiconductor. Multiplication and division algorithms range from shift-and-add to fast methods like Booth's algorithm and Montgomery reduction used in cryptography by protocols adopted in RSA Conference-era standards and libraries by OpenSSL contributors. Fast Fourier transform implementations leveraging binary-friendly radix-2 algorithms influence work by James Cooley and John Tukey and are critical in digital signal processors from Analog Devices and Qualcomm. Complexity analyses reference results by Donald Knuth and Michael Rabin in algorithmic efficiency and randomization contexts.

Applications and implementations

Binary is foundational in digital logic used in integrated circuits designed by companies like Intel Corporation, AMD, and NVIDIA. Networking protocols standardized by organizations such as Internet Engineering Task Force encode headers as bit fields; storage systems by Seagate Technology and Western Digital organize data in binary sectors. Cryptographic systems developed by researchers at MIT and RSA Laboratories rely on binary arithmetic for public-key algorithms, while error-correcting codes from Claude Shannon's legacy are implemented in hardware by Xilinx and Broadcom. Applications span embedded controllers in Siemens industrial systems, mobile SoCs by Qualcomm, and supercomputing platforms at institutions like Lawrence Berkeley National Laboratory.

Encoding and data structures

Binary underlies common encodings and data structures: bitmap images and formats from Joint Photographic Experts Group use bitplanes; compressed formats like ZIP (file format) and MPEG employ binary-coded Huffman trees and arithmetic coding standardized in collaborations involving Moving Picture Experts Group. Data structures such as bitsets, tries, and bloom filters are central to systems developed at Google and Facebook for large-scale indexing and deduplication, while serialization formats like Protocol Buffers and MessagePack define compact binary wire formats used by Netflix and Twitter. Low-level storage formats and file systems by Microsoft and Apple Inc. align on binary block and inode layouts to optimize performance on hardware by Western Digital and Samsung Electronics.

Category:Number systems