private double computeNodeConfidenceScore() {

			// this is a simple and unoptimized way of doing this

			// basically we construct a BlockChain type from Leaf-to-Root path

			// then compute the ConfidenceScore

			Node currentNode = this;
			BlockChain thisChain = new BlockChain(this.block);

			while (currentNode != null) {

				// System.out.println(">"+currentNode currentNode.block.id);

				currentNode = currentNode.parent;

				if (currentNode != null)
					thisChain.chain.addFirst(currentNode.block);

			}

			// thisChain.printChain("chain ");
			double score = thisChain.computeConfidenceScore();

			return score;

		}