@paraswap/dex-lib 3.7.0 → 3.7.2

package/build/executor/compressor/compress.js

@@ -0,0 +1,187 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+const computeCostL2_1 = __importDefault(require("./utils/computeCostL2"));
+const intToByte_1 = __importDefault(require("./utils/intToByte"));
+const searchUnusedBytes_1 = __importDefault(require("./compress_functions/searchUnusedBytes"));
+const byteSubstitution_1 = __importDefault(require("./compress_functions/byteSubstitution"));
+const findLongestAndSubstitute_1 = __importDefault(require("./compress_functions/findLongestAndSubstitute"));
+const addressSubstitution_1 = __importDefault(require("./compress_functions/addressSubstitution"));
+const addressSubstitutionFromObject_1 = __importDefault(require("./compress_functions/addressSubstitutionFromObject"));
+const lodash_1 = require("lodash");
+const zeroByte = '00';
+const ffByte = 'ff';
+const trimHex = (hex) => {
+    return hex.startsWith('0x') ? hex.slice(2) : hex;
+};
+const compress = function ({ initialCallData, addresses, options, network, }) {
+    if (initialCallData.length % 2 !== 0)
+        throw new Error('Initial data of odd length');
+    if (!options)
+        options = {};
+    const initialCost = (0, computeCostL2_1.default)(initialCallData);
+    initialCallData = trimHex(initialCallData);
+    let callData = initialCallData;
+    const savedAddresses = (0, lodash_1.pickBy)(addresses, v => v.saved);
+    let newAddresses = Object.keys((0, lodash_1.pickBy)(addresses, v => !v.saved)).map(address => address.substring(2).toLocaleLowerCase());
+    // SAVED ADDRESSES SUBSTITUTIONS
+    if (!options.skipAddressSubstitution) {
+        callData = (0, addressSubstitutionFromObject_1.default)({
+            callData,
+            addressesObject: savedAddresses,
+        });
+    }
+    if (!options.skipNewAddressSubstitution) {
+        // NEW ADDRESSES REMOVING USELESS AND HIGHLIGHTING GOOD
+        newAddresses = newAddresses.filter(addr => callData.includes(addr));
+        // NEW ADDRESSES SUBSTITUTIONS
+        callData = (0, addressSubstitution_1.default)({
+            callData,
+            addresses: newAddresses,
+            isSavedAddresses: false,
+        });
+    }
+    // ZEROES SUBSTITUTIONS
+    // I couldn't get ride of 0 around addresses because of potential zeroes absence around addresses in later call data formats
+    // An idea could be to have another address prefix to handle this case (one with both sides having 00 by default), but it doesn't optimize that much
+    let { compressedCallData, bufferOfOccurences } = (0, byteSubstitution_1.default)({
+        byte: zeroByte,
+        callData,
+        addressPrefix: 'RR',
+        newAddressPrefix: 'TT',
+    });
+    let numberOfZeroes = bufferOfOccurences;
+    // console.log({numberOfZeroes})
+    // COUNTING BYTES AND CHOSING MAX BYTE IN ZEROES
+    // Counting bytes occurences in numberOfZeroes
+    let byteCountsInZeroes = {};
+    for (let i = 0; i < numberOfZeroes.length; i += 2) {
+        const byte = numberOfZeroes.substring(i, i + 2);
+        if (!byteCountsInZeroes[byte])
+            byteCountsInZeroes[byte] = 1;
+        else
+            byteCountsInZeroes[byte]++;
+    }
+    // Finding max byte in numberOfZeroes
+    let maxByteInZeroes = '';
+    let maxInZeroes = 0;
+    for (let byte of Object.keys(byteCountsInZeroes)) {
+        if (byteCountsInZeroes[byte] > maxInZeroes) {
+            maxInZeroes = byteCountsInZeroes[byte];
+            maxByteInZeroes = byte;
+        }
+    }
+    // Substituting max byte of numberOfZeroes in compressedData
+    for (let i = 0; i < compressedCallData.length; i += 2) {
+        const currentByte = compressedCallData.slice(i, i + 2);
+        if (currentByte === zeroByte) {
+            if (i < compressedCallData.length - 2) {
+                const nextByte = compressedCallData.slice(i + 2, i + 4);
+                if (nextByte === maxByteInZeroes) {
+                    compressedCallData =
+                        compressedCallData.substring(0, i + 2) +
+                            zeroByte +
+                            compressedCallData.substring(i + 4);
+                    i += 2;
+                }
+            }
+        }
+        else if (currentByte === 'RR')
+            i += 6;
+        else if (currentByte === 'TT')
+            i += 2;
+    }
+    // console.log({maxByteInZeroes, maxInZeroes, compressedCallData})
+    // SEARCH FOR UNIQUE ADDRESSES PREFIXES AND DUPLICATED STRING MARKERS
+    let { addressPrefix, newAddressPrefix, duplicatedStringMarkers } = (0, searchUnusedBytes_1.default)({
+        newAddresses,
+        compressedCallData,
+    });
+    // console.log({addressPrefix, newAddressPrefix, duplicatedStringMarkers})
+    // ADDRESSES PREFIX SUBSTITUTIONS
+    if (addressPrefix &&
+        addressPrefix !== '' &&
+        !options.skipAddressSubstitution) {
+        const regex = new RegExp('RR', 'g');
+        compressedCallData = compressedCallData.replace(regex, addressPrefix);
+    }
+    else if (addressPrefix === '' && !options.skipAddressSubstitution) {
+        // If no unused byte for addressPrefix remove the logic for address
+        return compress({
+            initialCallData: initialCallData,
+            addresses,
+            options: {
+                skipAddressSubstitution: true,
+                skipNewAddressSubstitution: true,
+            },
+            network,
+        });
+    }
+    else if (options.skipAddressSubstitution) {
+        addressPrefix = '00';
+    }
+    if (newAddressPrefix &&
+        newAddressPrefix !== '' &&
+        !options.skipNewAddressSubstitution) {
+        const regex = new RegExp('TT', 'g');
+        compressedCallData = compressedCallData.replace(regex, newAddressPrefix);
+    }
+    else if (newAddressPrefix === '' &&
+        newAddresses.length &&
+        !options.skipNewAddressSubstitution) {
+        // If no unused byte for newAddressPrefix remove the logic for address
+        return compress({
+            initialCallData: initialCallData,
+            addresses,
+            options: {
+                skipNewAddressSubstitution: true,
+            },
+            network,
+        });
+    }
+    // INDEX OF METHOD SUBSTITUTION
+    compressedCallData = ffByte + trimHex(compressedCallData);
+    const newAddressesString = options.skipNewAddressSubstitution
+        ? '00'
+        : (0, intToByte_1.default)(newAddresses.length) +
+            (newAddresses.length > 0 ? newAddressPrefix : '') +
+            newAddresses.join('');
+    const prefixCallData = addressPrefix + newAddressesString;
+    // SUBSTITUTING FF
+    const firstBytes = compressedCallData.substring(0, 2);
+    const compressedFFSubstituted = (0, byteSubstitution_1.default)({
+        byte: ffByte,
+        callData: compressedCallData.substring(2),
+        compressedCallData: firstBytes,
+        addressPrefix: options.skipAddressSubstitution ? 'RR' : addressPrefix,
+        newAddressPrefix: options.skipNewAddressSubstitution
+            ? 'TT'
+            : newAddressPrefix,
+    });
+    compressedCallData = compressedFFSubstituted.compressedCallData;
+    // FINDING LONGEST RECURRENT STRINGS TO COMPRESS
+    let { newCompressedData, nbOfDuplicatedStrings } = (0, findLongestAndSubstitute_1.default)({
+        compressedCallData: compressedCallData.substring(2),
+        markers: duplicatedStringMarkers,
+    });
+    if (newCompressedData)
+        compressedCallData = firstBytes + newCompressedData;
+    if (!maxByteInZeroes)
+        maxByteInZeroes = '00';
+    compressedCallData =
+        '0x' + prefixCallData + maxByteInZeroes + compressedCallData + zeroByte;
+    // We append the markers at the end of the string to find them back in the contract
+    for (let i = 0; i < nbOfDuplicatedStrings; i++) {
+        compressedCallData += duplicatedStringMarkers[i];
+    }
+    // 0x + address prefix (1B) | nbOfNewAddresses (1B) | newAddressPrefix (0/1B) | newAddresses (n * 20B) |
+    //      maxByteInZeroes (1B) | FF | compressedData | 00 | duplicatedStringMarkers
+    const finalCost = (0, computeCostL2_1.default)(compressedCallData);
+    if (compressedCallData.length % 2 !== 0)
+        throw new Error('Data of odd length');
+    return { compressedData: compressedCallData, initialCost, finalCost };
+};
+exports.default = compress;
+//# sourceMappingURL=compress.js.map

package/build/executor/compressor/compress.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compress.js","sourceRoot":"","sources":["../../../src/executor/compressor/compress.ts"],"names":[],"mappings":";;;;;AAAA,0EAAgD;AAChD,kEAA0C;AAE1C,+FAAuE;AACvE,6FAAqE;AACrE,6GAAqF;AACrF,mGAA2E;AAC3E,uHAA+F;AAC/F,mCAAgC;AAEhC,MAAM,QAAQ,GAAG,IAAI,CAAC;AACtB,MAAM,MAAM,GAAG,IAAI,CAAC;AAoBpB,MAAM,OAAO,GAAG,CAAC,GAAW,EAAE,EAAE;IAC9B,OAAO,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;AACnD,CAAC,CAAC;AAEF,MAAM,QAAQ,GAAG,UAAU,EACzB,eAAe,EACf,SAAS,EACT,OAAO,EACP,OAAO,GACO;IACd,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC;QAClC,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;IAEhD,IAAI,CAAC,OAAO;QAAE,OAAO,GAAG,EAAE,CAAC;IAE3B,MAAM,WAAW,GAAG,IAAA,uBAAW,EAAC,eAAe,CAAC,CAAC;IACjD,eAAe,GAAG,OAAO,CAAC,eAAe,CAAC,CAAC;IAC3C,IAAI,QAAQ,GAAG,eAAe,CAAC;IAE/B,MAAM,cAAc,GAAG,IAAA,eAAM,EAAC,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAEvD,IAAI,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,IAAA,eAAM,EAAC,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAClE,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,iBAAiB,EAAE,CACpD,CAAC;IAEF,gCAAgC;IAChC,IAAI,CAAC,OAAO,CAAC,uBAAuB,EAAE;QACpC,QAAQ,GAAG,IAAA,uCAA6B,EAAC;YACvC,QAAQ;YACR,eAAe,EAAE,cAAc;SAChC,CAAC,CAAC;KACJ;IAED,IAAI,CAAC,OAAO,CAAC,0BAA0B,EAAE;QACvC,uDAAuD;QACvD,YAAY,GAAG,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;QAEpE,8BAA8B;QAC9B,QAAQ,GAAG,IAAA,6BAAmB,EAAC;YAC7B,QAAQ;YACR,SAAS,EAAE,YAAY;YACvB,gBAAgB,EAAE,KAAK;SACxB,CAAC,CAAC;KACJ;IAED,uBAAuB;IACvB,4HAA4H;IAC5H,oJAAoJ;IACpJ,IAAI,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,GAAG,IAAA,0BAAgB,EAAC;QAChE,IAAI,EAAE,QAAQ;QACd,QAAQ;QACR,aAAa,EAAE,IAAI;QACnB,gBAAgB,EAAE,IAAI;KACvB,CAAC,CAAC;IACH,IAAI,cAAc,GAAG,kBAAkB,CAAC;IACxC,gCAAgC;IAEhC,gDAAgD;IAChD,8CAA8C;IAC9C,IAAI,kBAAkB,GAA2B,EAAE,CAAC;IACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;QACjD,MAAM,IAAI,GAAG,cAAc,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAChD,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC;YAAE,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;;YACvD,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC;KACjC;IAED,qCAAqC;IACrC,IAAI,eAAe,GAAG,EAAE,CAAC;IACzB,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,KAAK,IAAI,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAE;QAChD,IAAI,kBAAkB,CAAC,IAAI,CAAC,GAAG,WAAW,EAAE;YAC1C,WAAW,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC;YACvC,eAAe,GAAG,IAAI,CAAC;SACxB;KACF;IAED,4DAA4D;IAC5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,kBAAkB,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;QACrD,MAAM,WAAW,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACvD,IAAI,WAAW,KAAK,QAAQ,EAAE;YAC5B,IAAI,CAAC,GAAG,kBAAkB,CAAC,MAAM,GAAG,CAAC,EAAE;gBACrC,MAAM,QAAQ,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBACxD,IAAI,QAAQ,KAAK,eAAe,EAAE;oBAChC,kBAAkB;wBAChB,kBAAkB,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;4BACtC,QAAQ;4BACR,kBAAkB,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACtC,CAAC,IAAI,CAAC,CAAC;iBACR;aACF;SACF;aAAM,IAAI,WAAW,KAAK,IAAI;YAAE,CAAC,IAAI,CAAC,CAAC;aACnC,IAAI,WAAW,KAAK,IAAI;YAAE,CAAC,IAAI,CAAC,CAAC;KACvC;IACD,kEAAkE;IAElE,qEAAqE;IACrE,IAAI,EAAE,aAAa,EAAE,gBAAgB,EAAE,uBAAuB,EAAE,GAC9D,IAAA,2BAAiB,EAAC;QAChB,YAAY;QACZ,kBAAkB;KACnB,CAAC,CAAC;IACL,0EAA0E;IAE1E,iCAAiC;IACjC,IACE,aAAa;QACb,aAAa,KAAK,EAAE;QACpB,CAAC,OAAO,CAAC,uBAAuB,EAChC;QACA,MAAM,KAAK,GAAG,IAAI,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACpC,kBAAkB,GAAG,kBAAkB,CAAC,OAAO,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;KACvE;SAAM,IAAI,aAAa,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,uBAAuB,EAAE;QACnE,mEAAmE;QACnE,OAAO,QAAQ,CAAC;YACd,eAAe,EAAE,eAAe;YAChC,SAAS;YACT,OAAO,EAAE;gBACP,uBAAuB,EAAE,IAAI;gBAC7B,0BAA0B,EAAE,IAAI;aACjC;YACD,OAAO;SACR,CAAC,CAAC;KACJ;SAAM,IAAI,OAAO,CAAC,uBAAuB,EAAE;QAC1C,aAAa,GAAG,IAAI,CAAC;KACtB;IAED,IACE,gBAAgB;QAChB,gBAAgB,KAAK,EAAE;QACvB,CAAC,OAAO,CAAC,0BAA0B,EACnC;QACA,MAAM,KAAK,GAAG,IAAI,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACpC,kBAAkB,GAAG,kBAAkB,CAAC,OAAO,CAAC,KAAK,EAAE,gBAAgB,CAAC,CAAC;KAC1E;SAAM,IACL,gBAAgB,KAAK,EAAE;QACvB,YAAY,CAAC,MAAM;QACnB,CAAC,OAAO,CAAC,0BAA0B,EACnC;QACA,sEAAsE;QACtE,OAAO,QAAQ,CAAC;YACd,eAAe,EAAE,eAAe;YAChC,SAAS;YACT,OAAO,EAAE;gBACP,0BAA0B,EAAE,IAAI;aACjC;YACD,OAAO;SACR,CAAC,CAAC;KACJ;IAED,+BAA+B;IAC/B,kBAAkB,GAAG,MAAM,GAAG,OAAO,CAAC,kBAAkB,CAAC,CAAC;IAE1D,MAAM,kBAAkB,GAAG,OAAO,CAAC,0BAA0B;QAC3D,CAAC,CAAC,IAAI;QACN,CAAC,CAAC,IAAA,mBAAS,EAAC,YAAY,CAAC,MAAM,CAAC;YAC9B,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC;YACjD,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC1B,MAAM,cAAc,GAAG,aAAa,GAAG,kBAAkB,CAAC;IAE1D,kBAAkB;IAClB,MAAM,UAAU,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtD,MAAM,uBAAuB,GAAG,IAAA,0BAAgB,EAAC;QAC/C,IAAI,EAAE,MAAM;QACZ,QAAQ,EAAE,kBAAkB,CAAC,SAAS,CAAC,CAAC,CAAC;QACzC,kBAAkB,EAAE,UAAU;QAC9B,aAAa,EAAE,OAAO,CAAC,uBAAuB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,aAAa;QACrE,gBAAgB,EAAE,OAAO,CAAC,0BAA0B;YAClD,CAAC,CAAC,IAAI;YACN,CAAC,CAAC,gBAAgB;KACrB,CAAC,CAAC;IACH,kBAAkB,GAAG,uBAAuB,CAAC,kBAAkB,CAAC;IAEhE,gDAAgD;IAChD,IAAI,EAAE,iBAAiB,EAAE,qBAAqB,EAAE,GAAG,IAAA,kCAAwB,EAAC;QAC1E,kBAAkB,EAAE,kBAAkB,CAAC,SAAS,CAAC,CAAC,CAAC;QACnD,OAAO,EAAE,uBAAuB;KACjC,CAAC,CAAC;IACH,IAAI,iBAAiB;QAAE,kBAAkB,GAAG,UAAU,GAAG,iBAAiB,CAAC;IAE3E,IAAI,CAAC,eAAe;QAAE,eAAe,GAAG,IAAI,CAAC;IAC7C,kBAAkB;QAChB,IAAI,GAAG,cAAc,GAAG,eAAe,GAAG,kBAAkB,GAAG,QAAQ,CAAC;IAE1E,mFAAmF;IACnF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,qBAAqB,EAAE,CAAC,EAAE,EAAE;QAC9C,kBAAkB,IAAI,uBAAuB,CAAC,CAAC,CAAC,CAAC;KAClD;IACD,wGAAwG;IACxG,iFAAiF;IAEjF,MAAM,SAAS,GAAG,IAAA,uBAAW,EAAC,kBAAkB,CAAC,CAAC;IAClD,IAAI,kBAAkB,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC;QACrC,MAAM,IAAI,KAAK,CAAC,oBAAoB,CAAC,CAAC;IACxC,OAAO,EAAE,cAAc,EAAE,kBAAkB,EAAE,WAAW,EAAE,SAAS,EAAE,CAAC;AACxE,CAAC,CAAC;AAEF,kBAAe,QAAQ,CAAC"}

package/build/executor/compressor/compress_functions/addressSubstitution.d.ts

@@ -0,0 +1,6 @@
+declare const addressSubstitution: ({ callData, addresses, isSavedAddresses, }: {
+    callData: string;
+    addresses: string[];
+    isSavedAddresses: boolean;
+}) => string;
+export default addressSubstitution;

package/build/executor/compressor/compress_functions/addressSubstitution.js

@@ -0,0 +1,29 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+const intToByte_1 = __importDefault(require("./../utils/intToByte"));
+const intTo3Bytes_1 = __importDefault(require("../utils/intTo3Bytes"));
+const addressSubstitution = ({ callData, addresses, isSavedAddresses, }) => {
+    for (let i = 0; i < addresses.length; i++) {
+        if (addresses[i] === '0000000000000000000000000000000000000000')
+            continue;
+        let index = callData.indexOf(addresses[i]);
+        if (index === -1)
+            continue;
+        while (index !== -1) {
+            if (index % 2 === 0) {
+                callData =
+                    callData.substring(0, index) +
+                        (isSavedAddresses ? 'RR' : 'TT') +
+                        (!isSavedAddresses ? (0, intToByte_1.default)(i) : (0, intTo3Bytes_1.default)(i)) +
+                        callData.substring(index + addresses[i].length);
+            }
+            index = callData.indexOf(addresses[i], index + 1);
+        }
+    }
+    return callData;
+};
+exports.default = addressSubstitution;
+//# sourceMappingURL=addressSubstitution.js.map

package/build/executor/compressor/compress_functions/addressSubstitution.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"addressSubstitution.js","sourceRoot":"","sources":["../../../../src/executor/compressor/compress_functions/addressSubstitution.ts"],"names":[],"mappings":";;;;;AAAA,qEAA6C;AAC7C,uEAA+C;AAE/C,MAAM,mBAAmB,GAAG,CAAC,EAC3B,QAAQ,EACR,SAAS,EACT,gBAAgB,GAKjB,EAAU,EAAE;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACzC,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,0CAA0C;YAAE,SAAS;QAC1E,IAAI,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,IAAI,KAAK,KAAK,CAAC,CAAC;YAAE,SAAS;QAC3B,OAAO,KAAK,KAAK,CAAC,CAAC,EAAE;YACnB,IAAI,KAAK,GAAG,CAAC,KAAK,CAAC,EAAE;gBACnB,QAAQ;oBACN,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC;wBAC5B,CAAC,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;wBAChC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,IAAA,mBAAS,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAA,qBAAW,EAAC,CAAC,CAAC,CAAC;wBACnD,QAAQ,CAAC,SAAS,CAAC,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;aACnD;YACD,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;SACnD;KACF;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC,CAAC;AAEF,kBAAe,mBAAmB,CAAC"}

package/build/executor/compressor/compress_functions/addressSubstitutionFromObject.d.ts

@@ -0,0 +1,10 @@
+declare const addressSubstitutionFromObject: ({ callData, addressesObject, }: {
+    callData: string;
+    addressesObject: {
+        [key: string]: {
+            saved: boolean;
+            index: number;
+        };
+    };
+}) => string;
+export default addressSubstitutionFromObject;

package/build/executor/compressor/compress_functions/addressSubstitutionFromObject.js

@@ -0,0 +1,40 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+const intTo3Bytes_1 = __importDefault(require("../utils/intTo3Bytes"));
+const ZERO_ADDRESS = '0000000000000000000000000000000000000000';
+const addressSubstitutionFromObject = ({ callData, addressesObject, }) => {
+    const addresses = [];
+    for (let i = 0; i < callData.length; i += 2) {
+        const callDataPart = callData.slice(i, i + 40);
+        const addressObj = addressesObject[`0x${callDataPart}`];
+        if (addressObj?.saved)
+            addresses.push(callDataPart);
+    }
+    addresses
+        .filter(address => {
+        const notZero = address !== ZERO_ADDRESS;
+        const inCalldata = callData.indexOf(address) !== -1;
+        const isSaved = addressesObject[`0x${address}`].saved;
+        return notZero && inCalldata && isSaved;
+    })
+        .forEach(address => {
+        let index = callData.indexOf(address);
+        const bytes3 = (0, intTo3Bytes_1.default)(addressesObject[`0x${address}`].index);
+        while (index !== -1) {
+            if (index % 2 === 0) {
+                callData =
+                    callData.substring(0, index) +
+                        'RR' +
+                        bytes3 +
+                        callData.substring(index + address.length);
+            }
+            index = callData.indexOf(address, index + 1);
+        }
+    });
+    return callData;
+};
+exports.default = addressSubstitutionFromObject;
+//# sourceMappingURL=addressSubstitutionFromObject.js.map

package/build/executor/compressor/compress_functions/addressSubstitutionFromObject.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"addressSubstitutionFromObject.js","sourceRoot":"","sources":["../../../../src/executor/compressor/compress_functions/addressSubstitutionFromObject.ts"],"names":[],"mappings":";;;;;AAAA,uEAA+C;AAE/C,MAAM,YAAY,GAAG,0CAA0C,CAAC;AAEhE,MAAM,6BAA6B,GAAG,CAAC,EACrC,QAAQ,EACR,eAAe,GAIhB,EAAU,EAAE;IACX,MAAM,SAAS,GAAa,EAAE,CAAC;IAE/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;QAC3C,MAAM,YAAY,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;QAC/C,MAAM,UAAU,GAAG,eAAe,CAAC,KAAK,YAAY,EAAE,CAAC,CAAC;QAExD,IAAI,UAAU,EAAE,KAAK;YAAE,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;KACrD;IAED,SAAS;SACN,MAAM,CAAC,OAAO,CAAC,EAAE;QAChB,MAAM,OAAO,GAAG,OAAO,KAAK,YAAY,CAAC;QACzC,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;QACpD,MAAM,OAAO,GAAG,eAAe,CAAC,KAAK,OAAO,EAAE,CAAC,CAAC,KAAK,CAAC;QACtD,OAAO,OAAO,IAAI,UAAU,IAAI,OAAO,CAAC;IAC1C,CAAC,CAAC;SACD,OAAO,CAAC,OAAO,CAAC,EAAE;QACjB,IAAI,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACtC,MAAM,MAAM,GAAG,IAAA,qBAAW,EAAC,eAAe,CAAC,KAAK,OAAO,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QAElE,OAAO,KAAK,KAAK,CAAC,CAAC,EAAE;YACnB,IAAI,KAAK,GAAG,CAAC,KAAK,CAAC,EAAE;gBACnB,QAAQ;oBACN,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC;wBAC5B,IAAI;wBACJ,MAAM;wBACN,QAAQ,CAAC,SAAS,CAAC,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;aAC9C;YACD,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;SAC9C;IACH,CAAC,CAAC,CAAC;IAEL,OAAO,QAAQ,CAAC;AAClB,CAAC,CAAC;AAEF,kBAAe,6BAA6B,CAAC"}

package/build/executor/compressor/compress_functions/byteSubstitution.d.ts

@@ -0,0 +1,11 @@
+declare const byteSubstitution: ({ byte, callData, compressedCallData, addressPrefix, newAddressPrefix, }: {
+    byte: string;
+    callData: string;
+    compressedCallData?: string | undefined;
+    addressPrefix: string;
+    newAddressPrefix: string;
+}) => {
+    bufferOfOccurences: string;
+    compressedCallData: string;
+};
+export default byteSubstitution;

package/build/executor/compressor/compress_functions/byteSubstitution.js

@@ -0,0 +1,64 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+const intToByte_1 = __importDefault(require("../utils/intToByte"));
+const byteSubstitution = ({ byte, callData, compressedCallData, addressPrefix, newAddressPrefix, }) => {
+    let countNoByte = 0; // Count of non-target bytes
+    let countByte = 0; // Count of target bytes
+    let bufferOfOccurences = ''; // Stores occurrences of target bytes
+    if (!compressedCallData)
+        compressedCallData = '';
+    // Looping through call data byte by byte
+    for (let i = 0; i < callData.length; i += 2) {
+        let amountToIncreaseI = 0;
+        const currentByte = callData.slice(i, i + 2);
+        // Handling target byte substitution
+        if (currentByte === byte) {
+            if (countNoByte > 0 || i == 0) {
+                compressedCallData += byte;
+                countNoByte = 0;
+            }
+            // Handle byte count exceeding limit
+            if (++countByte > 254) {
+                let hexValue = (0, intToByte_1.default)(countByte);
+                bufferOfOccurences += hexValue;
+                compressedCallData += byte + hexValue;
+                countByte = 0;
+            }
+            continue;
+        }
+        else {
+            // Handle other bytes and address prefixes
+            if (countByte > 0) {
+                let hexValue = (0, intToByte_1.default)(countByte);
+                if (byte === 'ff' && countByte === 1)
+                    hexValue = '00';
+                bufferOfOccurences += hexValue;
+                compressedCallData += hexValue;
+                countByte = 0;
+            }
+            // Check for address and new address prefixes
+            if (currentByte === addressPrefix || currentByte === newAddressPrefix) {
+                let sliceLength = currentByte === addressPrefix ? 8 : 4;
+                compressedCallData += callData.slice(i, i + sliceLength);
+                amountToIncreaseI = sliceLength - 2;
+                countNoByte = 0;
+            }
+            countNoByte++;
+        }
+        if (!amountToIncreaseI)
+            compressedCallData += callData.slice(i, i + 2);
+        i += amountToIncreaseI;
+    }
+    // Append remaining byte counts after loop
+    if (countByte > 0) {
+        let hexValue = (0, intToByte_1.default)(countByte);
+        bufferOfOccurences += hexValue;
+        compressedCallData += hexValue;
+    }
+    return { bufferOfOccurences, compressedCallData };
+};
+exports.default = byteSubstitution;
+//# sourceMappingURL=byteSubstitution.js.map

package/build/executor/compressor/compress_functions/byteSubstitution.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"byteSubstitution.js","sourceRoot":"","sources":["../../../../src/executor/compressor/compress_functions/byteSubstitution.ts"],"names":[],"mappings":";;;;;AAAA,mEAA2C;AAE3C,MAAM,gBAAgB,GAAG,CAAC,EACxB,IAAI,EACJ,QAAQ,EACR,kBAAkB,EAClB,aAAa,EACb,gBAAgB,GAOjB,EAA8D,EAAE;IAC/D,IAAI,WAAW,GAAG,CAAC,CAAC,CAAC,4BAA4B;IACjD,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC,wBAAwB;IAC3C,IAAI,kBAAkB,GAAG,EAAE,CAAC,CAAC,qCAAqC;IAElE,IAAI,CAAC,kBAAkB;QAAE,kBAAkB,GAAG,EAAE,CAAC;IAEjD,yCAAyC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;QAC3C,IAAI,iBAAiB,GAAG,CAAC,CAAC;QAC1B,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAE7C,oCAAoC;QACpC,IAAI,WAAW,KAAK,IAAI,EAAE;YACxB,IAAI,WAAW,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;gBAC7B,kBAAkB,IAAI,IAAI,CAAC;gBAC3B,WAAW,GAAG,CAAC,CAAC;aACjB;YACD,oCAAoC;YACpC,IAAI,EAAE,SAAS,GAAG,GAAG,EAAE;gBACrB,IAAI,QAAQ,GAAG,IAAA,mBAAS,EAAC,SAAS,CAAC,CAAC;gBACpC,kBAAkB,IAAI,QAAQ,CAAC;gBAC/B,kBAAkB,IAAI,IAAI,GAAG,QAAQ,CAAC;gBACtC,SAAS,GAAG,CAAC,CAAC;aACf;YACD,SAAS;SACV;aAAM;YACL,0CAA0C;YAC1C,IAAI,SAAS,GAAG,CAAC,EAAE;gBACjB,IAAI,QAAQ,GAAG,IAAA,mBAAS,EAAC,SAAS,CAAC,CAAC;gBACpC,IAAI,IAAI,KAAK,IAAI,IAAI,SAAS,KAAK,CAAC;oBAAE,QAAQ,GAAG,IAAI,CAAC;gBACtD,kBAAkB,IAAI,QAAQ,CAAC;gBAC/B,kBAAkB,IAAI,QAAQ,CAAC;gBAC/B,SAAS,GAAG,CAAC,CAAC;aACf;YACD,6CAA6C;YAC7C,IAAI,WAAW,KAAK,aAAa,IAAI,WAAW,KAAK,gBAAgB,EAAE;gBACrE,IAAI,WAAW,GAAG,WAAW,KAAK,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxD,kBAAkB,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC;gBACzD,iBAAiB,GAAG,WAAW,GAAG,CAAC,CAAC;gBACpC,WAAW,GAAG,CAAC,CAAC;aACjB;YACD,WAAW,EAAE,CAAC;SACf;QACD,IAAI,CAAC,iBAAiB;YAAE,kBAAkB,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACvE,CAAC,IAAI,iBAAiB,CAAC;KACxB;IAED,0CAA0C;IAC1C,IAAI,SAAS,GAAG,CAAC,EAAE;QACjB,IAAI,QAAQ,GAAG,IAAA,mBAAS,EAAC,SAAS,CAAC,CAAC;QACpC,kBAAkB,IAAI,QAAQ,CAAC;QAC/B,kBAAkB,IAAI,QAAQ,CAAC;KAChC;IAED,OAAO,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,CAAC;AACpD,CAAC,CAAC;AAEF,kBAAe,gBAAgB,CAAC"}

package/build/executor/compressor/compress_functions/ffSubstitution.d.ts

@@ -0,0 +1,7 @@
+declare const ffSubstitution: ({ compressedCallData, indexOfMethods, addressPrefix, newAddressPrefix, }: {
+    compressedCallData: string;
+    indexOfMethods: number;
+    addressPrefix: string;
+    newAddressPrefix: string;
+}) => string;
+export default ffSubstitution;

package/build/executor/compressor/compress_functions/ffSubstitution.js

@@ -0,0 +1,54 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+const intToByte_1 = __importDefault(require("../utils/intToByte"));
+const ffByte = 'ff';
+const zeroByte = '00';
+const ffSubstitution = ({ compressedCallData, indexOfMethods, addressPrefix, newAddressPrefix, }) => {
+    let ffCount = 0;
+    let maxI;
+    const startFFSearch = indexOfMethods > -1 ? 2 : 10;
+    for (let i = startFFSearch; i < compressedCallData.length; i += 2) {
+        const byte = compressedCallData.substring(i, i + 2);
+        maxI = i;
+        if (byte === ffByte) {
+            if (++ffCount > 254) {
+                // in case more than 255 bytes of ff
+                compressedCallData =
+                    compressedCallData.substring(0, i + (1 - ffCount) * 2) +
+                        (0, intToByte_1.default)(ffCount) +
+                        compressedCallData.substring(i);
+                i -= ffCount * 2;
+                i += 2;
+                ffCount = 0;
+            }
+            continue;
+        }
+        if (ffCount > 0) {
+            if (ffCount === 1)
+                compressedCallData =
+                    compressedCallData.substring(0, i) +
+                        zeroByte +
+                        compressedCallData.substring(i);
+            else {
+                compressedCallData =
+                    compressedCallData.substring(0, i + (1 - ffCount) * 2) +
+                        (0, intToByte_1.default)(ffCount) +
+                        compressedCallData.substring(i);
+                i -= ffCount * 2;
+            }
+            i += 2;
+            ffCount = 0;
+        }
+        if (byte === addressPrefix)
+            i += 6;
+        if (byte === newAddressPrefix)
+            i += 2;
+    }
+    // console.log({ maxI: max, length: compressedCallData.length, compressedCallData });
+    return compressedCallData;
+};
+exports.default = ffSubstitution;
+//# sourceMappingURL=ffSubstitution.js.map

package/build/executor/compressor/compress_functions/ffSubstitution.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ffSubstitution.js","sourceRoot":"","sources":["../../../../src/executor/compressor/compress_functions/ffSubstitution.ts"],"names":[],"mappings":";;;;;AAAA,mEAA2C;AAE3C,MAAM,MAAM,GAAG,IAAI,CAAC;AACpB,MAAM,QAAQ,GAAG,IAAI,CAAC;AAEtB,MAAM,cAAc,GAAG,CAAC,EACtB,kBAAkB,EAClB,cAAc,EACd,aAAa,EACb,gBAAgB,GAMjB,EAAU,EAAE;IACX,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,IAAY,CAAC;IACjB,MAAM,aAAa,GAAG,cAAc,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACnD,KAAK,IAAI,CAAC,GAAG,aAAa,EAAE,CAAC,GAAG,kBAAkB,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;QACjE,MAAM,IAAI,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACpD,IAAI,GAAG,CAAC,CAAC;QACT,IAAI,IAAI,KAAK,MAAM,EAAE;YACnB,IAAI,EAAE,OAAO,GAAG,GAAG,EAAE;gBACnB,oCAAoC;gBACpC,kBAAkB;oBAChB,kBAAkB,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;wBACtD,IAAA,mBAAS,EAAC,OAAO,CAAC;wBAClB,kBAAkB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBAClC,CAAC,IAAI,OAAO,GAAG,CAAC,CAAC;gBACjB,CAAC,IAAI,CAAC,CAAC;gBACP,OAAO,GAAG,CAAC,CAAC;aACb;YACD,SAAS;SACV;QACD,IAAI,OAAO,GAAG,CAAC,EAAE;YACf,IAAI,OAAO,KAAK,CAAC;gBACf,kBAAkB;oBAChB,kBAAkB,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC;wBAClC,QAAQ;wBACR,kBAAkB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;iBAC/B;gBACH,kBAAkB;oBAChB,kBAAkB,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;wBACtD,IAAA,mBAAS,EAAC,OAAO,CAAC;wBAClB,kBAAkB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBAClC,CAAC,IAAI,OAAO,GAAG,CAAC,CAAC;aAClB;YACD,CAAC,IAAI,CAAC,CAAC;YACP,OAAO,GAAG,CAAC,CAAC;SACb;QACD,IAAI,IAAI,KAAK,aAAa;YAAE,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,IAAI,KAAK,gBAAgB;YAAE,CAAC,IAAI,CAAC,CAAC;KACvC;IACD,qFAAqF;IACrF,OAAO,kBAAkB,CAAC;AAC5B,CAAC,CAAC;AAEF,kBAAe,cAAc,CAAC"}

package/build/executor/compressor/compress_functions/findLongestAndSubstitute.d.ts

@@ -0,0 +1,8 @@
+declare const findLongestAndSubstitute: ({ compressedCallData, markers, }: {
+    compressedCallData: string;
+    markers?: string[] | undefined;
+}) => {
+    newCompressedData: string;
+    nbOfDuplicatedStrings: number;
+};
+export default findLongestAndSubstitute;

package/build/executor/compressor/compress_functions/findLongestAndSubstitute.js

@@ -0,0 +1,67 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+const findLongestDuplicatedString_1 = __importDefault(require("../utils/findLongestDuplicatedString"));
+const findLongestAndSubstitute = ({ compressedCallData, markers, }) => {
+    if (!markers)
+        markers = [];
+    for (let i = 0; i < markers.length; i++) {
+        if (!markers[i] || markers[i] === '')
+            return {
+                newCompressedData: compressedCallData,
+                nbOfDuplicatedStrings: i,
+            };
+        const marker = markers[i];
+        let longestDuplicatedStringInCompressedData = (0, findLongestDuplicatedString_1.default)(compressedCallData);
+        // Checking if the length of the longest duplicated string is significant
+        // TODO: better check conditions to enter this (nb of occurences as well as length)
+        if (longestDuplicatedStringInCompressedData.length >= 8) {
+            // Creating regular expressions to find the longest duplicated string
+            const index = compressedCallData.indexOf(longestDuplicatedStringInCompressedData);
+            // If a match is found, surrounder the longest duplicated string with the marker in the compressed data
+            // and substitute the other occurences
+            if (index > -1) {
+                compressedCallData =
+                    compressedCallData.substring(0, index) +
+                        marker +
+                        compressedCallData.substring(index, index + longestDuplicatedStringInCompressedData.length) +
+                        marker +
+                        compressedCallData.substring(index + longestDuplicatedStringInCompressedData.length);
+                let otherIndex = compressedCallData.indexOf(longestDuplicatedStringInCompressedData, index + 4 + longestDuplicatedStringInCompressedData.length);
+                while (otherIndex !== -1) {
+                    if (otherIndex % 2 === 0) {
+                        compressedCallData =
+                            compressedCallData.substring(0, otherIndex) +
+                                marker +
+                                compressedCallData.substring(otherIndex + longestDuplicatedStringInCompressedData.length);
+                        otherIndex = compressedCallData.indexOf(longestDuplicatedStringInCompressedData, otherIndex + 2);
+                    }
+                    else {
+                        otherIndex = compressedCallData.indexOf(longestDuplicatedStringInCompressedData, otherIndex + 1);
+                    }
+                }
+            }
+            else
+                return {
+                    newCompressedData: compressedCallData,
+                    nbOfDuplicatedStrings: i,
+                };
+        }
+        else {
+            // If the longest duplicated string is not significant, return the current state of compressed data and count of duplicated strings
+            return {
+                newCompressedData: compressedCallData,
+                nbOfDuplicatedStrings: i,
+            };
+        }
+    }
+    // After processing for all markers, return the final compressed data and the total number of duplicated strings found
+    return {
+        newCompressedData: compressedCallData,
+        nbOfDuplicatedStrings: markers.length,
+    };
+};
+exports.default = findLongestAndSubstitute;
+//# sourceMappingURL=findLongestAndSubstitute.js.map

package/build/executor/compressor/compress_functions/findLongestAndSubstitute.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"findLongestAndSubstitute.js","sourceRoot":"","sources":["../../../../src/executor/compressor/compress_functions/findLongestAndSubstitute.ts"],"names":[],"mappings":";;;;;AAAA,uGAA+E;AAE/E,MAAM,wBAAwB,GAAG,CAAC,EAChC,kBAAkB,EAClB,OAAO,GAIR,EAAgE,EAAE;IACjE,IAAI,CAAC,OAAO;QAAE,OAAO,GAAG,EAAE,CAAC;IAE3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACvC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE;YAClC,OAAO;gBACL,iBAAiB,EAAE,kBAAkB;gBACrC,qBAAqB,EAAE,CAAC;aACzB,CAAC;QAEJ,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QAE1B,IAAI,uCAAuC,GACzC,IAAA,qCAA2B,EAAC,kBAAkB,CAAC,CAAC;QAElD,yEAAyE;QACzE,mFAAmF;QACnF,IAAI,uCAAuC,CAAC,MAAM,IAAI,CAAC,EAAE;YACvD,qEAAqE;YACrE,MAAM,KAAK,GAAG,kBAAkB,CAAC,OAAO,CACtC,uCAAuC,CACxC,CAAC;YAEF,uGAAuG;YACvG,sCAAsC;YACtC,IAAI,KAAK,GAAG,CAAC,CAAC,EAAE;gBACd,kBAAkB;oBAChB,kBAAkB,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC;wBACtC,MAAM;wBACN,kBAAkB,CAAC,SAAS,CAC1B,KAAK,EACL,KAAK,GAAG,uCAAuC,CAAC,MAAM,CACvD;wBACD,MAAM;wBACN,kBAAkB,CAAC,SAAS,CAC1B,KAAK,GAAG,uCAAuC,CAAC,MAAM,CACvD,CAAC;gBAEJ,IAAI,UAAU,GAAG,kBAAkB,CAAC,OAAO,CACzC,uCAAuC,EACvC,KAAK,GAAG,CAAC,GAAG,uCAAuC,CAAC,MAAM,CAC3D,CAAC;gBACF,OAAO,UAAU,KAAK,CAAC,CAAC,EAAE;oBACxB,IAAI,UAAU,GAAG,CAAC,KAAK,CAAC,EAAE;wBACxB,kBAAkB;4BAChB,kBAAkB,CAAC,SAAS,CAAC,CAAC,EAAE,UAAU,CAAC;gCAC3C,MAAM;gCACN,kBAAkB,CAAC,SAAS,CAC1B,UAAU,GAAG,uCAAuC,CAAC,MAAM,CAC5D,CAAC;wBACJ,UAAU,GAAG,kBAAkB,CAAC,OAAO,CACrC,uCAAuC,EACvC,UAAU,GAAG,CAAC,CACf,CAAC;qBACH;yBAAM;wBACL,UAAU,GAAG,kBAAkB,CAAC,OAAO,CACrC,uCAAuC,EACvC,UAAU,GAAG,CAAC,CACf,CAAC;qBACH;iBACF;aACF;;gBACC,OAAO;oBACL,iBAAiB,EAAE,kBAAkB;oBACrC,qBAAqB,EAAE,CAAC;iBACzB,CAAC;SACL;aAAM;YACL,mIAAmI;YACnI,OAAO;gBACL,iBAAiB,EAAE,kBAAkB;gBACrC,qBAAqB,EAAE,CAAC;aACzB,CAAC;SACH;KACF;IAED,sHAAsH;IACtH,OAAO;QACL,iBAAiB,EAAE,kBAAkB;QACrC,qBAAqB,EAAE,OAAO,CAAC,MAAM;KACtC,CAAC;AACJ,CAAC,CAAC;AAEF,kBAAe,wBAAwB,CAAC"}

package/build/executor/compressor/compress_functions/findLongestAndSubstitute_old.d.ts

@@ -0,0 +1,8 @@
+declare const findLongestAndSubstitute: ({ compressedCallData, markers, }: {
+    compressedCallData: string;
+    markers?: string[] | undefined;
+}) => {
+    newCompressedData: string;
+    nbOfDuplicatedStrings: number;
+};
+export default findLongestAndSubstitute;

package/build/executor/compressor/compress_functions/findLongestAndSubstitute_old.js

@@ -0,0 +1,61 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+const findLongestDuplicatedString_1 = __importDefault(require("../utils/findLongestDuplicatedString"));
+const findLongestAndSubstitute = ({ compressedCallData, markers, }) => {
+    if (!markers)
+        markers = [];
+    for (let i = 0; i < markers.length; i++) {
+        if (!markers[i] || markers[i] === '')
+            return {
+                newCompressedData: compressedCallData,
+                nbOfDuplicatedStrings: i,
+            };
+        const marker = markers[i];
+        let longestDuplicatedStringInCompressedData = (0, findLongestDuplicatedString_1.default)(compressedCallData);
+        // Checking if the length of the longest duplicated string is significant
+        // TODO: better check conditions to enter this (nb of occurences as well as length)
+        if (longestDuplicatedStringInCompressedData.length >= 8) {
+            // Creating regular expressions to find the longest duplicated string
+            const regexLongest = new RegExp('((^[a-zA-Z0-9]{2})*)' + longestDuplicatedStringInCompressedData);
+            const match = regexLongest.exec(compressedCallData);
+            // If a match is found, surrounder the longest duplicated string with the marker in the compressed data
+            // and substitute the other occurences
+            if (match) {
+                const indexOfLongest = match.index + match[1].length;
+                const regexLongestGlobal = new RegExp('((^[a-zA-Z0-9]{2})*)' + longestDuplicatedStringInCompressedData, 'g');
+                compressedCallData =
+                    compressedCallData.substring(0, indexOfLongest) +
+                        marker +
+                        compressedCallData.substring(indexOfLongest, indexOfLongest + longestDuplicatedStringInCompressedData.length) +
+                        marker +
+                        compressedCallData
+                            .substring(indexOfLongest + longestDuplicatedStringInCompressedData.length)
+                            .replace(regexLongestGlobal, function (m, p1) {
+                            return p1 + marker;
+                        });
+            }
+            else
+                return {
+                    newCompressedData: compressedCallData,
+                    nbOfDuplicatedStrings: i,
+                };
+        }
+        else {
+            // If the longest duplicated string is not significant, return the current state of compressed data and count of duplicated strings
+            return {
+                newCompressedData: compressedCallData,
+                nbOfDuplicatedStrings: i,
+            };
+        }
+    }
+    // After processing for all markers, return the final compressed data and the total number of duplicated strings found
+    return {
+        newCompressedData: compressedCallData,
+        nbOfDuplicatedStrings: markers.length,
+    };
+};
+exports.default = findLongestAndSubstitute;
+//# sourceMappingURL=findLongestAndSubstitute_old.js.map

package/build/executor/compressor/compress_functions/findLongestAndSubstitute_old.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"findLongestAndSubstitute_old.js","sourceRoot":"","sources":["../../../../src/executor/compressor/compress_functions/findLongestAndSubstitute_old.ts"],"names":[],"mappings":";;;;;AAAA,uGAA+E;AAE/E,MAAM,wBAAwB,GAAG,CAAC,EAChC,kBAAkB,EAClB,OAAO,GAIR,EAAgE,EAAE;IACjE,IAAI,CAAC,OAAO;QAAE,OAAO,GAAG,EAAE,CAAC;IAE3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACvC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE;YAClC,OAAO;gBACL,iBAAiB,EAAE,kBAAkB;gBACrC,qBAAqB,EAAE,CAAC;aACzB,CAAC;QAEJ,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QAE1B,IAAI,uCAAuC,GACzC,IAAA,qCAA2B,EAAC,kBAAkB,CAAC,CAAC;QAElD,yEAAyE;QACzE,mFAAmF;QACnF,IAAI,uCAAuC,CAAC,MAAM,IAAI,CAAC,EAAE;YACvD,qEAAqE;YACrE,MAAM,YAAY,GAAG,IAAI,MAAM,CAC7B,sBAAsB,GAAG,uCAAuC,CACjE,CAAC;YACF,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;YAEpD,uGAAuG;YACvG,sCAAsC;YACtC,IAAI,KAAK,EAAE;gBACT,MAAM,cAAc,GAAG,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;gBACrD,MAAM,kBAAkB,GAAG,IAAI,MAAM,CACnC,sBAAsB,GAAG,uCAAuC,EAChE,GAAG,CACJ,CAAC;gBACF,kBAAkB;oBAChB,kBAAkB,CAAC,SAAS,CAAC,CAAC,EAAE,cAAc,CAAC;wBAC/C,MAAM;wBACN,kBAAkB,CAAC,SAAS,CAC1B,cAAc,EACd,cAAc,GAAG,uCAAuC,CAAC,MAAM,CAChE;wBACD,MAAM;wBACN,kBAAkB;6BACf,SAAS,CACR,cAAc,GAAG,uCAAuC,CAAC,MAAM,CAChE;6BACA,OAAO,CAAC,kBAAkB,EAAE,UAAU,CAAC,EAAE,EAAE;4BAC1C,OAAO,EAAE,GAAG,MAAM,CAAC;wBACrB,CAAC,CAAC,CAAC;aACR;;gBACC,OAAO;oBACL,iBAAiB,EAAE,kBAAkB;oBACrC,qBAAqB,EAAE,CAAC;iBACzB,CAAC;SACL;aAAM;YACL,mIAAmI;YACnI,OAAO;gBACL,iBAAiB,EAAE,kBAAkB;gBACrC,qBAAqB,EAAE,CAAC;aACzB,CAAC;SACH;KACF;IAED,sHAAsH;IACtH,OAAO;QACL,iBAAiB,EAAE,kBAAkB;QACrC,qBAAqB,EAAE,OAAO,CAAC,MAAM;KACtC,CAAC;AACJ,CAAC,CAAC;AAEF,kBAAe,wBAAwB,CAAC"}

package/build/executor/compressor/compress_functions/reverseAddressSubstitution.d.ts

@@ -0,0 +1,6 @@
+declare const reverseAddressSubstitution: ({ callData, addresses, isSavedAddresses, }: {
+    callData: string;
+    addresses: string[];
+    isSavedAddresses: boolean;
+}) => string;
+export default reverseAddressSubstitution;