@algorandfoundation/algokit-utils 10.0.0-alpha.8 → 10.0.0-beta.1

package/packages/algo25/src/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","names":["buffer11: number[]","english","hash","buffer8: number[]"],"sources":["../../../../packages/algo25/src/index.ts"],"sourcesContent":["import english from './english.js'\nimport { hash } from '@algorandfoundation/algokit-common'\nexport const FAIL_TO_DECODE_MNEMONIC_ERROR_MSG = 'failed to decode mnemonic'\nexport const NOT_IN_WORDS_LIST_ERROR_MSG = 'the mnemonic contains a word that is not in the wordlist'\n\nconst SEED_BTYES_LENGTH = 32\n\n// https://stackoverflow.com/a/51452614\nfunction toUint11Array(buffer8: Uint8Array | number[]): number[] {\n  const buffer11: number[] = []\n  let acc = 0\n  let accBits = 0\n  function add(octet: number) {\n    acc |= octet << accBits\n    accBits += 8\n    if (accBits >= 11) {\n      buffer11.push(acc & 0x7ff)\n      acc >>= 11\n      accBits -= 11\n    }\n  }\n  function flush() {\n    if (accBits) {\n      buffer11.push(acc)\n    }\n  }\n\n  buffer8.forEach(add)\n  flush()\n  return buffer11\n}\n\nfunction applyWords(nums: number[]): string[] {\n  return nums.map((n) => english[n])\n}\n\nfunction computeChecksum(seed: Uint8Array): string {\n  const hashBuffer = hash(seed)\n  const uint11Hash = toUint11Array(hashBuffer)\n  const words = applyWords(uint11Hash)\n\n  return words[0]\n}\n\n/**\n * mnemonicFromSeed converts a 32-byte key into a 25 word mnemonic. The generated mnemonic includes a checksum.\n * Each word in the mnemonic represents 11 bits of data, and the last 11 bits are reserved for the checksum.\n * @param seed - 32 bytes long seed\n * @returns 25 words mnemonic\n */\nexport function mnemonicFromSeed(seed: Uint8Array) {\n  // Sanity length check\n  if (seed.length !== SEED_BTYES_LENGTH) {\n    throw new RangeError(`Seed length must be ${SEED_BTYES_LENGTH}`)\n  }\n\n  const uint11Array = toUint11Array(seed)\n  const words = applyWords(uint11Array)\n  const checksumWord = computeChecksum(seed)\n\n  return `${words.join(' ')} ${checksumWord}`\n}\n\n// from Uint11Array\n// https://stackoverflow.com/a/51452614\nfunction toUint8Array(buffer11: number[]): Uint8Array {\n  const buffer8: number[] = []\n  let acc = 0\n  let accBits = 0\n  function add(ui11: number) {\n    acc |= ui11 << accBits\n    accBits += 11\n    while (accBits >= 8) {\n      buffer8.push(acc & 0xff)\n      acc >>= 8\n      accBits -= 8\n    }\n  }\n  function flush() {\n    if (accBits) {\n      buffer8.push(acc)\n    }\n  }\n\n  buffer11.forEach(add)\n  flush()\n  return new Uint8Array(buffer8)\n}\n\n/**\n * seedFromMnemonic converts a mnemonic generated using this library into the source key used to create it.\n * It returns an error if the passed mnemonic has an incorrect checksum, if the number of words is unexpected, or if one\n * of the passed words is not found in the words list.\n * @param mnemonic - 25 words mnemonic\n * @returns 32 bytes long seed\n */\nexport function seedFromMnemonic(mnemonic: string) {\n  const words = mnemonic.split(' ')\n  const key = words.slice(0, 24)\n\n  // Check that all words are in list\n  for (const w of key) {\n    if (english.indexOf(w) === -1) throw new Error(NOT_IN_WORDS_LIST_ERROR_MSG)\n  }\n\n  const checksum = words[words.length - 1]\n  const uint11Array = key.map((word) => english.indexOf(word))\n\n  // Convert the key to uint8Array\n  let uint8Array = toUint8Array(uint11Array)\n\n  // We need to chop the last byte -\n  // the short explanation - Since 256 is not divisible by 11, we have an extra 0x0 byte.\n  // The longer explanation - When splitting the 256 bits to chunks of 11, we get 23 words and a left over of 3 bits.\n  // This left gets padded with another 8 bits to the create the 24th word.\n  // While converting back to byte array, our new 264 bits array is divisible by 8 but the last byte is just the padding.\n\n  // check that we have 33 bytes long array as expected\n  if (uint8Array.length !== 33) throw new Error(FAIL_TO_DECODE_MNEMONIC_ERROR_MSG)\n\n  // check that the last byte is actually 0x0\n  if (uint8Array[uint8Array.length - 1] !== 0x0) throw new Error(FAIL_TO_DECODE_MNEMONIC_ERROR_MSG)\n\n  // chop it !\n  uint8Array = uint8Array.slice(0, uint8Array.length - 1)\n\n  // compute checksum\n  const cs = computeChecksum(uint8Array)\n\n  // success!\n  if (cs === checksum) return uint8Array\n\n  throw new Error(FAIL_TO_DECODE_MNEMONIC_ERROR_MSG)\n}\n\n/**\n * secretKeyToMnemonic takes an Algorand secret key and returns the corresponding mnemonic.\n * @param sk - Algorand secret key\n * @returns Secret key's associated mnemonic\n */\nexport function secretKeyToMnemonic(sk: Uint8Array) {\n  // get the seed from the sk\n  const seed = sk.slice(0, SEED_BTYES_LENGTH)\n  return mnemonicFromSeed(seed)\n}\n\n/**\n * mnemonicToMasterDerivationKey takes a mnemonic string and returns the corresponding master derivation key.\n * @param mn - 25 words Algorand mnemonic\n * @returns Uint8Array\n * @throws error if fails to decode the mnemonic\n */\nexport function mnemonicToMasterDerivationKey(mn: string) {\n  return seedFromMnemonic(mn)\n}\n\n/**\n * masterDerivationKeyToMnemonic takes a master derivation key and returns the corresponding mnemonic.\n * @param mdk - Uint8Array\n * @returns string mnemonic\n */\nexport function masterDerivationKeyToMnemonic(mdk: Uint8Array) {\n  return mnemonicFromSeed(mdk)\n}\n"],"mappings":";;;;AAEA,MAAa,oCAAoC;AACjD,MAAa,8BAA8B;AAE3C,MAAM,oBAAoB;AAG1B,SAAS,cAAc,SAA0C;CAC/D,MAAMA,WAAqB,EAAE;CAC7B,IAAI,MAAM;CACV,IAAI,UAAU;CACd,SAAS,IAAI,OAAe;AAC1B,SAAO,SAAS;AAChB,aAAW;AACX,MAAI,WAAW,IAAI;AACjB,YAAS,KAAK,MAAM,KAAM;AAC1B,WAAQ;AACR,cAAW;;;CAGf,SAAS,QAAQ;AACf,MAAI,QACF,UAAS,KAAK,IAAI;;AAItB,SAAQ,QAAQ,IAAI;AACpB,QAAO;AACP,QAAO;;AAGT,SAAS,WAAW,MAA0B;AAC5C,QAAO,KAAK,KAAK,MAAMC,wBAAQ,GAAG;;AAGpC,SAAS,gBAAgB,MAA0B;AAKjD,QAFc,WADK,cADAC,oBAAK,KAAK,CACe,CACR,CAEvB;;;;;;;;AASf,SAAgB,iBAAiB,MAAkB;AAEjD,KAAI,KAAK,WAAW,kBAClB,OAAM,IAAI,WAAW,uBAAuB,oBAAoB;CAIlE,MAAM,QAAQ,WADM,cAAc,KAAK,CACF;CACrC,MAAM,eAAe,gBAAgB,KAAK;AAE1C,QAAO,GAAG,MAAM,KAAK,IAAI,CAAC,GAAG;;AAK/B,SAAS,aAAa,UAAgC;CACpD,MAAMC,UAAoB,EAAE;CAC5B,IAAI,MAAM;CACV,IAAI,UAAU;CACd,SAAS,IAAI,MAAc;AACzB,SAAO,QAAQ;AACf,aAAW;AACX,SAAO,WAAW,GAAG;AACnB,WAAQ,KAAK,MAAM,IAAK;AACxB,WAAQ;AACR,cAAW;;;CAGf,SAAS,QAAQ;AACf,MAAI,QACF,SAAQ,KAAK,IAAI;;AAIrB,UAAS,QAAQ,IAAI;AACrB,QAAO;AACP,QAAO,IAAI,WAAW,QAAQ;;;;;;;;;AAUhC,SAAgB,iBAAiB,UAAkB;CACjD,MAAM,QAAQ,SAAS,MAAM,IAAI;CACjC,MAAM,MAAM,MAAM,MAAM,GAAG,GAAG;AAG9B,MAAK,MAAM,KAAK,IACd,KAAIF,wBAAQ,QAAQ,EAAE,KAAK,GAAI,OAAM,IAAI,MAAM,4BAA4B;CAG7E,MAAM,WAAW,MAAM,MAAM,SAAS;CAItC,IAAI,aAAa,aAHG,IAAI,KAAK,SAASA,wBAAQ,QAAQ,KAAK,CAAC,CAGlB;AAS1C,KAAI,WAAW,WAAW,GAAI,OAAM,IAAI,MAAM,kCAAkC;AAGhF,KAAI,WAAW,WAAW,SAAS,OAAO,EAAK,OAAM,IAAI,MAAM,kCAAkC;AAGjG,cAAa,WAAW,MAAM,GAAG,WAAW,SAAS,EAAE;AAMvD,KAHW,gBAAgB,WAAW,KAG3B,SAAU,QAAO;AAE5B,OAAM,IAAI,MAAM,kCAAkC;;;;;;;AAQpD,SAAgB,oBAAoB,IAAgB;AAGlD,QAAO,iBADM,GAAG,MAAM,GAAG,kBAAkB,CACd;;;;;;;;AAS/B,SAAgB,8BAA8B,IAAY;AACxD,QAAO,iBAAiB,GAAG;;;;;;;AAQ7B,SAAgB,8BAA8B,KAAiB;AAC7D,QAAO,iBAAiB,IAAI"}
+{"version":3,"file":"index.js","names":["english","hash"],"sources":["../../../../packages/algo25/src/index.ts"],"sourcesContent":["import english from './english.js'\nimport { hash } from '@algorandfoundation/algokit-crypto'\nexport const FAIL_TO_DECODE_MNEMONIC_ERROR_MSG = 'failed to decode mnemonic'\nexport const NOT_IN_WORDS_LIST_ERROR_MSG = 'the mnemonic contains a word that is not in the wordlist'\n\nconst SEED_BTYES_LENGTH = 32\n\n// https://stackoverflow.com/a/51452614\nfunction toUint11Array(buffer8: Uint8Array | number[]): number[] {\n  const buffer11: number[] = []\n  let acc = 0\n  let accBits = 0\n  function add(octet: number) {\n    acc |= octet << accBits\n    accBits += 8\n    if (accBits >= 11) {\n      buffer11.push(acc & 0x7ff)\n      acc >>= 11\n      accBits -= 11\n    }\n  }\n  function flush() {\n    if (accBits) {\n      buffer11.push(acc)\n    }\n  }\n\n  buffer8.forEach(add)\n  flush()\n  return buffer11\n}\n\nfunction applyWords(nums: number[]): string[] {\n  return nums.map((n) => english[n])\n}\n\nfunction computeChecksum(seed: Uint8Array): string {\n  const hashBuffer = hash(seed)\n  const uint11Hash = toUint11Array(hashBuffer)\n  const words = applyWords(uint11Hash)\n\n  return words[0]\n}\n\n/**\n * mnemonicFromSeed converts a 32-byte key into a 25 word mnemonic. The generated mnemonic includes a checksum.\n * Each word in the mnemonic represents 11 bits of data, and the last 11 bits are reserved for the checksum.\n * @param seed - 32 bytes long seed\n * @returns 25 words mnemonic\n */\nexport function mnemonicFromSeed(seed: Uint8Array) {\n  // Sanity length check\n  if (seed.length !== SEED_BTYES_LENGTH) {\n    throw new RangeError(`Seed length must be ${SEED_BTYES_LENGTH}`)\n  }\n\n  const uint11Array = toUint11Array(seed)\n  const words = applyWords(uint11Array)\n  const checksumWord = computeChecksum(seed)\n\n  return `${words.join(' ')} ${checksumWord}`\n}\n\n// from Uint11Array\n// https://stackoverflow.com/a/51452614\nfunction toUint8Array(buffer11: number[]): Uint8Array {\n  const buffer8: number[] = []\n  let acc = 0\n  let accBits = 0\n  function add(ui11: number) {\n    acc |= ui11 << accBits\n    accBits += 11\n    while (accBits >= 8) {\n      buffer8.push(acc & 0xff)\n      acc >>= 8\n      accBits -= 8\n    }\n  }\n  function flush() {\n    if (accBits) {\n      buffer8.push(acc)\n    }\n  }\n\n  buffer11.forEach(add)\n  flush()\n  return new Uint8Array(buffer8)\n}\n\n/**\n * seedFromMnemonic converts a mnemonic generated using this library into the source key used to create it.\n * It returns an error if the passed mnemonic has an incorrect checksum, if the number of words is unexpected, or if one\n * of the passed words is not found in the words list.\n * @param mnemonic - 25 words mnemonic\n * @returns 32 bytes long seed\n */\nexport function seedFromMnemonic(mnemonic: string) {\n  const words = mnemonic.split(' ')\n  const key = words.slice(0, 24)\n\n  // Check that all words are in list\n  for (const w of key) {\n    if (english.indexOf(w) === -1) throw new Error(NOT_IN_WORDS_LIST_ERROR_MSG)\n  }\n\n  const checksum = words[words.length - 1]\n  const uint11Array = key.map((word) => english.indexOf(word))\n\n  // Convert the key to uint8Array\n  let uint8Array = toUint8Array(uint11Array)\n\n  // We need to chop the last byte -\n  // the short explanation - Since 256 is not divisible by 11, we have an extra 0x0 byte.\n  // The longer explanation - When splitting the 256 bits to chunks of 11, we get 23 words and a left over of 3 bits.\n  // This left gets padded with another 8 bits to the create the 24th word.\n  // While converting back to byte array, our new 264 bits array is divisible by 8 but the last byte is just the padding.\n\n  // check that we have 33 bytes long array as expected\n  if (uint8Array.length !== 33) throw new Error(FAIL_TO_DECODE_MNEMONIC_ERROR_MSG)\n\n  // check that the last byte is actually 0x0\n  if (uint8Array[uint8Array.length - 1] !== 0x0) throw new Error(FAIL_TO_DECODE_MNEMONIC_ERROR_MSG)\n\n  // chop it !\n  uint8Array = uint8Array.slice(0, uint8Array.length - 1)\n\n  // compute checksum\n  const cs = computeChecksum(uint8Array)\n\n  // success!\n  if (cs === checksum) return uint8Array\n\n  throw new Error(FAIL_TO_DECODE_MNEMONIC_ERROR_MSG)\n}\n\n/**\n * secretKeyToMnemonic takes an Algorand secret key and returns the corresponding mnemonic.\n * @param sk - Algorand secret key\n * @returns Secret key's associated mnemonic\n */\nexport function secretKeyToMnemonic(sk: Uint8Array) {\n  // get the seed from the sk\n  const seed = sk.slice(0, SEED_BTYES_LENGTH)\n  return mnemonicFromSeed(seed)\n}\n\n/**\n * mnemonicToMasterDerivationKey takes a mnemonic string and returns the corresponding master derivation key.\n * @param mn - 25 words Algorand mnemonic\n * @returns Uint8Array\n * @throws error if fails to decode the mnemonic\n */\nexport function mnemonicToMasterDerivationKey(mn: string) {\n  return seedFromMnemonic(mn)\n}\n\n/**\n * masterDerivationKeyToMnemonic takes a master derivation key and returns the corresponding mnemonic.\n * @param mdk - Uint8Array\n * @returns string mnemonic\n */\nexport function masterDerivationKeyToMnemonic(mdk: Uint8Array) {\n  return mnemonicFromSeed(mdk)\n}\n"],"mappings":";;;AAEA,MAAa,oCAAoC;AACjD,MAAa,8BAA8B;AAE3C,MAAM,oBAAoB;AAG1B,SAAS,cAAc,SAA0C;CAC/D,MAAM,WAAqB,EAAE;CAC7B,IAAI,MAAM;CACV,IAAI,UAAU;CACd,SAAS,IAAI,OAAe;AAC1B,SAAO,SAAS;AAChB,aAAW;AACX,MAAI,WAAW,IAAI;AACjB,YAAS,KAAK,MAAM,KAAM;AAC1B,WAAQ;AACR,cAAW;;;CAGf,SAAS,QAAQ;AACf,MAAI,QACF,UAAS,KAAK,IAAI;;AAItB,SAAQ,QAAQ,IAAI;AACpB,QAAO;AACP,QAAO;;AAGT,SAAS,WAAW,MAA0B;AAC5C,QAAO,KAAK,KAAK,MAAMA,gBAAAA,QAAQ,GAAG;;AAGpC,SAAS,gBAAgB,MAA0B;AAKjD,QAFc,WADK,cADAC,aAAAA,KAAK,KAAK,CACe,CACR,CAEvB;;;;;;;;AASf,SAAgB,iBAAiB,MAAkB;AAEjD,KAAI,KAAK,WAAW,kBAClB,OAAM,IAAI,WAAW,uBAAuB,oBAAoB;CAIlE,MAAM,QAAQ,WADM,cAAc,KAAK,CACF;CACrC,MAAM,eAAe,gBAAgB,KAAK;AAE1C,QAAO,GAAG,MAAM,KAAK,IAAI,CAAC,GAAG;;AAK/B,SAAS,aAAa,UAAgC;CACpD,MAAM,UAAoB,EAAE;CAC5B,IAAI,MAAM;CACV,IAAI,UAAU;CACd,SAAS,IAAI,MAAc;AACzB,SAAO,QAAQ;AACf,aAAW;AACX,SAAO,WAAW,GAAG;AACnB,WAAQ,KAAK,MAAM,IAAK;AACxB,WAAQ;AACR,cAAW;;;CAGf,SAAS,QAAQ;AACf,MAAI,QACF,SAAQ,KAAK,IAAI;;AAIrB,UAAS,QAAQ,IAAI;AACrB,QAAO;AACP,QAAO,IAAI,WAAW,QAAQ;;;;;;;;;AAUhC,SAAgB,iBAAiB,UAAkB;CACjD,MAAM,QAAQ,SAAS,MAAM,IAAI;CACjC,MAAM,MAAM,MAAM,MAAM,GAAG,GAAG;AAG9B,MAAK,MAAM,KAAK,IACd,KAAID,gBAAAA,QAAQ,QAAQ,EAAE,KAAK,GAAI,OAAM,IAAI,MAAM,4BAA4B;CAG7E,MAAM,WAAW,MAAM,MAAM,SAAS;CAItC,IAAI,aAAa,aAHG,IAAI,KAAK,SAASA,gBAAAA,QAAQ,QAAQ,KAAK,CAAC,CAGlB;AAS1C,KAAI,WAAW,WAAW,GAAI,OAAM,IAAI,MAAM,kCAAkC;AAGhF,KAAI,WAAW,WAAW,SAAS,OAAO,EAAK,OAAM,IAAI,MAAM,kCAAkC;AAGjG,cAAa,WAAW,MAAM,GAAG,WAAW,SAAS,EAAE;AAMvD,KAHW,gBAAgB,WAAW,KAG3B,SAAU,QAAO;AAE5B,OAAM,IAAI,MAAM,kCAAkC;;;;;;;AAQpD,SAAgB,oBAAoB,IAAgB;AAGlD,QAAO,iBADM,GAAG,MAAM,GAAG,kBAAkB,CACd;;;;;;;;AAS/B,SAAgB,8BAA8B,IAAY;AACxD,QAAO,iBAAiB,GAAG;;;;;;;AAQ7B,SAAgB,8BAA8B,KAAiB;AAC7D,QAAO,iBAAiB,IAAI"}

package/packages/algo25/src/index.mjs

@@ -1,6 +1,5 @@
-import { hash } from "../../common/src/crypto.mjs";
-import english_default from "./english.mjs";
-
+import { hash } from "../../crypto/src/hash.mjs";
+import english from "./english.mjs";
 //#region packages/algo25/src/index.ts
 const FAIL_TO_DECODE_MNEMONIC_ERROR_MSG = "failed to decode mnemonic";
 const NOT_IN_WORDS_LIST_ERROR_MSG = "the mnemonic contains a word that is not in the wordlist";
@@ -26,7 +25,7 @@ function toUint11Array(buffer8) {
 	return buffer11;
 }
 function applyWords(nums) {
-	return nums.map((n) => english_default[n]);
+	return nums.map((n) => english[n]);
 }
 function computeChecksum(seed) {
 	return applyWords(toUint11Array(hash(seed)))[0];
@@ -73,9 +72,9 @@ function toUint8Array(buffer11) {
 function seedFromMnemonic(mnemonic) {
 	const words = mnemonic.split(" ");
 	const key = words.slice(0, 24);
-	for (const w of key) if (english_default.indexOf(w) === -1) throw new Error(NOT_IN_WORDS_LIST_ERROR_MSG);
+	for (const w of key) if (english.indexOf(w) === -1) throw new Error(NOT_IN_WORDS_LIST_ERROR_MSG);
 	const checksum = words[words.length - 1];
-	let uint8Array = toUint8Array(key.map((word) => english_default.indexOf(word)));
+	let uint8Array = toUint8Array(key.map((word) => english.indexOf(word)));
 	if (uint8Array.length !== 33) throw new Error(FAIL_TO_DECODE_MNEMONIC_ERROR_MSG);
 	if (uint8Array[uint8Array.length - 1] !== 0) throw new Error(FAIL_TO_DECODE_MNEMONIC_ERROR_MSG);
 	uint8Array = uint8Array.slice(0, uint8Array.length - 1);
@@ -107,7 +106,7 @@ function mnemonicToMasterDerivationKey(mn) {
 function masterDerivationKeyToMnemonic(mdk) {
 	return mnemonicFromSeed(mdk);
 }
-
 //#endregion
 export { FAIL_TO_DECODE_MNEMONIC_ERROR_MSG, NOT_IN_WORDS_LIST_ERROR_MSG, masterDerivationKeyToMnemonic, mnemonicFromSeed, mnemonicToMasterDerivationKey, secretKeyToMnemonic, seedFromMnemonic };
+
 //# sourceMappingURL=index.mjs.map

package/packages/algo25/src/index.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.mjs","names":["buffer11: number[]","english","buffer8: number[]"],"sources":["../../../../packages/algo25/src/index.ts"],"sourcesContent":["import english from './english.js'\nimport { hash } from '@algorandfoundation/algokit-common'\nexport const FAIL_TO_DECODE_MNEMONIC_ERROR_MSG = 'failed to decode mnemonic'\nexport const NOT_IN_WORDS_LIST_ERROR_MSG = 'the mnemonic contains a word that is not in the wordlist'\n\nconst SEED_BTYES_LENGTH = 32\n\n// https://stackoverflow.com/a/51452614\nfunction toUint11Array(buffer8: Uint8Array | number[]): number[] {\n  const buffer11: number[] = []\n  let acc = 0\n  let accBits = 0\n  function add(octet: number) {\n    acc |= octet << accBits\n    accBits += 8\n    if (accBits >= 11) {\n      buffer11.push(acc & 0x7ff)\n      acc >>= 11\n      accBits -= 11\n    }\n  }\n  function flush() {\n    if (accBits) {\n      buffer11.push(acc)\n    }\n  }\n\n  buffer8.forEach(add)\n  flush()\n  return buffer11\n}\n\nfunction applyWords(nums: number[]): string[] {\n  return nums.map((n) => english[n])\n}\n\nfunction computeChecksum(seed: Uint8Array): string {\n  const hashBuffer = hash(seed)\n  const uint11Hash = toUint11Array(hashBuffer)\n  const words = applyWords(uint11Hash)\n\n  return words[0]\n}\n\n/**\n * mnemonicFromSeed converts a 32-byte key into a 25 word mnemonic. The generated mnemonic includes a checksum.\n * Each word in the mnemonic represents 11 bits of data, and the last 11 bits are reserved for the checksum.\n * @param seed - 32 bytes long seed\n * @returns 25 words mnemonic\n */\nexport function mnemonicFromSeed(seed: Uint8Array) {\n  // Sanity length check\n  if (seed.length !== SEED_BTYES_LENGTH) {\n    throw new RangeError(`Seed length must be ${SEED_BTYES_LENGTH}`)\n  }\n\n  const uint11Array = toUint11Array(seed)\n  const words = applyWords(uint11Array)\n  const checksumWord = computeChecksum(seed)\n\n  return `${words.join(' ')} ${checksumWord}`\n}\n\n// from Uint11Array\n// https://stackoverflow.com/a/51452614\nfunction toUint8Array(buffer11: number[]): Uint8Array {\n  const buffer8: number[] = []\n  let acc = 0\n  let accBits = 0\n  function add(ui11: number) {\n    acc |= ui11 << accBits\n    accBits += 11\n    while (accBits >= 8) {\n      buffer8.push(acc & 0xff)\n      acc >>= 8\n      accBits -= 8\n    }\n  }\n  function flush() {\n    if (accBits) {\n      buffer8.push(acc)\n    }\n  }\n\n  buffer11.forEach(add)\n  flush()\n  return new Uint8Array(buffer8)\n}\n\n/**\n * seedFromMnemonic converts a mnemonic generated using this library into the source key used to create it.\n * It returns an error if the passed mnemonic has an incorrect checksum, if the number of words is unexpected, or if one\n * of the passed words is not found in the words list.\n * @param mnemonic - 25 words mnemonic\n * @returns 32 bytes long seed\n */\nexport function seedFromMnemonic(mnemonic: string) {\n  const words = mnemonic.split(' ')\n  const key = words.slice(0, 24)\n\n  // Check that all words are in list\n  for (const w of key) {\n    if (english.indexOf(w) === -1) throw new Error(NOT_IN_WORDS_LIST_ERROR_MSG)\n  }\n\n  const checksum = words[words.length - 1]\n  const uint11Array = key.map((word) => english.indexOf(word))\n\n  // Convert the key to uint8Array\n  let uint8Array = toUint8Array(uint11Array)\n\n  // We need to chop the last byte -\n  // the short explanation - Since 256 is not divisible by 11, we have an extra 0x0 byte.\n  // The longer explanation - When splitting the 256 bits to chunks of 11, we get 23 words and a left over of 3 bits.\n  // This left gets padded with another 8 bits to the create the 24th word.\n  // While converting back to byte array, our new 264 bits array is divisible by 8 but the last byte is just the padding.\n\n  // check that we have 33 bytes long array as expected\n  if (uint8Array.length !== 33) throw new Error(FAIL_TO_DECODE_MNEMONIC_ERROR_MSG)\n\n  // check that the last byte is actually 0x0\n  if (uint8Array[uint8Array.length - 1] !== 0x0) throw new Error(FAIL_TO_DECODE_MNEMONIC_ERROR_MSG)\n\n  // chop it !\n  uint8Array = uint8Array.slice(0, uint8Array.length - 1)\n\n  // compute checksum\n  const cs = computeChecksum(uint8Array)\n\n  // success!\n  if (cs === checksum) return uint8Array\n\n  throw new Error(FAIL_TO_DECODE_MNEMONIC_ERROR_MSG)\n}\n\n/**\n * secretKeyToMnemonic takes an Algorand secret key and returns the corresponding mnemonic.\n * @param sk - Algorand secret key\n * @returns Secret key's associated mnemonic\n */\nexport function secretKeyToMnemonic(sk: Uint8Array) {\n  // get the seed from the sk\n  const seed = sk.slice(0, SEED_BTYES_LENGTH)\n  return mnemonicFromSeed(seed)\n}\n\n/**\n * mnemonicToMasterDerivationKey takes a mnemonic string and returns the corresponding master derivation key.\n * @param mn - 25 words Algorand mnemonic\n * @returns Uint8Array\n * @throws error if fails to decode the mnemonic\n */\nexport function mnemonicToMasterDerivationKey(mn: string) {\n  return seedFromMnemonic(mn)\n}\n\n/**\n * masterDerivationKeyToMnemonic takes a master derivation key and returns the corresponding mnemonic.\n * @param mdk - Uint8Array\n * @returns string mnemonic\n */\nexport function masterDerivationKeyToMnemonic(mdk: Uint8Array) {\n  return mnemonicFromSeed(mdk)\n}\n"],"mappings":";;;;AAEA,MAAa,oCAAoC;AACjD,MAAa,8BAA8B;AAE3C,MAAM,oBAAoB;AAG1B,SAAS,cAAc,SAA0C;CAC/D,MAAMA,WAAqB,EAAE;CAC7B,IAAI,MAAM;CACV,IAAI,UAAU;CACd,SAAS,IAAI,OAAe;AAC1B,SAAO,SAAS;AAChB,aAAW;AACX,MAAI,WAAW,IAAI;AACjB,YAAS,KAAK,MAAM,KAAM;AAC1B,WAAQ;AACR,cAAW;;;CAGf,SAAS,QAAQ;AACf,MAAI,QACF,UAAS,KAAK,IAAI;;AAItB,SAAQ,QAAQ,IAAI;AACpB,QAAO;AACP,QAAO;;AAGT,SAAS,WAAW,MAA0B;AAC5C,QAAO,KAAK,KAAK,MAAMC,gBAAQ,GAAG;;AAGpC,SAAS,gBAAgB,MAA0B;AAKjD,QAFc,WADK,cADA,KAAK,KAAK,CACe,CACR,CAEvB;;;;;;;;AASf,SAAgB,iBAAiB,MAAkB;AAEjD,KAAI,KAAK,WAAW,kBAClB,OAAM,IAAI,WAAW,uBAAuB,oBAAoB;CAIlE,MAAM,QAAQ,WADM,cAAc,KAAK,CACF;CACrC,MAAM,eAAe,gBAAgB,KAAK;AAE1C,QAAO,GAAG,MAAM,KAAK,IAAI,CAAC,GAAG;;AAK/B,SAAS,aAAa,UAAgC;CACpD,MAAMC,UAAoB,EAAE;CAC5B,IAAI,MAAM;CACV,IAAI,UAAU;CACd,SAAS,IAAI,MAAc;AACzB,SAAO,QAAQ;AACf,aAAW;AACX,SAAO,WAAW,GAAG;AACnB,WAAQ,KAAK,MAAM,IAAK;AACxB,WAAQ;AACR,cAAW;;;CAGf,SAAS,QAAQ;AACf,MAAI,QACF,SAAQ,KAAK,IAAI;;AAIrB,UAAS,QAAQ,IAAI;AACrB,QAAO;AACP,QAAO,IAAI,WAAW,QAAQ;;;;;;;;;AAUhC,SAAgB,iBAAiB,UAAkB;CACjD,MAAM,QAAQ,SAAS,MAAM,IAAI;CACjC,MAAM,MAAM,MAAM,MAAM,GAAG,GAAG;AAG9B,MAAK,MAAM,KAAK,IACd,KAAID,gBAAQ,QAAQ,EAAE,KAAK,GAAI,OAAM,IAAI,MAAM,4BAA4B;CAG7E,MAAM,WAAW,MAAM,MAAM,SAAS;CAItC,IAAI,aAAa,aAHG,IAAI,KAAK,SAASA,gBAAQ,QAAQ,KAAK,CAAC,CAGlB;AAS1C,KAAI,WAAW,WAAW,GAAI,OAAM,IAAI,MAAM,kCAAkC;AAGhF,KAAI,WAAW,WAAW,SAAS,OAAO,EAAK,OAAM,IAAI,MAAM,kCAAkC;AAGjG,cAAa,WAAW,MAAM,GAAG,WAAW,SAAS,EAAE;AAMvD,KAHW,gBAAgB,WAAW,KAG3B,SAAU,QAAO;AAE5B,OAAM,IAAI,MAAM,kCAAkC;;;;;;;AAQpD,SAAgB,oBAAoB,IAAgB;AAGlD,QAAO,iBADM,GAAG,MAAM,GAAG,kBAAkB,CACd;;;;;;;;AAS/B,SAAgB,8BAA8B,IAAY;AACxD,QAAO,iBAAiB,GAAG;;;;;;;AAQ7B,SAAgB,8BAA8B,KAAiB;AAC7D,QAAO,iBAAiB,IAAI"}
+{"version":3,"file":"index.mjs","names":[],"sources":["../../../../packages/algo25/src/index.ts"],"sourcesContent":["import english from './english.js'\nimport { hash } from '@algorandfoundation/algokit-crypto'\nexport const FAIL_TO_DECODE_MNEMONIC_ERROR_MSG = 'failed to decode mnemonic'\nexport const NOT_IN_WORDS_LIST_ERROR_MSG = 'the mnemonic contains a word that is not in the wordlist'\n\nconst SEED_BTYES_LENGTH = 32\n\n// https://stackoverflow.com/a/51452614\nfunction toUint11Array(buffer8: Uint8Array | number[]): number[] {\n  const buffer11: number[] = []\n  let acc = 0\n  let accBits = 0\n  function add(octet: number) {\n    acc |= octet << accBits\n    accBits += 8\n    if (accBits >= 11) {\n      buffer11.push(acc & 0x7ff)\n      acc >>= 11\n      accBits -= 11\n    }\n  }\n  function flush() {\n    if (accBits) {\n      buffer11.push(acc)\n    }\n  }\n\n  buffer8.forEach(add)\n  flush()\n  return buffer11\n}\n\nfunction applyWords(nums: number[]): string[] {\n  return nums.map((n) => english[n])\n}\n\nfunction computeChecksum(seed: Uint8Array): string {\n  const hashBuffer = hash(seed)\n  const uint11Hash = toUint11Array(hashBuffer)\n  const words = applyWords(uint11Hash)\n\n  return words[0]\n}\n\n/**\n * mnemonicFromSeed converts a 32-byte key into a 25 word mnemonic. The generated mnemonic includes a checksum.\n * Each word in the mnemonic represents 11 bits of data, and the last 11 bits are reserved for the checksum.\n * @param seed - 32 bytes long seed\n * @returns 25 words mnemonic\n */\nexport function mnemonicFromSeed(seed: Uint8Array) {\n  // Sanity length check\n  if (seed.length !== SEED_BTYES_LENGTH) {\n    throw new RangeError(`Seed length must be ${SEED_BTYES_LENGTH}`)\n  }\n\n  const uint11Array = toUint11Array(seed)\n  const words = applyWords(uint11Array)\n  const checksumWord = computeChecksum(seed)\n\n  return `${words.join(' ')} ${checksumWord}`\n}\n\n// from Uint11Array\n// https://stackoverflow.com/a/51452614\nfunction toUint8Array(buffer11: number[]): Uint8Array {\n  const buffer8: number[] = []\n  let acc = 0\n  let accBits = 0\n  function add(ui11: number) {\n    acc |= ui11 << accBits\n    accBits += 11\n    while (accBits >= 8) {\n      buffer8.push(acc & 0xff)\n      acc >>= 8\n      accBits -= 8\n    }\n  }\n  function flush() {\n    if (accBits) {\n      buffer8.push(acc)\n    }\n  }\n\n  buffer11.forEach(add)\n  flush()\n  return new Uint8Array(buffer8)\n}\n\n/**\n * seedFromMnemonic converts a mnemonic generated using this library into the source key used to create it.\n * It returns an error if the passed mnemonic has an incorrect checksum, if the number of words is unexpected, or if one\n * of the passed words is not found in the words list.\n * @param mnemonic - 25 words mnemonic\n * @returns 32 bytes long seed\n */\nexport function seedFromMnemonic(mnemonic: string) {\n  const words = mnemonic.split(' ')\n  const key = words.slice(0, 24)\n\n  // Check that all words are in list\n  for (const w of key) {\n    if (english.indexOf(w) === -1) throw new Error(NOT_IN_WORDS_LIST_ERROR_MSG)\n  }\n\n  const checksum = words[words.length - 1]\n  const uint11Array = key.map((word) => english.indexOf(word))\n\n  // Convert the key to uint8Array\n  let uint8Array = toUint8Array(uint11Array)\n\n  // We need to chop the last byte -\n  // the short explanation - Since 256 is not divisible by 11, we have an extra 0x0 byte.\n  // The longer explanation - When splitting the 256 bits to chunks of 11, we get 23 words and a left over of 3 bits.\n  // This left gets padded with another 8 bits to the create the 24th word.\n  // While converting back to byte array, our new 264 bits array is divisible by 8 but the last byte is just the padding.\n\n  // check that we have 33 bytes long array as expected\n  if (uint8Array.length !== 33) throw new Error(FAIL_TO_DECODE_MNEMONIC_ERROR_MSG)\n\n  // check that the last byte is actually 0x0\n  if (uint8Array[uint8Array.length - 1] !== 0x0) throw new Error(FAIL_TO_DECODE_MNEMONIC_ERROR_MSG)\n\n  // chop it !\n  uint8Array = uint8Array.slice(0, uint8Array.length - 1)\n\n  // compute checksum\n  const cs = computeChecksum(uint8Array)\n\n  // success!\n  if (cs === checksum) return uint8Array\n\n  throw new Error(FAIL_TO_DECODE_MNEMONIC_ERROR_MSG)\n}\n\n/**\n * secretKeyToMnemonic takes an Algorand secret key and returns the corresponding mnemonic.\n * @param sk - Algorand secret key\n * @returns Secret key's associated mnemonic\n */\nexport function secretKeyToMnemonic(sk: Uint8Array) {\n  // get the seed from the sk\n  const seed = sk.slice(0, SEED_BTYES_LENGTH)\n  return mnemonicFromSeed(seed)\n}\n\n/**\n * mnemonicToMasterDerivationKey takes a mnemonic string and returns the corresponding master derivation key.\n * @param mn - 25 words Algorand mnemonic\n * @returns Uint8Array\n * @throws error if fails to decode the mnemonic\n */\nexport function mnemonicToMasterDerivationKey(mn: string) {\n  return seedFromMnemonic(mn)\n}\n\n/**\n * masterDerivationKeyToMnemonic takes a master derivation key and returns the corresponding mnemonic.\n * @param mdk - Uint8Array\n * @returns string mnemonic\n */\nexport function masterDerivationKeyToMnemonic(mdk: Uint8Array) {\n  return mnemonicFromSeed(mdk)\n}\n"],"mappings":";;;AAEA,MAAa,oCAAoC;AACjD,MAAa,8BAA8B;AAE3C,MAAM,oBAAoB;AAG1B,SAAS,cAAc,SAA0C;CAC/D,MAAM,WAAqB,EAAE;CAC7B,IAAI,MAAM;CACV,IAAI,UAAU;CACd,SAAS,IAAI,OAAe;AAC1B,SAAO,SAAS;AAChB,aAAW;AACX,MAAI,WAAW,IAAI;AACjB,YAAS,KAAK,MAAM,KAAM;AAC1B,WAAQ;AACR,cAAW;;;CAGf,SAAS,QAAQ;AACf,MAAI,QACF,UAAS,KAAK,IAAI;;AAItB,SAAQ,QAAQ,IAAI;AACpB,QAAO;AACP,QAAO;;AAGT,SAAS,WAAW,MAA0B;AAC5C,QAAO,KAAK,KAAK,MAAM,QAAQ,GAAG;;AAGpC,SAAS,gBAAgB,MAA0B;AAKjD,QAFc,WADK,cADA,KAAK,KAAK,CACe,CACR,CAEvB;;;;;;;;AASf,SAAgB,iBAAiB,MAAkB;AAEjD,KAAI,KAAK,WAAW,kBAClB,OAAM,IAAI,WAAW,uBAAuB,oBAAoB;CAIlE,MAAM,QAAQ,WADM,cAAc,KAAK,CACF;CACrC,MAAM,eAAe,gBAAgB,KAAK;AAE1C,QAAO,GAAG,MAAM,KAAK,IAAI,CAAC,GAAG;;AAK/B,SAAS,aAAa,UAAgC;CACpD,MAAM,UAAoB,EAAE;CAC5B,IAAI,MAAM;CACV,IAAI,UAAU;CACd,SAAS,IAAI,MAAc;AACzB,SAAO,QAAQ;AACf,aAAW;AACX,SAAO,WAAW,GAAG;AACnB,WAAQ,KAAK,MAAM,IAAK;AACxB,WAAQ;AACR,cAAW;;;CAGf,SAAS,QAAQ;AACf,MAAI,QACF,SAAQ,KAAK,IAAI;;AAIrB,UAAS,QAAQ,IAAI;AACrB,QAAO;AACP,QAAO,IAAI,WAAW,QAAQ;;;;;;;;;AAUhC,SAAgB,iBAAiB,UAAkB;CACjD,MAAM,QAAQ,SAAS,MAAM,IAAI;CACjC,MAAM,MAAM,MAAM,MAAM,GAAG,GAAG;AAG9B,MAAK,MAAM,KAAK,IACd,KAAI,QAAQ,QAAQ,EAAE,KAAK,GAAI,OAAM,IAAI,MAAM,4BAA4B;CAG7E,MAAM,WAAW,MAAM,MAAM,SAAS;CAItC,IAAI,aAAa,aAHG,IAAI,KAAK,SAAS,QAAQ,QAAQ,KAAK,CAAC,CAGlB;AAS1C,KAAI,WAAW,WAAW,GAAI,OAAM,IAAI,MAAM,kCAAkC;AAGhF,KAAI,WAAW,WAAW,SAAS,OAAO,EAAK,OAAM,IAAI,MAAM,kCAAkC;AAGjG,cAAa,WAAW,MAAM,GAAG,WAAW,SAAS,EAAE;AAMvD,KAHW,gBAAgB,WAAW,KAG3B,SAAU,QAAO;AAE5B,OAAM,IAAI,MAAM,kCAAkC;;;;;;;AAQpD,SAAgB,oBAAoB,IAAgB;AAGlD,QAAO,iBADM,GAAG,MAAM,GAAG,kBAAkB,CACd;;;;;;;;AAS/B,SAAgB,8BAA8B,IAAY;AACxD,QAAO,iBAAiB,GAAG;;;;;;;AAQ7B,SAAgB,8BAA8B,KAAiB;AAC7D,QAAO,iBAAiB,IAAI"}

package/packages/algod_client/src/apis/api-service.d.ts

@@ -52,84 +52,66 @@ declare class AlgodApi {
   /**
    * Given an application ID and box name, it returns the round, box name, and value (each base64 encoded). Box names must be in the goal app call arg encoding form 'encoding:value'. For ints, use the form 'int:1234'. For raw bytes, use the form 'b64:A=='. For printable strings, use the form 'str:hello'. For addresses, use the form 'addr:XYZ...'.
    */
-  private _getApplicationBoxByName;
+  private _applicationBoxByName;
   /**
    * Given an application ID, return all Box names. No particular ordering is guaranteed. Request fails when client or server-side configured limits prevent returning all Box names.
    */
-  getApplicationBoxes(applicationId: number | bigint, params?: {
+  applicationBoxes(applicationId: number | bigint, params?: {
     max?: number;
   }): Promise<BoxesResponse>;
   /**
    * Given a application ID, it returns application information including creator, approval and clear programs, global and local schemas, and global state.
    */
-  getApplicationById(applicationId: number | bigint): Promise<Application>;
+  applicationById(applicationId: number | bigint): Promise<Application>;
   /**
    * Given a asset ID, it returns asset information including creator, name, total supply and special addresses.
    */
-  getAssetById(assetId: number | bigint): Promise<Asset>;
-  getBlock(round: number | bigint, params?: {
+  assetById(assetId: number | bigint): Promise<Asset>;
+  block(round: number | bigint, params?: {
     headerOnly?: boolean;
   }): Promise<BlockResponse>;
-  getBlockHash(round: number | bigint): Promise<BlockHashResponse>;
+  blockHash(round: number | bigint): Promise<BlockHashResponse>;
   /**
    * Gets the current timestamp offset.
    */
-  getBlockTimeStampOffset(): Promise<GetBlockTimeStampOffsetResponse>;
-  getBlockTxIds(round: number | bigint): Promise<BlockTxidsResponse>;
+  blockTimeStampOffset(): Promise<GetBlockTimeStampOffsetResponse>;
+  blockTxIds(round: number | bigint): Promise<BlockTxidsResponse>;
   /**
    * Returns the entire genesis file in json.
    */
-  getGenesis(): Promise<Genesis>;
+  genesis(): Promise<Genesis>;
+  healthCheck(): Promise<void>;
   /**
    * Get ledger deltas for a round.
    */
-  getLedgerStateDelta(round: number | bigint): Promise<LedgerStateDelta>;
+  ledgerStateDelta(round: number | bigint): Promise<LedgerStateDelta>;
   /**
    * Get a ledger delta for a given transaction group.
    */
-  getLedgerStateDeltaForTransactionGroup(id: string): Promise<LedgerStateDelta>;
-  getLightBlockHeaderProof(round: number | bigint): Promise<LightBlockHeaderProof>;
+  ledgerStateDeltaForTransactionGroup(id: string): Promise<LedgerStateDelta>;
+  lightBlockHeaderProof(round: number | bigint): Promise<LightBlockHeaderProof>;
+  /**
+   * Given a transaction ID of a recently submitted transaction, it returns information about it.  There are several cases when this might succeed:
+   * - transaction committed (committed round > 0)
+   * - transaction still in the pool (committed round = 0, pool error = "")
+   * - transaction removed from pool due to error (committed round = 0, pool error != "")
+   * Or the transaction may have happened sufficiently long ago that the node no longer remembers it, and this will return an error.
+   */
+  pendingTransactionInformation(txId: string): Promise<PendingTransactionResponse>;
   /**
    * Get the list of pending transactions, sorted by priority, in decreasing order, truncated at the end at MAX. If MAX = 0, returns all pending transactions.
    */
-  getPendingTransactions(params?: {
+  pendingTransactions(params?: {
     max?: number;
   }): Promise<PendingTransactionsResponse>;
   /**
    * Get the list of pending transactions by address, sorted by priority, in decreasing order, truncated at the end at MAX. If MAX = 0, returns all pending transactions.
    */
-  getPendingTransactionsByAddress(address: ReadableAddress, params?: {
+  pendingTransactionsByAddress(address: ReadableAddress, params?: {
     max?: number;
   }): Promise<PendingTransactionsResponse>;
-  getReady(): Promise<void>;
-  getStateProof(round: number | bigint): Promise<StateProof>;
-  getStatus(): Promise<NodeStatusResponse>;
-  getSupply(): Promise<SupplyResponse>;
-  /**
-   * Gets the minimum sync round for the ledger.
-   */
-  getSyncRound(): Promise<GetSyncRoundResponse>;
-  /**
-   * Get ledger deltas for transaction groups in a given round.
-   */
-  getTransactionGroupLedgerStateDeltasForRound(round: number | bigint): Promise<TransactionGroupLedgerStateDeltasForRoundResponse>;
-  getTransactionProof(round: number | bigint, txId: string, params?: {
-    hashtype?: 'sha512_256' | 'sha256';
-  }): Promise<TransactionProof>;
-  /**
-   * Retrieves the supported API versions, binary build versions, and genesis information.
-   */
-  getVersion(): Promise<Version>;
-  healthCheck(): Promise<void>;
-  /**
-   * Given a transaction ID of a recently submitted transaction, it returns information about it.  There are several cases when this might succeed:
-   * - transaction committed (committed round > 0)
-   * - transaction still in the pool (committed round = 0, pool error = "")
-   * - transaction removed from pool due to error (committed round = 0, pool error != "")
-   * Or the transaction may have happened sufficiently long ago that the node no longer remembers it, and this will return an error.
-   */
-  pendingTransactionInformation(txId: string): Promise<PendingTransactionResponse>;
   private _rawTransaction;
+  ready(): Promise<void>;
   /**
    * Sets the timestamp offset (seconds) for blocks in dev mode. Providing an offset of 0 will unset this value and try to use the real clock for the timestamp.
    */
@@ -139,10 +121,17 @@ declare class AlgodApi {
    */
   setSyncRound(round: number | bigint): Promise<void>;
   simulateTransactions(body: SimulateRequest): Promise<SimulateResponse>;
+  stateProof(round: number | bigint): Promise<StateProof>;
+  status(): Promise<NodeStatusResponse>;
   /**
    * Waits for a block to appear after round {round} and returns the node's status at the time. There is a 1 minute timeout, when reached the current status is returned regardless of whether or not it is the round after the given round.
    */
   statusAfterBlock(round: number | bigint): Promise<NodeStatusResponse>;
+  supply(): Promise<SupplyResponse>;
+  /**
+   * Gets the minimum sync round for the ledger.
+   */
+  syncRound(): Promise<GetSyncRoundResponse>;
   /**
    * Given TEAL source code in plain text, return base64 encoded program bytes and base32 SHA512_256 hash of program bytes (Address style). This endpoint is only enabled when a node's configuration file sets EnableDeveloperAPI to true.
    */
@@ -153,11 +142,22 @@ declare class AlgodApi {
    * Given the program bytes, return the TEAL source code in plain text. This endpoint is only enabled when a node's configuration file sets EnableDeveloperAPI to true.
    */
   tealDisassemble(body: Uint8Array): Promise<DisassembleResponse>;
+  /**
+   * Get ledger deltas for transaction groups in a given round.
+   */
+  transactionGroupLedgerStateDeltasForRound(round: number | bigint): Promise<TransactionGroupLedgerStateDeltasForRoundResponse>;
   private _transactionParams;
+  transactionProof(round: number | bigint, txId: string, params?: {
+    hashtype?: 'sha512_256' | 'sha256';
+  }): Promise<TransactionProof>;
   /**
    * Unset the ledger sync round.
    */
   unsetSyncRound(): Promise<void>;
+  /**
+   * Retrieves the supported API versions, binary build versions, and genesis information.
+   */
+  version(): Promise<Version>;
   /**
    * Send a signed transaction or array of signed transactions to the network.
    */
@@ -165,7 +165,7 @@ declare class AlgodApi {
   /**
    * Given an application ID and box name, it returns the round, box name, and value.
    */
-  getApplicationBoxByName(applicationId: number | bigint, boxName: Uint8Array): Promise<Box>;
+  applicationBoxByName(applicationId: number | bigint, boxName: Uint8Array): Promise<Box>;
   /**
    * Returns the common needed parameters for a new transaction.
    */
@@ -173,7 +173,7 @@ declare class AlgodApi {
   /**
    * Returns the common needed parameters for a new transaction.
    */
-  getTransactionParams(): Promise<SuggestedParams>;
+  transactionParams(): Promise<SuggestedParams>;
   /**
    * Simulate an encoded signed transaction or array of encoded signed transactions.
    */