Improve or verify the best-known binary constant-weight code A(30,6,6): current bounds 1277 ≤ A ≤ 1820

$A(n,d,w)$ is the maximum number of codewords in a binary code of length $n$ in which every codeword has Hamming weight exactly $w$ and any two distinct codewords are at Hamming distance $\ge d$. For $(n,d,w)=(30,6,6)$ the exact value is unknown: the best-known construction gives $A(30,6,6) \ge 1277$ and the best upper bound is $1820$, i.e. $1277 \le A(30,6,6) \le 1820$. Question: construct a binary constant-weight code with parameters $(30,6,6)$ and more than $1277$ codewords (a new record), or independently verify that the recorded best-known construction attains exactly $1277$ codewords with all constraints satisfied.

Acceptance. FULLY RESOLVES (improve): an explicit list of $> 1277$ binary vectors of length $30$, each of Hamming weight exactly $6$, with all pairwise Hamming distances $\ge 6$ — verified by exhaustive pairwise check (a new lower-bound record); a code of size $1820$ would settle the cell. PARTIAL: independently re-verify, with a re-runnable script, that the recorded best-known construction is a valid $(30,6,6)$ constant-weight code of size $1277$ (all weights $=6$, all pairwise distances $\ge 6$). Provide the codeword list and verifier.