CAIP2.sol 1.8 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950
  1. // SPDX-License-Identifier: MIT
  2. pragma solidity ^0.8.24;
  3. import {Bytes} from "./Bytes.sol";
  4. import {Strings} from "./Strings.sol";
  5. /**
  6. * @dev Helper library to format and parse CAIP-2 identifiers
  7. *
  8. * https://github.com/ChainAgnostic/CAIPs/blob/main/CAIPs/caip-2.md[CAIP-2] defines chain identifiers as:
  9. * chain_id: namespace + ":" + reference
  10. * namespace: [-a-z0-9]{3,8}
  11. * reference: [-_a-zA-Z0-9]{1,32}
  12. *
  13. * WARNING: In some cases, multiple CAIP-2 identifiers may all be valid representation of a single chain.
  14. * For EVM chains, it is recommended to use `eip155:xxx` as the canonical representation (where `xxx` is
  15. * the EIP-155 chain id). Consider the possible ambiguity when processing CAIP-2 identifiers or when using them
  16. * in the context of hashes.
  17. */
  18. library CAIP2 {
  19. using Strings for uint256;
  20. using Bytes for bytes;
  21. /// @dev Return the CAIP-2 identifier for the current (local) chain.
  22. function local() internal view returns (string memory) {
  23. return format("eip155", block.chainid.toString());
  24. }
  25. /**
  26. * @dev Return the CAIP-2 identifier for a given namespace and reference.
  27. *
  28. * NOTE: This function does not verify that the inputs are properly formatted.
  29. */
  30. function format(string memory namespace, string memory ref) internal pure returns (string memory) {
  31. return string.concat(namespace, ":", ref);
  32. }
  33. /**
  34. * @dev Parse a CAIP-2 identifier into its components.
  35. *
  36. * NOTE: This function does not verify that the CAIP-2 input is properly formatted.
  37. */
  38. function parse(string memory caip2) internal pure returns (string memory namespace, string memory ref) {
  39. bytes memory buffer = bytes(caip2);
  40. uint256 pos = buffer.indexOf(":");
  41. return (string(buffer.slice(0, pos)), string(buffer.slice(pos + 1)));
  42. }
  43. }