"why":"second pass of identical lines must be 100% idempotent skips (boolean true coerced to 1)"
},
"value":true,
"pass":true
}
]
},
"bulk-get":{
"result":{
"k":30,
"workers":8,
"serial":{
"n":5,
"min_ms":1520.47,
"median_ms":1606.86,
"p90_ms":1805.72,
"p95_ms":1835.83,
"max_ms":1865.94,
"mean_ms":1658.6,
"warmup":{
"n":1,
"min_ms":1601.2,
"median_ms":1601.2,
"p90_ms":1601.2,
"p95_ms":1601.2,
"max_ms":1601.2,
"mean_ms":1601.2
}
},
"concurrent":{
"n":5,
"min_ms":340.31,
"median_ms":356.48,
"p90_ms":358.82,
"p95_ms":359.32,
"max_ms":359.83,
"mean_ms":351.42,
"warmup":{
"n":2,
"min_ms":353.43,
"median_ms":434.94,
"p90_ms":500.15,
"p95_ms":508.3,
"max_ms":516.45,
"mean_ms":434.94
}
},
"speedup_ratio":4.51
},
"gates":[
{
"rule":{
"field":"speedup_ratio",
"op":">=",
"min":1.5,
"why":"controlled-K concurrent vs serial; lower bar than full-vault since K is small"
},
"value":4.51,
"pass":true
}
]
},
"bulk-put":{
"result":{
"k":30,
"per_put":{
"n":30,
"min_ms":100.09,
"median_ms":114.98,
"p90_ms":212.46,
"p95_ms":236.18,
"max_ms":330.77,
"mean_ms":143.25
},
"total_ms":4297.5,
"puts_per_sec":7.0
},
"gates":[]
},
"cache":{
"result":{
"requested":60,
"unique":20,
"returned":20,
"deduped":true,
"elapsed_ms":307.13
},
"gates":[
{
"rule":{
"field":"deduped",
"op":">=",
"min":1,
"why":"read_many must collapse a 3x-duplicated path list to the unique set"
},
"value":true,
"pass":true
}
]
},
"expand-graph":{
"result":{
"subjects":[
{
"label":"hub-echo",
"query":"echo",
"neighbours":120,
"serial_ms":2227.67,
"concurrent_ms":642.2,
"speedup":3.47,
"ranking_identical":true,
"scores_identical":true
},
{
"label":"hub-prefs",
"query":"operator preferences",
"neighbours":126,
"serial_ms":2910.46,
"concurrent_ms":698.8,
"speedup":4.16,
"ranking_identical":true,
"scores_identical":true
}
],
"min_speedup":3.47,
"all_ranking_identical":true,
"all_scores_identical":true
},
"gates":[
{
"rule":{
"field":"min_speedup",
"op":">=",
"min":2.0,
"why":"recall()'s graph layer must fetch each BFS hop concurrently (read_many), not serially per node; <2x means expand_graph regressed to the pre-fix serial walk"
},
"value":3.47,
"pass":true
},
{
"rule":{
"field":"all_ranking_identical",
"op":">=",
"min":1,
"why":"the concurrent expansion must return the same ranked neighbours as the serial reference"
},
"value":true,
"pass":true
},
{
"rule":{
"field":"all_scores_identical",
"op":">=",
"min":1,
"why":"decayed scores must match the serial reference to within float tolerance"
},
"value":true,
"pass":true
}
]
},
"index":{
"result":{
"script":"sweep.py",
"elapsed_ms":4629.0,
"exit_code":0,
"ok":true,
"stderr_tail":[]
},
"gates":[]
},
"lint":{
"result":{
"script":"vault_lint.py",
"elapsed_ms":5126.4,
"exit_code":1,
"ok":true,
"stderr_tail":[]
},
"gates":[]
},
"lock":{
"result":{
"acquire_free_ms":159.18,
"acquire_free_rc":0,
"contended_ms":57.89,
"contended_rc_expected_75":75,
"release_ms":132.92,
"ok":true
},
"gates":[
{
"rule":{
"field":"ok",
"op":">=",
"min":1,
"why":"free acquire returns 0 and a contended acquire fast-fails with exit 75"
},
"value":true,
"pass":true
}
]
},
"pool-warmup":{
"result":{
"probe":"_agent/echo-vault.md",
"cold_ms":163.25,
"warm":{
"n":12,
"min_ms":45.64,
"median_ms":50.29,
"p90_ms":52.51,
"p95_ms":53.79,
"max_ms":55.28,
"mean_ms":50.26,
"warmup":{
"n":1,
"min_ms":51.68,
"median_ms":51.68,
"p90_ms":51.68,
"p95_ms":51.68,
"max_ms":51.68,
"mean_ms":51.68
}
},
"cold_over_warm_ratio":3.25
},
"gates":[
{
"rule":{
"field":"cold_over_warm_ratio",
"op":">=",
"min":1.5,
"why":"cold request must be meaningfully slower than warm \u2014 proves keep-alive is reusing the connection; a ratio near 1.0 means every request is re-handshaking (the pre-1.1.0 bug)"
},
"value":3.25,
"pass":true
}
]
},
"queue":{
"result":{
"k":10,
"enqueue":{
"n":10,
"min_ms":0.07,
"median_ms":0.08,
"p90_ms":0.18,
"p95_ms":0.2,
"max_ms":0.22,
"mean_ms":0.1
},
"pending_after_enqueue":10,
"note":"flush replay intentionally not run against the live vault; enqueue path timed only. See README queue caveat."
},
"gates":[]
},
"read-full":{
"result":{
"note_count":197,
"workers":8,
"serial":{
"n":1,
"min_ms":11376.08,
"median_ms":11376.08,
"p90_ms":11376.08,
"p95_ms":11376.08,
"max_ms":11376.08,
"mean_ms":11376.08
},
"concurrent":{
"n":4,
"min_ms":1559.79,
"median_ms":1595.31,
"p90_ms":1740.92,
"p95_ms":1768.05,
"max_ms":1795.17,
"mean_ms":1636.4,
"warmup":{
"n":2,
"min_ms":1641.35,
"median_ms":1652.91,
"p90_ms":1662.17,
"p95_ms":1663.32,
"max_ms":1664.48,
"mean_ms":1652.91
}
},
"speedup_ratio":7.13,
"notes_per_sec_concurrent":123.5
},
"gates":[
{
"rule":{
"field":"speedup_ratio",
"op":">=",
"min":1.8,
"why":"concurrent read_many must beat serial by the 1.1.0 concurrency margin; <1.8 means concurrency regressed"
