import chai from 'chai';
import { solidity } from 'ethereum-waffle';
import { ethers } from 'hardhat';
import { BigNumber as BN, Contract } from 'ethers';
import { calcRoot } from '@fuel-ts/merklesum';
import checkVerify from './test_helpers/sumMerkleTree';
import hash from './utils/cryptography';

chai.use(solidity);
const { expect } = chai;

describe('sum Merkle tree', async () => {
	let mstlib: Contract;
	let msto: Contract;

	before(async () => {
		const merkleSumFactory = await ethers.getContractFactory('MerkleSumTree');
		mstlib = await merkleSumFactory.deploy();
		await mstlib.deployed();
	});

	beforeEach(async () => {
		const merkleSumTreeFactory = await ethers.getContractFactory('MockMerkleSumTree', {
			libraries: { MerkleSumTree: mstlib.address },
		});
		msto = await merkleSumTreeFactory.deploy();
		await msto.deployed();
	});

	it('Compute root', async () => {
		const data = [];
		const values = [];
		const valuesBN = [];
		const size = 100;
		for (let i = 0; i < size; i += 1) {
			data.push(hash('0xabde'));
			values.push(BN.from(1).toHexString());
			valuesBN.push(BN.from(1));
		}
		await msto.computeRoot(data, values);
		const res = calcRoot(valuesBN, data);

		// Compare results
		expect(res.sum).to.be.equal(100); // True answer
		expect(await msto.root()).to.be.equal(res.hash);
		expect(await msto.rootSum()).to.be.equal(res.sum);
	});

	it('Verifications', async () => {
		const testCases = [
			{ numLeaves: 100, proveLeaf: 100 },
			{ numLeaves: 100, proveLeaf: 99 },
			{ numLeaves: 99, proveLeaf: 42 },
			{ numLeaves: 1, proveLeaf: 1 },
		];

		for (let i = 0; i < testCases.length; i += 1) {
			// Expect success
			expect(
				await checkVerify(
					msto,
					testCases[i].numLeaves,
					testCases[i].proveLeaf,
					false,
					false
				)
			).to.equal(true);

			// Tamper with data
			expect(
				await checkVerify(msto, testCases[i].numLeaves, testCases[i].proveLeaf, false, true)
			).to.equal(false);

			// Tamper with sums
			expect(
				await checkVerify(msto, testCases[i].numLeaves, testCases[i].proveLeaf, true, false)
			).to.equal(false);
		}
	});
});