increase cost granularity by 2 orders of magnitude

fix args-unknown-1.clvm test to exceed the max cost again
tweak costs to charge more for memory allocations
charge for memory allocations accurately, based on output size, not input size

Author: arvidn

src/core_ops.rs

@@ -4,13 +4,16 @@ use crate::node::Node;
 use crate::op_utils::{atom, check_arg_count};
 use crate::reduction::{Reduction, Response};
 
-const FIRST_COST: Cost = 1;
-const IF_COST: Cost = 1;
-const CONS_COST: Cost = 3;
-const REST_COST: Cost = 1;
-const LISTP_COST: Cost = 1;
-const CMP_BASE_COST: Cost = 2;
-const CMP_COST_PER_BYTE_DIVIDER: Cost = 64;
+const FIRST_COST: Cost = 30;
+const IF_COST: Cost = 33;
+// Cons cost lowered from 245. It only allocates a pair, which is small
+const CONS_COST: Cost = 50;
+// Rest cost lowered from 77 since it doesn't allocate anything and it should be
+// the same as first
+const REST_COST: Cost = 30;
+const LISTP_COST: Cost = 19;
+const EQ_BASE_COST: Cost = 117;
+const EQ_COST_PER_BYTE: Cost = 1;
 
 pub fn op_if<T: Allocator>(a: &mut T, input: T::Ptr, _max_cost: Cost) -> Response<T::Ptr> {
     let args = Node::new(a, input);
@@ -67,6 +70,6 @@ pub fn op_eq<T: Allocator>(a: &mut T, input: T::Ptr, _max_cost: Cost) -> Respons
     let a1 = args.rest()?.first()?;
     let s0 = atom(&a0, "=")?;
     let s1 = atom(&a1, "=")?;
-    let cost = CMP_BASE_COST + (s0.len() as Cost + s1.len() as Cost) / CMP_COST_PER_BYTE_DIVIDER;
+    let cost = EQ_BASE_COST + (s0.len() as Cost + s1.len() as Cost) * EQ_COST_PER_BYTE;
     Ok(Reduction(cost, if s0 == s1 { a.one() } else { a.null() }))
 }