sememe 0.0.0-stage → 0.4.22

package/src/union.mjs

@@ -0,0 +1,428 @@
+// Union decode: one payload against TWO verified interface sources, with the
+// disagreement made explicit and arbitrated by bytes, not by preference.
+//
+// Why this exists: the pump.fun measurement (research/traffic-coverage-2026-10-30.json)
+// showed that a deployed program's own on-chain IDL account and its first-party
+// published copy DISAGREE about real mainnet traffic — 996 payloads, same window:
+//   on-chain alone      669/996 decoded
+//   published alone     880/996 decoded
+//   union of both       914/996 decoded
+// The union there was a hand-merged IDL inside a measurement tool. This module is
+// the product form of that result: both sources stay intact, every decode names
+// which source produced it, and the two sources must answer the same question:
+//
+//   - Both decode to the SAME name and args  -> 'agree'
+//   - Both decode, same name, different args -> 'layout_drift'; the winner is
+//     chosen by byte evidence: the source whose re-encode reproduces the WHOLE
+//     payload explains the bytes the other only prefixes (measured: the
+//     published `partial_fill` argument on `buy`-family instructions — real
+//     long-form payloads leave 1 unexplained byte under the on-chain layout).
+//     When both or neither explain fully, the primary wins and the drift is
+//     reported, not hidden.
+//   - One refuses, the other decodes        -> 'fallback_secondary' — but ONLY
+//     if the surviving decode re-encodes to the actual bytes (full or
+//     described prefix). A second source that names bytes it cannot reproduce
+//     is refused, exactly like a first source would be.
+//   - Names differ on the same discriminator -> hard refusal. Two different
+//     names for the same bytes is an interface conflict, not a decode: guessing
+//     either one would launder it.
+//   - Both refuse                           -> refusal with BOTH named reasons.
+//
+// Nothing here mutates either source. Discriminator gaps are filled per source
+// with Anchor's rule (src/discriminators.mjs) before decoding, so two legacy
+// sources can be compared at all; stored discriminators are never touched.
+
+import { decodeData, encodeInstructionData, encodeEventData, toJsonSafe } from './codec.mjs';
+import { withDerivedDiscriminators, snakeCase, globalDiscriminator } from './discriminators.mjs';
+import { diffArgsByNormalisedName } from './drift.mjs';
+
+const MAX_DIFF_PATHS = 20;
+
+/** Named refusal carrying the verdict, so callers can tally without parsing text. */
+export class UnionRefusal extends Error {
+  constructor(verdict, message, details) {
+    super(message);
+    this.name = 'UnionRefusal';
+    this.verdict = verdict;
+    this.details = details ?? {};
+  }
+}
+
+const reasonOf = (error) => String(error?.message ?? error).slice(0, 200);
+
+/**
+ * Decode + re-encode under one source's own layout; every fact stays per-source.
+ *
+ * `absentPolicy` is passed through to the decoder. With 'report' a source that
+ * declares one field more than the wire carries can still decode — and then
+ * the re-encode MUST omit exactly the fields the decode reported absent, or
+ * the bytes would not reproduce and the decode would look like a guess. The
+ * absent list therefore travels from decode to re-encode: byte-exactness is
+ * what makes an absent field honest instead of invented.
+ */
+function probe(source, bytes, absentPolicy) {
+  try {
+    const decoded = decodeData(source.idl, bytes, { trailing: 'report', absent: absentPolicy });
+    const reencoded = decoded.kind === 'instruction'
+      ? encodeInstructionData(source.idl, decoded.instruction, decoded.args, { absent: decoded.absent })
+      : encodeEventData(source.idl, decoded.event, decoded.args, { tagged: decoded.tagged });
+    const described = bytes.subarray(0, decoded.consumed);
+    return {
+      ok: true,
+      decoded,
+      fullExact: reencoded.equals(bytes),
+      describedExact: reencoded.equals(described),
+    };
+  } catch (error) {
+    return { ok: false, reason: reasonOf(error) };
+  }
+}
+
+/** Prepare one caller-verified IDL: fill discriminator gaps per source, keep counts.
+ * The source's identity (`idlMeta`, `objectPath`) rides along so the winning
+ * side's provenance can be quoted in the result. */
+function prepare(source) {
+  const { idl: filledIdl, filled, conflicts } = withDerivedDiscriminators(source.idl);
+  // The STORED discriminators, kept per instruction name: a rename is
+  // recognized by the bytes, not by a name similarity — see the rename check
+  // in unionDecode. Stored means any non-empty byte array the source
+  // published (HADRo stores 1-byte discriminators) — the same "stored is
+  // stored at any length" rule as src/discriminators.mjs; the old length===8
+  // gate silently dropped every short stored byte from this evidence map.
+  const stored = new Map();
+  for (const ix of source.idl?.instructions ?? []) {
+    if (ix && typeof ix.name === 'string' && Array.isArray(ix.discriminator) && ix.discriminator.length > 0) {
+      stored.set(ix.name, Buffer.from(ix.discriminator).toString('hex'));
+    }
+  }
+  return {
+    ...source,
+    idl: filledIdl,
+    storedDiscriminators: stored,
+    discriminatorDerivation: {
+      filledInstructions: filled.instructions,
+      filledEvents: filled.events,
+      conflicts: conflicts.length,
+    },
+  };
+}
+
+/** Field paths where two decoded arg trees disagree (bounded, stable order). */
+/**
+ * Field paths where two decoded instruction or event trees disagree,
+ * compared by NORMALISED spelling (src/drift.mjs).
+ *
+ * `paths.paths` lists the REAL differences in data or shape;
+ * `paths.spellingOnly` lists the fields both copies declare under different
+ * names. Returns the existing `{ paths, truncated }` shape tests pin.
+ */
+function diffPaths(primaryArgs, secondaryArgs) {
+  const diff = diffArgsByNormalisedName(primaryArgs, secondaryArgs, { max: MAX_DIFF_PATHS });
+  return {
+    paths: diff.paths,
+    truncated: diff.truncated,
+    differs: diff.differs,
+    spellingOnly: diff.spellingOnly,
+  };
+}
+
+function decodeFields(source, probeResult, bytes) {
+  const { decoded } = probeResult;
+  const described = bytes.subarray(0, decoded.consumed);
+  return {
+    kind: decoded.kind,
+    instruction: decoded.kind === 'instruction' ? decoded.instruction : undefined,
+    event: decoded.kind === 'event' ? decoded.event : undefined,
+    name: decoded.kind === 'instruction' ? decoded.instruction : decoded.event,
+    discriminator: decoded.discriminator,
+    tagged: decoded.tagged,
+    args: toJsonSafe(decoded.args),
+    // Declared fields this source's layout does not carry in these bytes.
+    // Non-empty means the wire is SHORTER than the interface says — the
+    // caller can see that instead of having to infer it from missing keys.
+    absent: decoded.absent ?? [],
+    bytes: bytes.length,
+    consumed: decoded.consumed,
+    trailing: decoded.trailing,
+    roundTripByteExact: probeResult.fullExact,
+    describedRoundTripByteExact: probeResult.describedExact,
+    describedBytes: described.length,
+  };
+}
+
+function resultEnvelope(program, fields, winnerSource, view) {
+  return {
+    program,
+    ...fields,
+    // Provenance of the decode: WHICH verified source produced the answer, and
+    // what the OTHER source said. `idl` describes the winning source only.
+    idl: winnerSource.idlMeta,
+    object: winnerSource.objectPath,
+    view,
+  };
+}
+
+/**
+ * Decode `bytes` against a primary and an optional secondary interface source.
+ *
+ * Both IDLs must already be store-verified by the caller (receipt re-hash etc.)
+ * — this module deliberately does not re-verify, it arbitrates. Sources are
+ * `{ label, idl, idlMeta, objectPath }`; `idlMeta` is quoted verbatim in the
+ * result's `idl` field (fingerprint/slot/source/receipt of the winning side).
+ *
+ * Returns the decoded result on 'agree' | 'layout_drift' | 'fallback_secondary'
+ * | 'single_source'; throws `UnionRefusal` for 'name_conflict', a secondary
+ * fallback without byte evidence, and total refusal.
+ */
+export function unionDecode({ program, primary, secondary, bytes, absent, additional = [] }) {
+  // An adopted copy is a VERIFIED source like any other: it may stand alone
+  // when there is no on-chain pull to sit next to. The acquisition gap
+  // (a program with no pullable IDL account — measured for Jupiter Liquidity
+  // and Raydium AMM v4 in the traffic sample) produced stores that hold a
+  // published copy and nothing else; refusing those with "needs a primary
+  // source" reported "no interface" about a store that has one, and made the
+  // union flag disagree with the plain decode on the same bytes.
+  // What an adopted copy must NEVER do is DISPLACE an on-chain pull: that is
+  // still the primary whenever one exists.
+  const soleSource = !primary?.idl && secondary?.idl ? secondary : null;
+  if (!primary?.idl && !soleSource) throw new UnionRefusal('invalid_input', 'unionDecode needs a primary source');
+  // The payload bytes are normalized to a Buffer here, not merely CHECKED
+  // for being one. The union path compares the re-encoded bytes with the
+  // input (`reencoded.equals(bytes)`), and a plain Uint8Array has no
+  // `equals`; the old check refused such input outright, which made the
+  // base58 CLI path fail on every payload with "unionDecode needs the
+  // payload bytes as a Buffer" while the same bytes as hex decoded fine.
+  // A caller may hand over any byte array; the shape of the input must not
+  // decide whether it decodes.
+  if (!(bytes instanceof Uint8Array)) {
+    throw new UnionRefusal('invalid_input', 'unionDecode needs the payload bytes as a Buffer');
+  }
+  bytes = Buffer.isBuffer(bytes)
+    ? bytes
+    : Buffer.from(bytes.buffer, bytes.byteOffset, bytes.byteLength);
+  // 'error' is the default and keeps the whole product strict. 'report' is the
+  // opt-in that lets a source decode a wire form SHORTER than its own layout
+  // declares — measured as chain-accepted on mainnet (research/
+  // short-form-wire-forms-2026-11-03.json).
+  const absentPolicy = absent ?? 'error';
+  if (absentPolicy !== 'report' && absentPolicy !== 'error') {
+    throw new UnionRefusal('invalid_input', `unknown absent policy ${JSON.stringify(absent)}`);
+  }
+  const prim = prepare(soleSource ?? primary);
+  const sec = secondary?.idl && secondary !== soleSource ? prepare(secondary) : null;
+  // Whether the sources that answered came from the chain at all. A source with
+  // no slot is an ADOPTED copy, and a store holding only adopted copies has no
+  // on-chain answer — the verdict must say so even when the pair is full.
+  const primAdopted = prim.idlMeta?.slot === null || prim.idlMeta?.slot === undefined;
+  const secAdopted = !sec || sec.idlMeta?.slot === null || sec.idlMeta?.slot === undefined;
+  const adoptedOnly = primAdopted && secAdopted;
+
+  const primProbe = probe(prim, bytes, absentPolicy);
+  const secProbe = sec ? probe(sec, bytes, absentPolicy) : null;
+
+  const sourceView = (source, probeResult) => probeResult === null
+    ? { label: source?.label ?? null, present: false }
+    : {
+      label: source.label,
+      present: true,
+      // The copy this view describes, named by content. A view that only
+      // carries a LABEL cannot be compared with the plain reader's answer:
+      // the label holds the origin the caller typed, the fingerprint holds
+      // the bytes. The disagreement this fixes was invisible without it.
+      fingerprint: source.idlMeta?.fingerprint ?? null,
+      receipt: source.idlMeta?.receipt ?? null,
+      decoded: probeResult.ok,
+      refusedReason: probeResult.ok ? undefined : probeResult.reason,
+      name: probeResult.ok ? probeResult.decoded.kind === 'instruction'
+        ? probeResult.decoded.instruction : probeResult.decoded.event : undefined,
+      roundTripByteExact: probeResult.ok ? probeResult.fullExact : undefined,
+      describedRoundTripByteExact: probeResult.ok ? probeResult.describedExact : undefined,
+      trailingBytes: probeResult.ok ? probeResult.decoded.trailing.count : undefined,
+      absentFields: probeResult.ok ? (probeResult.decoded.absent ?? []).length : undefined,
+    };
+
+  const view = {
+    primary: sourceView(prim, primProbe),
+    secondary: sourceView(sec, secProbe),
+    sourcesAgree: null,
+    // Every source that answered came from an adopted copy iff no real slot
+    // is behind either consulted source — set once, for every verdict, so the
+    // flag cannot disagree with the sources that were actually read.
+    adoptedOnly,
+    additionalSources: additional.map((a) => ({
+      label: a.label,
+      fingerprint: a.idlMeta?.fingerprint,
+      receipt: a.idlMeta?.receipt,
+    })),
+  };
+
+  // Single source: behave like a plain decode, but say so.
+  if (!sec) {
+    if (!primProbe.ok) {
+      throw new UnionRefusal('refused',
+        `decode refused by the only stored source (${prim.label}): ${primProbe.reason}`,
+        { view });
+    }
+    const fields = decodeFields(prim, primProbe, bytes);
+    view.verdict = 'single_source';
+    view.adoptedOnly = adoptedOnly;
+    view.arbitration = { winner: prim.label, basis: 'only_source', evidence: primProbe.fullExact ? 'full_roundtrip' : 'described_roundtrip' };
+    return resultEnvelope(program, fields, prim, view);
+  }
+
+  view.discriminatorDerivation = { primary: prim.discriminatorDerivation, secondary: sec.discriminatorDerivation };
+
+  // Both refuse: the payload is refused, with both named reasons visible.
+  if (!primProbe.ok && !secProbe.ok) {
+    throw new UnionRefusal('refused',
+      `both stored sources refuse this payload — ${prim.label}: ${primProbe.reason}; ${sec.label}: ${secProbe.reason}`,
+      { view });
+  }
+
+  // Primary refuses, secondary decodes: only byte evidence admits the fallback.
+  if (!primProbe.ok && secProbe.ok) {
+    if (!secProbe.fullExact && !secProbe.describedExact) {
+      throw new UnionRefusal('union_fallback_refused',
+        `${prim.label} refuses (${primProbe.reason}); ${sec.label} names `
+        + `"${secProbe.decoded.kind === 'instruction' ? secProbe.decoded.instruction : secProbe.decoded.event}" `
+        + `but cannot re-encode the bytes, so the fallback is refused`,
+        { view });
+    }
+    const fields = decodeFields(sec, secProbe, bytes);
+    view.verdict = 'fallback_secondary';
+    view.sourcesAgree = false;
+    view.arbitration = {
+      winner: sec.label,
+      basis: 'primary_refused',
+      evidence: secProbe.fullExact ? 'full_roundtrip' : 'described_roundtrip',
+    };
+    return resultEnvelope(program, fields, sec, view);
+  }
+
+  // Secondary refuses, primary decodes: plain primary decode, refusal recorded.
+  if (primProbe.ok && !secProbe.ok) {
+    const fields = decodeFields(prim, primProbe, bytes);
+    view.verdict = 'primary_only';
+    view.sourcesAgree = false;
+    view.arbitration = {
+      winner: prim.label,
+      basis: 'secondary_refused',
+      evidence: primProbe.fullExact ? 'full_roundtrip' : 'described_roundtrip',
+    };
+    return resultEnvelope(program, fields, prim, view);
+  }
+
+  // Both decode. Same discriminator matched by both sources (decodeData works
+  // on discriminators), so the NAMES must agree — two different names for the
+  // same bytes is an interface conflict, not a decode.
+  const primFields = decodeFields(prim, primProbe, bytes);
+  const secFields = decodeFields(sec, secProbe, bytes);
+  //
+  // Measured exception (2026-11-04, step-ingestooor sweep, 31 payloads across
+  // hubble/dca/farms/vaults/perps/marginfi/tuna/referrals): Anchor's own rule
+  // derives the INSTRUCTION discriminator from the snake-cased name
+  // (sha256("global:" + snake_case(name))[0..8]), so two sources that matched
+  // the same 8 bytes and differ only in naming CONVENTION (`closeDca` vs
+  // `close_dca`, `repayLoan` vs `repay_loan`) are describing ONE wire
+  // instruction — refusing it would refuse real, successfully executed
+  // traffic over a spelling difference. That case is DECODED, the convention
+  // difference recorded under `view.namingConvention`, the on-chain name kept
+  // as the answer. EVENTS stay strict: their discriminator hashes the raw
+  // name (no snake_case), so two event names that differ at all are two
+  // different claimed schemas for the same bytes.
+  if (primFields.name !== secFields.name || primFields.kind !== secFields.kind) {
+    const sameInstructionTwoConventions = primFields.kind === 'instruction'
+      && secFields.kind === 'instruction'
+      && snakeCase(primFields.name) === snakeCase(secFields.name);
+    const storedDisc = (source, name) => source.storedDiscriminators?.get(name) ?? null;
+    const ruleDisc = (name) => Buffer.from(globalDiscriminator(name)).toString('hex');
+    const renamedByPrimary = storedDisc(prim, primFields.name) === ruleDisc(secFields.name);
+    const renamedBySecondary = storedDisc(sec, secFields.name) === ruleDisc(primFields.name);
+    // The convention check comes FIRST: for `closeDca` vs `close_dca` Anchor's
+    // rule yields the same discriminator either way, so both the convention
+    // and the rename test would match — but it is one instruction under two
+    // spellings, not a rename, and the recorded `kind` must say so.
+    const sameInstructionRenamed = !sameInstructionTwoConventions
+      && primFields.kind === 'instruction'
+      && secFields.kind === 'instruction'
+      && (renamedByPrimary || renamedBySecondary);
+    if (!sameInstructionTwoConventions && !sameInstructionRenamed) {
+      throw new UnionRefusal('name_conflict',
+        `interface conflict on the same bytes: ${prim.label} says "${primFields.name}", `
+        + `${sec.label} says "${secFields.name}" — refusing instead of picking a winner`,
+        { view: { ...view, primary: { ...view.primary, name: primFields.name }, secondary: { ...view.secondary, name: secFields.name } } });
+    }
+    view.namingConvention = {
+      primary: primFields.name,
+      secondary: secFields.name,
+      kind: sameInstructionRenamed ? 'rename' : 'naming-convention',
+      rule: sameInstructionRenamed
+        ? "anchor: the primary's stored discriminator equals sha256('global:' + snake_case(secondary name))[0..8] — same wire instruction, renamed by the program; the on-chain name answers"
+        : "anchor: sha256('global:' + snake_case(name))[0..8] — same instruction, two naming conventions; the on-chain name answers",
+    };
+  }
+
+  // Arbitration by bytes, strongest evidence first:
+  //   1. A source that re-encodes the WHOLE payload explains every byte.
+  //   2. Otherwise, the source with FEWER unexplained trailing bytes explains
+  //      strictly more of the same bytes (measured on pump.fun events: the
+  //      on-chain TradeEvent copy declares 34 fields and leaves 16 bytes
+  //      unexplained, the published copy declares the additional
+  //      creator_fee_unclaimed: u64 and leaves 8; both still leave the known
+  //      8-byte tail, so the disagreement stays REPORTED under `drift`).
+  // When the evidence does not decide, the primary stands and the drift is
+  // reported — never hidden, never resolved by preference.
+  let winner = prim;
+  let basis = 'primary_by_default';
+  let evidence = primProbe.fullExact ? 'full_roundtrip' : (primProbe.describedExact ? 'described_roundtrip' : null);
+  const primTrailing = primProbe.decoded.trailing.count;
+  const secTrailing = secProbe.decoded.trailing.count;
+  if (secProbe.fullExact && !primProbe.fullExact) {
+    winner = sec;
+    basis = 'byte_evidence_full_roundtrip';
+    evidence = 'full_roundtrip';
+  } else if (!primProbe.fullExact && !secProbe.fullExact
+    && primProbe.describedExact && secProbe.describedExact
+    && secTrailing < primTrailing) {
+    winner = sec;
+    basis = 'byte_evidence_fewer_unexplained_bytes';
+    evidence = `trailing ${secTrailing} < ${primTrailing}`;
+  }
+
+  // The two copies AGREE about the data or they do not. A field that one
+  // copy spells `inAmount` and the other spells `in_amount` is the same
+  // field; the spelling is not a disagreement about the bytes. Before this
+  // rule the union compared the two argument trees with raw JSON equality,
+  // so a naming difference produced the verdict `layout_drift` with paths
+  // that listed only the differing spellings (measured 2026-11-09: ALL 643
+  // meteora-damm-v1 instruction rows were pure spelling differences —
+  // `inAmount` in one, `in_amount` in the other, both decoding to the same
+  // values). The report told the caller the two copies disagreed about the
+  // data about fields whose data was identical.
+  const diff = diffPaths(primFields.args, secFields.args);
+  const argsAgree = !diff.differs;
+  const fields = winner === prim ? primFields : secFields;
+  view.sourcesAgree = argsAgree;
+  view.arbitration = { winner: winner.label, basis, evidence };
+
+  if (!argsAgree) {
+    view.verdict = 'layout_drift';
+    view.drift = {
+      paths: diff,
+      primaryExplainsFully: primProbe.fullExact,
+      secondaryExplainsFully: secProbe.fullExact,
+      primaryTrailingBytes: primTrailing,
+      secondaryTrailingBytes: secTrailing,
+      note: 'both sources decoded the same bytes to different arguments; the winner was chosen by byte evidence where it decides, otherwise the primary stands and the drift is reported',
+    };
+  } else {
+    view.verdict = 'agree';
+    if (diff.spellingOnly.length > 0) {
+      view.naming = {
+        spellingOnly: diff.spellingOnly,
+        note: 'the two copies spell the same fields differently and decode them to the same values; the naming difference is reported, it is not a disagreement about the data',
+      };
+    }
+  }
+  return resultEnvelope(program, fields, winner, view);
+}

package/vendor/anza-solana-sdk/8db406e2edfafa25939ec782b77b5b6f30de164d/LICENSE.txt

@@ -0,0 +1,201 @@
+                                 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
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   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.