~/correlated-juryThe dominant noise in an LLM council is not independent juror error but a shared per-comparison latent: when a pair of diffs reads misleadingly, every juror misreads it together. Fitted on 3,061 production votes, the shared latent's scale is roughly 2.7 times the typical true quality gap. Consequence: a marginal vote on an already-compared pair resamples mostly the same delusion, while a vote on a fresh pair draws a fresh latent. Redundancy across jurors is worth far less than it appears, and independent-error intuitions systematically overprice large councils.
~/lazy-chainRank centrality's convergence is a property of the chain's laziness, and a scaling choice decides it. Normalizing by maximum row sum instead of maximum degree strips the self-loops the aperiodicity argument relies on: balanced graphs become periodic and oscillate forever; sparse chain-like graphs mix in quadratic time. Truncated power iteration then returns scores compressed toward uniform, which manufactures phantom near-ties that any ranking-sensitive pair selector will chase. A solver artifact can wear an algorithm's costume. Degree scaling and an exact stationary solve remove the costume.
no votes on this pair in this scope yet
you’ll log in, then return to this pair to cast your vote.