Skip to content
Open
Show file tree
Hide file tree
Changes from 30 commits
Commits
Show all changes
38 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
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
207 changes: 207 additions & 0 deletions contracts/utils/Base58.sol
Original file line number Diff line number Diff line change
@@ -0,0 +1,207 @@
// SPDX-License-Identifier: MIT

pragma solidity ^0.8.20;

/**
* @dev Provides a set of functions to operate with Base58 strings.
*
* Initially based on https://github.com/storyicon/base58-solidity/commit/807428e5174e61867e4c606bdb26cba58a8c5cb1[storyicon's implementation] (MIT).
* Based on the updated and improved https://github.com/Vectorized/solady/blob/main/src/utils/Base58.sol[Vectorized version] (MIT).
*/
library Base58 {
error InvalidBase58Digit(bytes1);
Copy link
Contributor

@arr00 arr00 Sep 3, 2025

Choose a reason for hiding this comment

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

"character" or "value" fits better here


/**
* @dev Encode a `bytes` buffer as a Base58 `string`.
*/
function encode(bytes memory input) internal pure returns (string memory) {
return string(_encode(input));
}

/**
* @dev Decode a Base58 `string` into a `bytes` buffer.
*/
function decode(string memory input) internal pure returns (bytes memory) {
return _decode(bytes(input));
}

function _encode(bytes memory input) private pure returns (bytes memory output) {
uint256 inputLength = input.length;
if (inputLength == 0) return "";

assembly ("memory-safe") {
// Count number of zero bytes at the beginning of `input`. These are encoded using the same number of '1's
// at then beginning of the encoded string.
let inputLeadingZeros := 0
for {} lt(byte(0, mload(add(add(input, 0x20), inputLeadingZeros))), lt(inputLeadingZeros, inputLength)) {} {
inputLeadingZeros := add(inputLeadingZeros, 1)
}

// Start the output offset by an over-estimate of the length.
let outputLengthEstim := add(inputLeadingZeros, div(mul(sub(inputLength, inputLeadingZeros), 8351), 6115))
Copy link
Collaborator Author

Choose a reason for hiding this comment

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

FYI:
8351 / 6115 = 1.365658217497956
is an estimation of
Math.log2(256) / Math.log2(58) = 1.365658237309761


// This is going to be our "scratch" workspace. Be leave enough room on the left to store length + encoded input.
let scratch := add(mload(0x40), add(outputLengthEstim, 0x21))

// Cut the input buffer in section (limbs) of 31 bytes (248 bits). Store in scratch.
let ptr := scratch
for {
// first section is possibly smaller than 31 bytes
let i := mod(inputLength, 31)
// unfold first loop, with a different shift.
Copy link
Collaborator Author

Choose a reason for hiding this comment

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

Suggested change
// unfold first loop, with a different shift.
// If inputLength is not a multiple of 31, unfold the first loop:
// Load the first i bytes from the input, right align them, and store them in scratch (at ptr) in a dedicated 32 bytes space.

if i {
mstore(ptr, shr(mul(sub(32, i), 8), mload(add(input, 0x20))))
ptr := add(ptr, 0x20)
}
} lt(i, inputLength) {
ptr := add(ptr, 0x20) // next limb
i := add(i, 31) // move in buffer
} {
// Load 32 bytes from the input buffer and shift to only keep the 31 leftmost.
mstore(ptr, shr(8, mload(add(add(input, 0x20), i))))
}

// Store the encoding table. This overlaps with the FMP that we are going to reset later anyway.
// See sections 2 of https://inputtracker.ietf.org/doc/html/draft-msporny-base58-03
mstore(0x1f, "123456789ABCDEFGHJKLMNPQRSTUVWXY")
mstore(0x3f, "Zabcdefghijkmnopqrstuvwxyz")

// Encoding the "input" part of the result.
// `output` point the the left part of the encoded string. we start from scratch, which means we have
Copy link
Collaborator Author

Choose a reason for hiding this comment

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

Suggested change
// `output` point the the left part of the encoded string. we start from scratch, which means we have
// `output` point the the left part of the encoded string. we start from the `scratch` pointer, which means we have

// outputLengthEstim bytes to work with before hitting the FMP
for {
output := scratch
} 1 {} {
// check if there are non-zero limbs remaining
let i := scratch
for {} and(iszero(mload(i)), lt(i, ptr)) {
i := add(i, 0x20)
} {}
if eq(i, ptr) {
break
}

// base 58 arithmetic on the 248bits limbs
Copy link
Collaborator Author

Choose a reason for hiding this comment

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

Suggested change
// base 58 arithmetic on the 248bits limbs
// base 58 arithmetic on the 248bits limbs:
// we compute the remainder modulo 58 of the value encoded in the limbs,
// all while dividing the value encoded in the limbs by 58

let carry := 0
for {
i := scratch
} lt(i, ptr) {
i := add(i, 0x20)
} {
let acc := add(shl(248, carry), mload(i))
Copy link
Collaborator Author

@Amxx Amxx Aug 27, 2025

Choose a reason for hiding this comment

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

Suggested change
let acc := add(shl(248, carry), mload(i))
// Load the next limb and add the carry (limbs are 248bits objects)
let acc := add(shl(248, carry), mload(i))

mstore(i, div(acc, 58))
Copy link
Collaborator Author

Choose a reason for hiding this comment

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

Suggested change
mstore(i, div(acc, 58))
// store the updated limb (divided by 58)
mstore(i, div(acc, 58))

carry := mod(acc, 58)
Copy link
Collaborator Author

Choose a reason for hiding this comment

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

Suggested change
carry := mod(acc, 58)
// carry the remainder (modulo 58)
carry := mod(acc, 58)

}

// encode carry using base58 table, and add it to the output
output := sub(output, 1)
mstore8(output, mload(carry))
}

// Write the input leading zeros at the left of the encoded.
// This will spill to the left into the "length" of the buffer.
for {
let i := 0
} lt(i, inputLeadingZeros) {} {
i := add(i, 0x20)
mstore(sub(output, i), "11111111111111111111111111111111")
}

// Move output pointer to account for inputLeadingZeros
output := sub(output, add(inputLeadingZeros, 0x20))

// Store length and allocate (reserve) memory up to scratch.
mstore(output, sub(scratch, add(output, 0x20)))
mstore(0x40, scratch)
}
}

function _decode(bytes memory input) private pure returns (bytes memory output) {
bytes4 errorSelector = InvalidBase58Digit.selector;

uint256 inputLength = input.length;
if (inputLength == 0) return "";

/// @solidity memory-safe-assembly
assembly {
let inputLeadingZeros := 0 // Number of leading '1' in `input`.
// Count leading zeros. In base58, zeros are represented using '1' (chr(49)).
for {} and(
eq(byte(0, mload(add(add(input, 0x20), inputLeadingZeros))), 49),
lt(inputLeadingZeros, inputLength)
) {} {
inputLeadingZeros := add(inputLeadingZeros, 1)
}

// Start the output offset by an over-estimate of the length.
let outputLengthEstim := add(inputLeadingZeros, div(mul(sub(inputLength, inputLeadingZeros), 6115), 8351))

// This is going to be our "scratch" workspace. Be leave enough room on the left to store length + encoded input.
let scratch := add(mload(0x40), add(outputLengthEstim, 0x21))

// Store the decoding table. This overlaps with the FMP that we are going to reset later anyway.
mstore(0x2a, 0x30313233343536373839)
mstore(0x20, 0x1718191a1b1c1d1e1f20ffffffffffff2122232425262728292a2bff2c2d2e2f)
mstore(0x00, 0x000102030405060708ffffffffffffff090a0b0c0d0e0f10ff1112131415ff16)

// Decode each char of the input string, and stored that in section (limbs) of 31 bytes. Store in scratch.
let ptr := scratch
let mask := shr(8, not(0))
for {
let j := 0
} lt(j, inputLength) {
j := add(j, 1)
} {
// for each char, decode it ...
let c := sub(byte(0, mload(add(add(input, 0x20), j))), 49)
// slither-disable-next-line incorrect-shift
if iszero(and(shl(c, 1), 0x3fff7ff03ffbeff01ff)) {
mstore(0, errorSelector)
mstore(4, shl(248, add(c, 49)))
revert(0, 0x24)
}
let carry := byte(0, mload(c))

// ... and add it to the limbs starting a `scratch`
for {
let i := scratch
} lt(i, ptr) {
i := add(i, 0x20)
} {
let acc := add(carry, mul(58, mload(i)))
mstore(i, and(mask, acc))
carry := shr(248, acc)
}
// If the char just read result in a leftover carry, extend the limbs with the new value
if carry {
mstore(ptr, carry)
ptr := add(ptr, 0x20)
}
}

// Copy and compact the uint248 limbs + remove any zeros at the beginning.
output := scratch
for {
let i := scratch
} lt(i, ptr) {
i := add(i, 0x20)
} {
output := sub(output, 31)
mstore(sub(output, 1), mload(i))
}
for {} lt(byte(0, mload(output)), lt(output, scratch)) {} {
output := add(output, 1)
}

// Add the zeros that were encoded in the input (prefix '1's)
calldatacopy(sub(output, inputLeadingZeros), calldatasize(), inputLeadingZeros)

// Move output pointer to account for inputLeadingZeros
output := sub(output, add(inputLeadingZeros, 0x20))

// Store length and allocate (reserve) memory up to scratch.
mstore(output, sub(scratch, add(output, 0x20)))
mstore(0x40, scratch)
}
}
}
6 changes: 3 additions & 3 deletions contracts/utils/Base64.sol
Original file line number Diff line number Diff line change
Expand Up @@ -8,21 +8,21 @@ pragma solidity ^0.8.20;
*/
library Base64 {
/**
* @dev Base64 Encoding/Decoding Table
* @dev Base64 encoding table
* See sections 4 and 5 of https://datatracker.ietf.org/doc/html/rfc4648
*/
string internal constant _TABLE = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
string internal constant _TABLE_URL = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_";

/**
* @dev Converts a `bytes` to its Bytes64 `string` representation.
* @dev Converts a `bytes` to its Base64 `string` representation.
*/
function encode(bytes memory data) internal pure returns (string memory) {
return _encode(data, _TABLE, true);
}

/**
* @dev Converts a `bytes` to its Bytes64Url `string` representation.
* @dev Converts a `bytes` to its Base64Url `string` representation.
* Output is not padded with `=` as specified in https://www.rfc-editor.org/rfc/rfc4648[rfc4648].
*/
function encodeURL(bytes memory data) internal pure returns (string memory) {
Expand Down
51 changes: 51 additions & 0 deletions contracts/utils/Bytes.sol
Original file line number Diff line number Diff line change
Expand Up @@ -68,6 +68,28 @@ 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 = Math.saturatingSub(buffer.length, offset);
assembly ("memory-safe") {
for {
let ptr := add(add(buffer, 0x20), offset)
i := 0
} and(iszero(shr(248, xor(mload(add(ptr, i)), search))), lt(i, length)) {
i := add(i, 1)
} {}
}
}

/**
* @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 +121,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.26;

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);
}
}
Loading