diff --git a/lib/constraint.c b/lib/constraint.c
index c49e91d..2f70dd2 100644
--- a/lib/constraint.c
+++ b/lib/constraint.c
@@ -295,7 +295,7 @@ static node_t* _lookup_node(node_t *root, uint32_t prefix, int len)
 void constraint_paint_value(constraint_t *con, value_t value)
 {
 	assert(con);
-	log_info("constraint", "Painting value %lu", value);
+	log_trace("constraint", "Painting value %lu", value);
 
 	// Paint everything except what we will put in radix
 	_count_ips_recurse(con->root, value, (uint64_t)1 << 32, 1, 1);
@@ -311,7 +311,7 @@ void constraint_paint_value(constraint_t *con, value_t value)
 			con->radix[con->radix_len++] = prefix;
 		}
 	}
-	log_info("constraint", "%lu IPs in radix array, %lu IPs in tree",
+	log_debug("constraint", "%lu IPs in radix array, %lu IPs in tree",
 			con->radix_len * (1 << (32 - RADIX_LENGTH)), con->root->count);
 	con->painted = 1;
 	con->paint_value = value;
diff --git a/src/cyclic.c b/src/cyclic.c
index 04424d3..7d2eeee 100644
--- a/src/cyclic.c
+++ b/src/cyclic.c
@@ -161,7 +161,7 @@ int cyclic_init(uint32_t primroot_, uint32_t current_)
 	for (i=0; i<sizeof(groups)/sizeof(groups[0]); i++) {
 		if (groups[i].prime > num_addrs) {
 			cur_group = &groups[i];
-			log_info("cyclic", "using prime %lu, known_primroot %lu", cur_group->prime, cur_group->known_primroot);
+			log_debug("cyclic", "using prime %lu, known_primroot %lu", cur_group->prime, cur_group->known_primroot);
 			prime = groups[i].prime;
 			break;
 		}