@bitgo-beta/sdk-coin-canton 1.0.0-alpha.0

package/LICENSE

@@ -0,0 +1,191 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   Copyright 2022 BitGo
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -0,0 +1,30 @@
+# BitGo sdk-coin-canton
+
+SDK coins provide a modular approach to a monolithic architecture. This and all BitGoJS SDK coins allow developers to use only the coins needed for a given project.
+
+## Installation
+
+All coins are loaded traditionally through the `bitgo` package. If you are using coins individually, you will be accessing the coin via the `@bitgo/sdk-api` package.
+
+In your project install both `@bitgo/sdk-api` and `@bitgo/sdk-coin-canton`.
+
+```shell
+npm i @bitgo/sdk-api @bitgo/sdk-coin-canton
+```
+
+Next, you will be able to initialize an instance of "bitgo" through `@bitgo/sdk-api` instead of `bitgo`.
+
+```javascript
+import { BitGoAPI } from '@bitgo/sdk-api';
+import { Canton } from '@bitgo/sdk-coin-canton';
+
+const sdk = new BitGoAPI();
+
+sdk.register('canton', Canton.createInstance);
+```
+
+## Development
+
+Most of the coin implementations are derived from `@bitgo/sdk-core`, `@bitgo/statics`, and coin specific packages. These implementations are used to interact with the BitGo API and BitGo platform services.
+
+You will notice that the basic version of common class extensions have been provided to you and must be resolved before the package build will succeed. Upon initiation of a given SDK coin, you will need to verify that your coin has been included in the root `tsconfig.packages.json` and that the linting, formatting, and testing succeeds when run both within the coin and from the root of BitGoJS.

package/dist/resources/hash/hash.d.ts

@@ -0,0 +1,5 @@
+import type { IPreparedTransaction } from '../../src/lib/iface';
+
+declare module '../../resources/hash/hash.js' {
+  export function computePreparedTransaction(preparedTransaction: IPreparedTransaction): Promise<Uint8Array>;
+}

package/dist/resources/hash/hash.js

@@ -0,0 +1,297 @@
+// This is the static helper file from canton SDK, replicating it here since we won't be using the canton wallet SDK
+// TODO: https://bitgoinc.atlassian.net/browse/COIN-6016
+const PREPARED_TRANSACTION_HASH_PURPOSE = Uint8Array.from([0x00, 0x00, 0x00, 0x30]);
+const NODE_ENCODING_VERSION = Uint8Array.from([0x01]);
+const HASHING_SCHEME_VERSION = Uint8Array.from([2]);
+async function sha256(message) {
+  const msg = typeof message === 'string' ? new TextEncoder().encode(message) : message;
+  return crypto.subtle.digest('SHA-256', new Uint8Array(msg)).then((hash) => new Uint8Array(hash));
+}
+async function mkByteArray(...args) {
+  const normalizedArgs = args.map((arg) => {
+    if (typeof arg === 'number') {
+      return new Uint8Array([arg]);
+    } else {
+      return arg;
+    }
+  });
+  let totalLength = 0;
+  normalizedArgs.forEach((arg) => {
+    totalLength += arg.length;
+  });
+  const mergedArray = new Uint8Array(totalLength);
+  let offset = 0;
+  normalizedArgs.forEach((arg) => {
+    mergedArray.set(arg, offset);
+    offset += arg.length;
+  });
+  return mergedArray;
+}
+async function encodeBool(value) {
+  return new Uint8Array([value ? 1 : 0]);
+}
+async function encodeInt32(value) {
+  const buffer = new ArrayBuffer(4);
+  const view = new DataView(buffer);
+  view.setInt32(0, value, false); // true for little-endian
+  return new Uint8Array(buffer);
+}
+async function encodeInt64(value) {
+  // eslint-disable-next-line no-undef
+  const num = typeof value === 'bigint' ? value : BigInt(value || 0);
+  const buffer = new ArrayBuffer(8);
+  const view = new DataView(buffer);
+  view.setBigInt64(0, num, false); // true for little-endian
+  return new Uint8Array(buffer);
+}
+async function encodeString(value = '') {
+  const utf8Bytes = new TextEncoder().encode(value);
+  return encodeBytes(utf8Bytes);
+}
+async function encodeBytes(value) {
+  const length = await encodeInt32(value.length);
+  return mkByteArray(length, value);
+}
+async function encodeHash(value) {
+  return value;
+}
+function encodeHexString(value = '') {
+  // Convert hex string to Uint8Array
+  const bytes = new Uint8Array(value.length / 2);
+  for (let i = 0; i < value.length; i += 2) {
+    bytes[i / 2] = parseInt(value.slice(i, i + 2), 16);
+  }
+  return encodeBytes(bytes);
+}
+// Maybe suspicious?
+async function encodeOptional(value, encodeFn) {
+  if (value === undefined || value === null) {
+    return new Uint8Array([0]); // Return empty array for undefined fields
+  } else {
+    return mkByteArray(1, await encodeFn(value));
+  }
+}
+// Maybe suspicious?
+async function encodeProtoOptional(parentValue, fieldName, value, encodeFn) {
+  if (parentValue && parentValue[fieldName] !== undefined) {
+    return mkByteArray(1, await encodeFn(value));
+  } else {
+    return new Uint8Array([0]); // Return empty array for undefined fields
+  }
+}
+async function encodeRepeated(values = [], encodeFn) {
+  const length = await encodeInt32(values.length);
+  const encodedValues = await Promise.all(values.map(encodeFn));
+  return mkByteArray(length, ...encodedValues);
+}
+function findSeed(nodeId, nodeSeeds) {
+  const seed = nodeSeeds.find((seed) => seed.nodeId.toString() === nodeId)?.seed;
+  return seed;
+}
+async function encodeIdentifier(identifier) {
+  return mkByteArray(
+    await encodeString(identifier.packageId),
+    await encodeRepeated(identifier.moduleName.split('.'), encodeString),
+    await encodeRepeated(identifier.entityName.split('.'), encodeString)
+  );
+}
+async function encodeMetadata(metadata) {
+  return mkByteArray(
+    Uint8Array.from([0x01]),
+    await encodeRepeated(metadata.submitterInfo?.actAs, encodeString),
+    await encodeString(metadata.submitterInfo?.commandId),
+    await encodeString(metadata.transactionUuid),
+    await encodeInt32(metadata.mediatorGroup),
+    await encodeString(metadata.synchronizerId),
+    await encodeProtoOptional(metadata, 'minLedgerEffectiveTime', metadata.minLedgerEffectiveTime, encodeInt64),
+    await encodeProtoOptional(metadata, 'maxLedgerEffectiveTime', metadata.maxLedgerEffectiveTime, encodeInt64),
+    await encodeInt64(metadata.preparationTime),
+    await encodeRepeated(metadata.inputContracts, encodeInputContract)
+  );
+}
+async function encodeCreateNode(create, nodeId, nodeSeeds) {
+  return create
+    ? mkByteArray(
+        NODE_ENCODING_VERSION,
+        await encodeString(create.lfVersion),
+        0 /** Create node tag */,
+        await encodeOptional(findSeed(nodeId, nodeSeeds), encodeHash),
+        await encodeHexString(create.contractId),
+        await encodeString(create.packageName),
+        await encodeIdentifier(create.templateId),
+        await encodeValue(create.argument),
+        await encodeRepeated(create.signatories, encodeString),
+        await encodeRepeated(create.stakeholders, encodeString)
+      )
+    : mkByteArray();
+}
+async function encodeExerciseNode(exercise, nodeId, nodesDict, nodeSeeds) {
+  return mkByteArray(
+    NODE_ENCODING_VERSION,
+    await encodeString(exercise.lfVersion),
+    1 /** Exercise node tag */,
+    await encodeHash(findSeed(nodeId, nodeSeeds)),
+    await encodeHexString(exercise.contractId),
+    await encodeString(exercise.packageName),
+    await encodeIdentifier(exercise.templateId),
+    await encodeRepeated(exercise.signatories, encodeString),
+    await encodeRepeated(exercise.stakeholders, encodeString),
+    await encodeRepeated(exercise.actingParties, encodeString),
+    await encodeProtoOptional(exercise, 'interfaceId', exercise.interfaceId, encodeIdentifier),
+    await encodeString(exercise.choiceId),
+    await encodeValue(exercise.chosenValue),
+    await encodeBool(exercise.consuming),
+    await encodeProtoOptional(exercise, 'exerciseResult', exercise.exerciseResult, encodeValue),
+    await encodeRepeated(exercise.choiceObservers, encodeString),
+    await encodeRepeated(exercise.children, encodeNodeId(nodesDict, nodeSeeds))
+  );
+}
+async function encodeFetchNode(fetch) {
+  return mkByteArray(
+    NODE_ENCODING_VERSION,
+    await encodeString(fetch.lfVersion),
+    2 /** Fetch node tag */,
+    await encodeHexString(fetch.contractId),
+    await encodeString(fetch.packageName),
+    await encodeIdentifier(fetch.templateId),
+    await encodeRepeated(fetch.signatories, encodeString),
+    await encodeRepeated(fetch.stakeholders, encodeString),
+    await encodeProtoOptional(fetch, 'interfaceId', fetch.interfaceId, encodeIdentifier),
+    await encodeRepeated(fetch.actingParties, encodeString)
+  );
+}
+async function encodeRollbackNode(rollback, nodesDict, nodeSeeds) {
+  return mkByteArray(
+    NODE_ENCODING_VERSION,
+    3 /** Rollback node tag */,
+    await encodeRepeated(rollback.children, encodeNodeId(nodesDict, nodeSeeds))
+  );
+}
+async function encodeInputContract(contract) {
+  if (contract.contract.oneofKind === 'v1')
+    return mkByteArray(
+      await encodeInt64(contract.createdAt),
+      await sha256(await encodeCreateNode(contract.contract.v1, 'unused_node_id', []))
+    );
+  else throw new Error('Unsupported contract version');
+}
+async function encodeValue(value) {
+  if (value.sum.oneofKind === 'unit') {
+    return Uint8Array.from([0]); // Unit value
+  } else if (value.sum.oneofKind === 'bool') {
+    return mkByteArray(Uint8Array.from([0x01]), await encodeBool(value.sum.bool));
+  } else if (value.sum.oneofKind === 'int64') {
+    return mkByteArray(Uint8Array.from([0x02]), await encodeInt64(parseInt(value.sum.int64, 10)));
+  } else if (value.sum.oneofKind === 'numeric') {
+    return mkByteArray(Uint8Array.from([0x03]), await encodeString(value.sum.numeric));
+  } else if (value.sum.oneofKind === 'timestamp') {
+    // eslint-disable-next-line no-undef
+    return mkByteArray(Uint8Array.from([0x04]), await encodeInt64(BigInt(value.sum.timestamp)));
+  } else if (value.sum.oneofKind === 'date') {
+    return mkByteArray(Uint8Array.from([0x05]), await encodeInt32(value.sum.date));
+  } else if (value.sum.oneofKind === 'party') {
+    return mkByteArray(Uint8Array.from([0x06]), await encodeString(value.sum.party));
+  } else if (value.sum.oneofKind === 'text') {
+    return mkByteArray(Uint8Array.from([0x07]), await encodeString(value.sum.text));
+  } else if (value.sum.oneofKind === 'contractId') {
+    return mkByteArray(Uint8Array.from([0x08]), await encodeHexString(value.sum.contractId));
+  } else if (value.sum.oneofKind === 'optional') {
+    return mkByteArray(
+      Uint8Array.from([0x09]),
+      await encodeProtoOptional(value.sum.optional, 'value', value.sum.optional.value, encodeValue)
+    );
+  } else if (value.sum.oneofKind === 'list') {
+    return mkByteArray(Uint8Array.from([0x0a]), await encodeRepeated(value.sum.list.elements, encodeValue));
+  } else if (value.sum.oneofKind === 'textMap') {
+    return mkByteArray(Uint8Array.from([0x0b]), await encodeRepeated(value.sum.textMap?.entries, encodeTextMapEntry));
+  } else if (value.sum.oneofKind === 'record') {
+    return mkByteArray(
+      Uint8Array.from([0x0c]),
+      await encodeProtoOptional(value.sum.record, 'recordId', value.sum.record.recordId, encodeIdentifier),
+      await encodeRepeated(value.sum.record.fields, encodeRecordField)
+    );
+  } else if (value.sum.oneofKind === 'variant') {
+    return mkByteArray(
+      Uint8Array.from([0x0d]),
+      await encodeProtoOptional(value.sum.variant, 'variantId', value.sum.variant.variantId, encodeIdentifier),
+      await encodeString(value.sum.variant.constructor),
+      await encodeValue(value.sum.variant.value)
+    );
+  } else if (value.sum.oneofKind === 'enum') {
+    return mkByteArray(
+      Uint8Array.from([0x0e]),
+      await encodeProtoOptional(value.sum.enum, 'enumId', value.sum.enum.enumId, encodeIdentifier),
+      await encodeString(value.sum.enum.constructor)
+    );
+  } else if (value.sum.oneofKind === 'genMap') {
+    return mkByteArray(Uint8Array.from([0x0f]), await encodeRepeated(value.sum.genMap?.entries, encodeGenMapEntry));
+  }
+  throw new Error('Unsupported value type: ' + JSON.stringify(value));
+}
+async function encodeTextMapEntry(entry) {
+  return mkByteArray(await encodeString(entry.key), await encodeValue(entry.value));
+}
+async function encodeRecordField(field) {
+  return mkByteArray(await encodeOptional(field.label, encodeString), await encodeValue(field.value));
+}
+async function encodeGenMapEntry(entry) {
+  return mkByteArray(await encodeValue(entry.key), await encodeValue(entry.value));
+}
+function encodeNodeId(nodesDict, nodeSeeds) {
+  return async (nodeId) => {
+    const node = nodesDict[nodeId];
+    if (!node) {
+      throw new Error(`Node with ID ${nodeId} not found in transaction`);
+    }
+    const encodedNode = await encodeNode(node, nodesDict, nodeSeeds);
+    return sha256(encodedNode);
+  };
+}
+async function encodeNode(node, nodesDict, nodeSeeds) {
+  if (node.versionedNode.oneofKind === 'v1') {
+    if (node.versionedNode.v1.nodeType.oneofKind === 'create') {
+      return encodeCreateNode(node.versionedNode.v1.nodeType.create, node.nodeId, nodeSeeds);
+    } else if (node.versionedNode.v1.nodeType.oneofKind === 'exercise') {
+      return encodeExerciseNode(node.versionedNode.v1.nodeType.exercise, node.nodeId, nodesDict, nodeSeeds);
+    } else if (node.versionedNode.v1.nodeType.oneofKind === 'fetch') {
+      return encodeFetchNode(node.versionedNode.v1.nodeType.fetch);
+    } else if (node.versionedNode.v1.nodeType.oneofKind === 'rollback') {
+      return encodeRollbackNode(node.versionedNode.v1.nodeType.rollback, nodesDict, nodeSeeds);
+    }
+    throw new Error('Unsupported node type');
+  } else {
+    throw new Error(`Unsupported node version`);
+  }
+}
+function createNodesDict(preparedTransaction) {
+  const nodesDict = {};
+  const nodes = preparedTransaction.transaction?.nodes || [];
+  for (const node of nodes) {
+    nodesDict[node.nodeId] = node;
+  }
+  return nodesDict;
+}
+async function encodeTransaction(transaction, nodesDict, nodeSeeds) {
+  return mkByteArray(
+    await encodeString(transaction.version),
+    await encodeRepeated(transaction.roots, encodeNodeId(nodesDict, nodeSeeds))
+  );
+}
+async function hashTransaction(transaction, nodesDict) {
+  const encodedTransaction = await encodeTransaction(transaction, nodesDict, transaction.nodeSeeds);
+  const hash = await sha256(await mkByteArray(PREPARED_TRANSACTION_HASH_PURPOSE, encodedTransaction));
+  return hash;
+}
+async function hashMetadata(metadata) {
+  const hash = await sha256(await mkByteArray(PREPARED_TRANSACTION_HASH_PURPOSE, await encodeMetadata(metadata)));
+  return hash;
+}
+async function encodePreparedTransaction(preparedTransaction) {
+  const nodesDict = createNodesDict(preparedTransaction);
+  const transactionHash = await hashTransaction(preparedTransaction.transaction, nodesDict);
+  const metadataHash = await hashMetadata(preparedTransaction.metadata);
+  return mkByteArray(PREPARED_TRANSACTION_HASH_PURPOSE, HASHING_SCHEME_VERSION, transactionHash, metadataHash);
+}
+export async function computePreparedTransaction(preparedTransaction) {
+  return sha256(await encodePreparedTransaction(preparedTransaction));
+}

package/dist/resources/proto/damlTransaction.js

@@ -0,0 +1,100 @@
+import { MessageType, UnknownFieldHandler, reflectionMergePartial, WireType } from '@protobuf-ts/runtime';
+import { DamlTransaction_Node } from './damlTransactionNode.js';
+import { DamlTransaction_NodeSeed } from './damlTransactionNodeSeed.js';
+
+class DamlTransaction$Type extends MessageType {
+  constructor() {
+    super('com.daml.ledger.api.v2.interactive.DamlTransaction', [
+      {
+        no: 1,
+        name: 'version',
+        kind: 'scalar',
+        T: 9 /*ScalarType.STRING*/,
+      },
+      {
+        no: 2,
+        name: 'roots',
+        kind: 'scalar',
+        repeat: 2 /*RepeatType.UNPACKED*/,
+        T: 9 /*ScalarType.STRING*/,
+      },
+      {
+        no: 3,
+        name: 'nodes',
+        kind: 'message',
+        repeat: 2 /*RepeatType.UNPACKED*/,
+        T: () => DamlTransaction_Node,
+      },
+      {
+        no: 4,
+        name: 'node_seeds',
+        kind: 'message',
+        repeat: 2 /*RepeatType.UNPACKED*/,
+        T: () => DamlTransaction_NodeSeed,
+      },
+    ]);
+  }
+  create(value) {
+    const message = Object.create(this.messagePrototype);
+    message.version = '';
+    message.roots = [];
+    message.nodes = [];
+    message.nodeSeeds = [];
+    if (value !== undefined) reflectionMergePartial(this, message, value);
+    return message;
+  }
+  internalBinaryRead(reader, length, options, target) {
+    const message = target ?? this.create(),
+      end = reader.pos + length;
+    while (reader.pos < end) {
+      const [fieldNo, wireType] = reader.tag();
+      switch (fieldNo) {
+        case /* string version */ 1:
+          message.version = reader.string();
+          break;
+        case /* repeated string roots */ 2:
+          message.roots.push(reader.string());
+          break;
+        case /* repeated com.daml.ledger.api.v2.interactive.DamlTransaction.Node nodes */ 3:
+          message.nodes.push(DamlTransaction_Node.internalBinaryRead(reader, reader.uint32(), options));
+          break;
+        case /* repeated com.daml.ledger.api.v2.interactive.DamlTransaction.NodeSeed node_seeds */ 4:
+          message.nodeSeeds.push(DamlTransaction_NodeSeed.internalBinaryRead(reader, reader.uint32(), options));
+          break;
+        default:
+          const u = options.readUnknownField;
+          if (u === 'throw') throw new Error(`Unknown field ${fieldNo} (wire type ${wireType}) for ${this.typeName}`);
+          const d = reader.skip(wireType);
+          if (u !== false) (u === true ? UnknownFieldHandler.onRead : u)(this.typeName, message, fieldNo, wireType, d);
+      }
+    }
+    return message;
+  }
+  internalBinaryWrite(message, writer, options) {
+    /* string version = 1; */
+    if (message.version !== '') writer.tag(1, WireType.LengthDelimited).string(message.version);
+    /* repeated string roots = 2; */
+    for (let i = 0; i < message.roots.length; i++) writer.tag(2, WireType.LengthDelimited).string(message.roots[i]);
+    /* repeated com.daml.ledger.api.v2.interactive.DamlTransaction.Node nodes = 3; */
+    for (let i = 0; i < message.nodes.length; i++)
+      DamlTransaction_Node.internalBinaryWrite(
+        message.nodes[i],
+        writer.tag(3, WireType.LengthDelimited).fork(),
+        options
+      ).join();
+    /* repeated com.daml.ledger.api.v2.interactive.DamlTransaction.NodeSeed node_seeds = 4; */
+    for (let i = 0; i < message.nodeSeeds.length; i++)
+      DamlTransaction_NodeSeed.internalBinaryWrite(
+        message.nodeSeeds[i],
+        writer.tag(4, WireType.LengthDelimited).fork(),
+        options
+      ).join();
+    const u = options.writeUnknownFields;
+    if (u !== false) (u === true ? UnknownFieldHandler.onWrite : u)(this.typeName, message, writer);
+    return writer;
+  }
+}
+/**
+ * @generated MessageType for protobuf message com.daml.ledger.api.v2.interactive.DamlTransaction
+ */
+export const DamlTransaction = new DamlTransaction$Type();