Skip to content
Merged
Show file tree
Hide file tree
Changes from 9 commits
Commits
Show all changes
52 commits
Select commit Hold shift + click to select a range
5a400eb
Add Bytes.splice, an inplace variant of Buffer.slice
Amxx Jun 10, 2025
65292d5
Add Base58 library
Amxx Jun 20, 2025
99a1835
docs
Amxx Jun 20, 2025
bddf4f6
Merge branch 'feature/Bytes-splice' into feature/base58
Amxx Jun 21, 2025
88c03e7
Add Bytes.countConsecutive and Bytes.countLeading
Amxx Jun 21, 2025
a3c4667
fix
Amxx Jun 21, 2025
41b586b
efficient decoding
Amxx Jun 21, 2025
c6d6bdd
coverage
Amxx Jun 21, 2025
48bf13b
Update thirty-pugs-pick.md
Amxx Jun 21, 2025
eebd51e
docs
Amxx Jun 21, 2025
296a87e
pragma
Amxx Jun 21, 2025
8c94acc
pragma
Amxx Jun 21, 2025
d09ebfa
coverage
Amxx Jun 21, 2025
a25bd11
rewrite _encode in assembly
Amxx Jun 22, 2025
a4ce8c8
more inline documentation
Amxx Jun 22, 2025
7474f2a
test vectors
Amxx Jun 22, 2025
bef2e4f
document
Amxx Jun 22, 2025
ce1c5ad
remove auxiliary utils
Amxx Jun 22, 2025
c33e933
mload is actually cheaper than jump
Amxx Jun 23, 2025
855a1c6
up
Amxx Jun 23, 2025
ec641c7
Update contracts/utils/Base58.sol
Amxx Jun 25, 2025
7429bcc
up
Amxx Jun 26, 2025
45edb76
do base58 arithmetics in chunks of 248 bits
Amxx Jun 26, 2025
20f3611
update
Amxx Jun 26, 2025
8e60a99
codespell
Amxx Jun 26, 2025
dd8e895
decode assembly
Amxx Jun 26, 2025
45f04b4
char valdity filter
Amxx Jun 26, 2025
da84743
slither
Amxx Jun 26, 2025
c80f693
slither
Amxx Jun 27, 2025
f7ac27d
fix custom error name + testing
Amxx Aug 22, 2025
2696cd8
Apply suggestions from code review
Amxx Aug 27, 2025
1736f38
optimize zero limbs accounting
Amxx Aug 27, 2025
8652d20
Update contracts/utils/Base58.sol
Amxx Aug 27, 2025
8098fb2
Update test/utils/Base58.t.sol
Amxx Aug 27, 2025
d0ece81
Apply suggestions from code review
Amxx Sep 4, 2025
3974f6d
Merge branch 'master' into feature/base58
Amxx Sep 4, 2025
59b2866
fix compilation and update custom error name
Amxx Sep 4, 2025
66ef584
minify change by removing unecessary feature in Bytes.sol
Amxx Sep 4, 2025
8b1ae97
Apply suggestions from code review
Amxx Sep 12, 2025
bb3aaf3
Update contracts/utils/Base58.sol
Amxx Sep 12, 2025
ac75789
clarify
Amxx Sep 15, 2025
930a03f
update estimation to always overestimate
Amxx Sep 15, 2025
c3a4e76
closer approximation
Amxx Sep 15, 2025
f372c20
Update Base58.sol
Amxx Sep 16, 2025
377ec53
Enhance comments
ernestognw Sep 25, 2025
aeaa73c
fraction values
Amxx Sep 25, 2025
107328f
Update contracts/utils/Base58.sol
ernestognw Sep 25, 2025
e3268cf
Update contracts/utils/Base58.sol
ernestognw Sep 25, 2025
fe288ea
Enhance _decode comments
ernestognw Sep 25, 2025
8e32c79
Add custom error changes section in changelog
ernestognw Sep 25, 2025
0c488da
Apply suggestions from code review
Amxx Sep 26, 2025
23221e1
Update CHANGELOG.md
ernestognw Sep 26, 2025
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 5 additions & 0 deletions .changeset/afraid-chicken-attack.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,5 @@
---
'openzeppelin-solidity': minor
---

`Bytes`: Add `splice(bytes,uint256)` and `splice(bytes,uint256,uint256)`, two "in place" variants of the existing slice functions
5 changes: 5 additions & 0 deletions .changeset/loose-lamps-bake.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,5 @@
---
'openzeppelin-solidity': minor
---

`Base58`: Add a library for encoding and decoding bytes buffers into base58 strings.
5 changes: 5 additions & 0 deletions .changeset/thirty-pugs-pick.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,5 @@
---
'openzeppelin-solidity': minor
---

`Bytes`: Add `countLeading` and `countConsecutive`
1 change: 1 addition & 0 deletions contracts/mocks/Stateless.sol
Original file line number Diff line number Diff line change
Expand Up @@ -7,6 +7,7 @@ pragma solidity ^0.8.26;
import {Address} from "../utils/Address.sol";
import {Arrays} from "../utils/Arrays.sol";
import {AuthorityUtils} from "../access/manager/AuthorityUtils.sol";
import {Base58} from "../utils/Base58.sol";
import {Base64} from "../utils/Base64.sol";
import {BitMaps} from "../utils/structs/BitMaps.sol";
import {Blockhash} from "../utils/Blockhash.sol";
Expand Down
133 changes: 133 additions & 0 deletions contracts/utils/Base58.sol
Original file line number Diff line number Diff line change
@@ -0,0 +1,133 @@
// SPDX-License-Identifier: MIT

pragma solidity ^0.8.24;

import {SafeCast} from "./math/SafeCast.sol";
import {Bytes} from "./Bytes.sol";

/**
* @dev Provides a set of functions to operate with Base58 strings.
*
* Based on the original https://github.com/storyicon/base58-solidity/commit/807428e5174e61867e4c606bdb26cba58a8c5cb1[implementation of storyicon] (MIT).
*/
library Base58 {
using SafeCast for bool;
using Bytes for bytes;

error InvalidBase56Digit(uint8);

bytes internal constant _TABLE = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz";
bytes internal constant _LOOKUP_TABLE =
hex"000102030405060708ffffffffffffff090a0b0c0d0e0f10ff1112131415ff161718191a1b1c1d1e1f20ffffffffffff2122232425262728292a2bff2c2d2e2f30313233343536373839";
Copy link
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

For anyone curious, here is how you build these lookup tables:

const { ethers } = require("ethers");

const max = (...values) => values.slice(1).reduce((x, y) => (x > y ? x : y), values.at(0));
const min = (...values) => values.slice(1).reduce((x, y) => (x < y ? x : y), values.at(0));

const buildLookup = (...tables) => {
    const bTables = tables.map(table => Array.from(ethers.toUtf8Bytes(table)));
    const MINIMUM = min(...bTables.flatMap(x => x));
    const MAXIMUM = max(...bTables.flatMap(x => x));
    const lookup = Uint8Array.from(Array.from({ length: MAXIMUM - MINIMUM + 1 }).map((_, i) => bTables.map(table => table.indexOf(i + MINIMUM)).find(x => x != -1) ?? 0xff));
    const valid = tables.every(table => Object.entries(table).every(([ i, c]) => i == lookup.at(c.charCodeAt(0) - MINIMUM)));
    return valid ? { tables, lookup: ethers.hexlify(lookup), MINIMUM, MAXIMUM } : undefined;
}

console.log(buildLookup(
    "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", // base64
    "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_", // base64url
));

console.log(buildLookup(
    "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz", // base58
));


function encode(bytes memory data) internal pure returns (string memory) {
return string(_encode(data));
}

function decode(string memory data) internal pure returns (bytes memory) {
return _decode(bytes(data));
}

function _encode(bytes memory data) private pure returns (bytes memory) {
unchecked {
uint256 dataCLZ = data.countLeading(0x00);
uint256 length = dataCLZ + ((data.length - dataCLZ) * 8351) / 6115 + 1;
bytes memory slot = new bytes(length);

uint256 end = length;
for (uint256 i = 0; i < data.length; i++) {
uint256 ptr = length;
for (uint256 carry = _mload8i(data, i); ptr > end || carry != 0; --ptr) {
carry += 256 * _mload8i(slot, ptr - 1);
_mstore8i(slot, ptr - 1, uint8(carry % 58));
carry /= 58;
}
end = ptr;
}

uint256 slotCLZ = slot.countLeading(0x00);
length -= slotCLZ - dataCLZ;
slot.splice(slotCLZ - dataCLZ);

bytes memory cache = _TABLE;
for (uint256 i = 0; i < length; ++i) {
// equivalent to `slot[i] = TABLE[slot[i]];`
_mstore8(slot, i, _mload8(cache, _mload8i(slot, i)));
}

return slot;
}
}

function _decode(bytes memory data) private pure returns (bytes memory) {
unchecked {
uint256 b58Length = data.length;

uint256 size = 2 * ((b58Length * 8351) / 6115 + 1);
bytes memory binu = new bytes(size);

bytes memory cache = _LOOKUP_TABLE;
uint256 outiLength = (b58Length + 3) / 4;
// Note: allocating uint32[] would be enough, but solidity doesn't pack memory.
uint256[] memory outi = new uint256[](outiLength);
for (uint256 i = 0; i < data.length; ++i) {
// get b58 char
uint8 chr = _mload8i(data, i);
require(chr > 48 && chr < 123, InvalidBase56Digit(chr));

// decode b58 char
uint256 carry = _mload8i(cache, chr - 49);
require(carry < 58, InvalidBase56Digit(chr));

for (uint256 j = outiLength; j > 0; --j) {
uint256 value = carry + 58 * outi[j - 1];
carry = value >> 32;
outi[j - 1] = value & 0xffffffff;
}
}

uint256 ptr = 0;
uint256 mask = ((b58Length - 1) % 4) + 1;
for (uint256 j = 0; j < outiLength; ++j) {
while (mask > 0) {
--mask;
_mstore8(binu, ptr, bytes1(uint8(outi[j] >> (8 * mask))));
ptr++;
}
mask = 4;
}

uint256 dataCLZ = data.countLeading(0x31);
uint256 msb = binu.countConsecutive(dataCLZ, 0x00);
return binu.splice(msb * (dataCLZ + msb < binu.length).toUint(), ptr);
}
}

function _mload8(bytes memory buffer, uint256 offset) private pure returns (bytes1 value) {
// This is not memory safe in the general case, but all calls to this private function are within bounds.
assembly ("memory-safe") {
value := mload(add(add(buffer, 0x20), offset))
}
}

function _mload8i(bytes memory buffer, uint256 offset) private pure returns (uint8 value) {
// This is not memory safe in the general case, but all calls to this private function are within bounds.
assembly ("memory-safe") {
value := shr(248, mload(add(add(buffer, 0x20), offset)))
}
}

function _mstore8(bytes memory buffer, uint256 offset, bytes1 value) private pure {
// This is not memory safe in the general case, but all calls to this private function are within bounds.
assembly ("memory-safe") {
mstore8(add(add(buffer, 0x20), offset), shr(248, value))
}
}

function _mstore8i(bytes memory buffer, uint256 offset, uint8 value) private pure {
// This is not memory safe in the general case, but all calls to this private function are within bounds.
assembly ("memory-safe") {
mstore8(add(add(buffer, 0x20), offset), value)
}
}
}
65 changes: 65 additions & 0 deletions contracts/utils/Bytes.sol
Original file line number Diff line number Diff line change
Expand Up @@ -68,6 +68,42 @@ library Bytes {
}
}

/**
* @dev Count number of occurrences of `search` at the beginning of `buffer`.
*/
function countLeading(bytes memory buffer, bytes1 search) internal pure returns (uint256) {
return countConsecutive(buffer, 0, search);
}

/**
* @dev Count number of occurrences of `search` in `buffer`, starting from position `offset`.
*/
function countConsecutive(bytes memory buffer, uint256 offset, bytes1 search) internal pure returns (uint256 i) {
uint256 length = buffer.length;
if (offset > length) return 0;

assembly ("memory-safe") {
let chunk
let end := sub(length, offset)
for {
i := 0
} lt(i, end) {
i := add(i, 1)
} {
// every 32 bytes, load a new chunk
if iszero(mod(i, 0x20)) {
chunk := mload(add(buffer, add(0x20, add(offset, i))))
}
// if the first byte of the chunk does not match the search element, exit
if shr(248, xor(chunk, search)) {
break
}
// shift chunk
chunk := shl(8, chunk)
}
}
}

/**
* @dev Copies the content of `buffer`, from `start` (included) to the end of `buffer` into a new bytes object in
* memory.
Expand Down Expand Up @@ -99,6 +135,35 @@ library Bytes {
return result;
}

/**
* @dev In place slice: moves the content of `buffer`, from `start` (included) to the end of `buffer` to the start of that buffer.
*
* NOTE: This function modifies the provided buffer in place. If you need to preserve the original buffer, use {slice} instead
*/
function splice(bytes memory buffer, uint256 start) internal pure returns (bytes memory) {
return splice(buffer, start, buffer.length);
}

/**
* @dev In place slice: moves the content of `buffer`, from `start` (included) to end (excluded) to the start of that buffer.
*
* NOTE: This function modifies the provided buffer in place. If you need to preserve the original buffer, use {slice} instead
*/
function splice(bytes memory buffer, uint256 start, uint256 end) internal pure returns (bytes memory) {
// sanitize
uint256 length = buffer.length;
end = Math.min(end, length);
start = Math.min(start, end);

// allocate and copy
assembly ("memory-safe") {
mcopy(add(buffer, 0x20), add(add(buffer, 0x20), start), sub(end, start))
mstore(buffer, sub(end, start))
}

return buffer;
}

/**
* @dev Reads a bytes32 from a bytes array without bounds checking.
*
Expand Down
3 changes: 3 additions & 0 deletions contracts/utils/README.adoc
Original file line number Diff line number Diff line change
Expand Up @@ -24,6 +24,7 @@ Miscellaneous contracts and libraries containing utility functions you can use t
* {Create2}: Wrapper around the https://blog.openzeppelin.com/getting-the-most-out-of-create2/[`CREATE2` EVM opcode] for safe use without having to deal with low-level assembly.
* {Address}: Collection of functions for overloading Solidity's https://docs.soliditylang.org/en/latest/types.html#address[`address`] type.
* {Arrays}: Collection of functions that operate on https://docs.soliditylang.org/en/latest/types.html#arrays[`arrays`].
* {Base58}: On-chain base58 encoding and decoding.
* {Base64}: On-chain base64 and base64URL encoding according to https://datatracker.ietf.org/doc/html/rfc4648[RFC-4648].
* {Bytes}: Common operations on bytes objects.
* {Calldata}: Helpers for manipulating calldata.
Expand Down Expand Up @@ -105,6 +106,8 @@ Ethereum contracts have no native concept of an interface, so applications must

{{Arrays}}

{{Base58}}

{{Base64}}

{{Bytes}}
Expand Down
24 changes: 24 additions & 0 deletions test/utils/Base58.t.sol
Original file line number Diff line number Diff line change
@@ -0,0 +1,24 @@
// SPDX-License-Identifier: MIT

pragma solidity ^0.8.20;

import {Test} from "forge-std/Test.sol";
import {Base58} from "@openzeppelin/contracts/utils/Base58.sol";

contract Base58Test is Test {
function testEncodeDecodeEmpty() external pure {
assertEq(Base58.decode(Base58.encode("")), "");
}

function testEncodeDecodeZeros() external pure {
bytes memory zeros = hex"0000000000000000";
assertEq(Base58.decode(Base58.encode(zeros)), zeros);

bytes memory almostZeros = hex"00000000a400000000";
assertEq(Base58.decode(Base58.encode(almostZeros)), almostZeros);
}

function testEncodeDecode(bytes memory input) external pure {
assertEq(Base58.decode(Base58.encode(input)), input);
}
}
37 changes: 37 additions & 0 deletions test/utils/Base58.test.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,37 @@
const { ethers } = require('hardhat');
const { expect } = require('chai');
const { loadFixture } = require('@nomicfoundation/hardhat-network-helpers');

async function fixture() {
const mock = await ethers.deployContract('$Base58');
return { mock };
}

describe('Base58', function () {
beforeEach(async function () {
Object.assign(this, await loadFixture(fixture));
});

describe('base58', function () {
describe('encode/decode', function () {
for (const length of [0, 1, 2, 3, 4, 32, 42, 128, 384]) // 512 runs out of gas
it(`buffer of length ${length}`, async function () {
const buffer = ethers.randomBytes(length);
const hex = ethers.hexlify(buffer);
const b58 = ethers.encodeBase58(buffer);

await expect(this.mock.$encode(hex)).to.eventually.equal(b58);
await expect(this.mock.$decode(b58)).to.eventually.equal(hex);
});
});

describe('decode invalid format', function () {
for (const chr of ['I', '-', '~'])
it(`Invalid base58 char ${chr}`, async function () {
await expect(this.mock.$decode(`VYRWKp${chr}pnN7`))
.to.be.revertedWithCustomError(this.mock, 'InvalidBase56Digit')
.withArgs(chr.codePointAt(0));
});
});
});
});
14 changes: 7 additions & 7 deletions test/utils/Base64.test.js
Original file line number Diff line number Diff line change
Expand Up @@ -11,7 +11,7 @@ async function fixture() {
return { mock };
}

describe('Strings', function () {
describe('Base64', function () {
beforeEach(async function () {
Object.assign(this, await loadFixture(fixture));
});
Expand All @@ -27,8 +27,8 @@ describe('Strings', function () {
])
it(title, async function () {
const buffer = Buffer.from(input, 'ascii');
expect(await this.mock.$encode(buffer)).to.equal(ethers.encodeBase64(buffer));
expect(await this.mock.$encode(buffer)).to.equal(expected);
await expect(this.mock.$encode(buffer)).to.eventually.equal(ethers.encodeBase64(buffer));
await expect(this.mock.$encode(buffer)).to.eventually.equal(expected);
});
});

Expand All @@ -43,8 +43,8 @@ describe('Strings', function () {
])
it(title, async function () {
const buffer = Buffer.from(input, 'ascii');
expect(await this.mock.$encodeURL(buffer)).to.equal(base64toBase64Url(ethers.encodeBase64(buffer)));
expect(await this.mock.$encodeURL(buffer)).to.equal(expected);
await expect(this.mock.$encodeURL(buffer)).to.eventually.equal(base64toBase64Url(ethers.encodeBase64(buffer)));
await expect(this.mock.$encodeURL(buffer)).to.eventually.equal(expected);
});
});

Expand All @@ -53,7 +53,7 @@ describe('Strings', function () {
const buffer32 = ethers.id('example');
const buffer31 = buffer32.slice(0, -2);

expect(await mock.encode(buffer31)).to.equal(ethers.encodeBase64(buffer31));
expect(await mock.encode(buffer32)).to.equal(ethers.encodeBase64(buffer32));
await expect(mock.encode(buffer31)).to.eventually.equal(ethers.encodeBase64(buffer31));
await expect(mock.encode(buffer32)).to.eventually.equal(ethers.encodeBase64(buffer32));
});
});
Loading
Loading