Is the matrix centrosymmetric... and so is the code? Defintion

A centrosymmetric matrix is a square matrix that is symmetric about its center. More rigorously, a matrix \$A\$ of size \$n \times n\$ is centrosymmetric if, for any \$i,\: j \in ([1, n] \cap \mathbb{Z})\$ the following relation is satisfied:
$$A_{i,\:j}=A_{n+1-i,\:n+1-j}$$

Examples of such matrices

Here is an illustration of the symmetry of a matrices like these (borrowed from the aforementioned Wikipedia article):



An even-side-length (\$4\times 4\$) centrosymmetric matrix:

$$\left(\begin{matrix}
1 &amp; 2 &amp; 3 &amp; 4 \\
5 &amp; 6 &amp; 7 &amp; 8 \\
8 &amp; 7 &amp; 6 &amp; 5 \\
4 &amp; 3 &amp; 2 &amp; 1\end{matrix}\right)$$

And an odd-side-length (\$3\times 3\$) one:

$$\left(\begin{matrix}
1 &amp; 2 &amp; 3 \\
5 &amp; 6 &amp; 5 \\
3 &amp; 2 &amp; 1\end{matrix}\right)$$

Task and Specs

Given a square matrix of size at least \$2\$, output one of two distinct and consistent values, deciding whether the matrix is centrosymmetric or not. You can assume that the matrix will consist entirely of positive integers.

However, your code must also be centrosymmetric. That is, it must be a program / function (or equivalents) consisting of \$n\$ lines, each of which containing \$n\$ bytes in your language's encoding, and must satisfy the definition given above, but with bytes instead of positive integers. Your submission's score will be the value of \$n\$, with a lower \$n\$ being better. 

You can take input and provide output through any standard method and in any reasonable format, while taking note that these loopholes are forbidden by default. You may (optionally) choose to take the size, \$n\$, as input too (unless you take input as a 1D list, in which case you may only take \$n^2\$ as additional input).

Test cases

Truthy:

[[1, 2], [2, 1]]
[[1, 2, 3], [5, 6, 5], [3, 2, 1]]
[[10, 5, 30], [2, 6, 2], [30, 5, 10]]
[[100, 100, 100], [100, 50, 100], [100, 100, 100]]
[[1, 2, 3, 4], [5, 6, 7, 8], [8, 7, 6, 5], [4, 3, 2, 1]]
[[3, 4, 5, 6, 7], [5, 6, 7, 8, 9], [3, 2, 10, 2, 3], [9, 8, 7, 6, 5], [7, 6, 5, 4, 3]]


Falsy:

[[1, 2], [1, 2]]
[[1, 2, 10], [5, 6, 5], [11, 2, 1]]
[[14, 5, 32], [2, 6, 2], [30, 5, 16]]
[[19, 19, 19], [40, 50, 4], [19, 19, 19]]
[[1, 2, 20, 4], [7, 6, 7, 8], [8, 7, 6, 6], [3, 3, 2, 1]]
[[3, 4, 5, 6, 7], [5, 6, 7, 8, 9], [4, 5, 10, 4, 5], [5, 6, 7, 8, 9], [3, 4, 5, 6, 7]]
JavaScript (ES6), size 12 11 9

All versions return false for centrosymmetric or true for non-centrosymmetric.



1-dimensional array + length, size 9 (89 bytes)

Takes input in currying syntax (length)(array), where array is 1-dimensional.



w=&gt;a=&gt; //
a.some //
(v=&gt;v- //
a[--w])//
/////////
//)]w--[a
// -v&gt;=v(
// emos.a
// &gt;=a&gt;=w


Try it online!



Matrix + width, size 11 (131 bytes)

Takes input in currying syntax (width)(matrix).



/**/w=&gt;a=&gt;a
.some(r=&gt;r.
some(v=&gt;v-a
[y][w-++x],
x=!y--),y=w
);'*/'/*';)
w=y,)--y!=x
,]x++-w[]y[
a-v&gt;=v(emos
.r&gt;=r(emos.
a&gt;=a&gt;=w/**/


Try it online!

Payload

w =&gt; a =&gt; a.some(r =&gt; r.some(v =&gt; v - a[y][w - ++x], x = !y--), y = w)


Container

/**/CODE;'*/'/*';EDOC/**/




Matrix only, size 12 (155 bytes)

This is my original solution, which computes the width of the matrix by itself.

/**/a=&gt;a[w=a
.length-1,s=
'some']((r,y
)=&gt;r[s]((v,x
)=&gt;v-a[w-y][
w-x]))////*/
/*////))]x-w
[]y-w[a-v&gt;=)
x,v((]s[r&gt;=)
y,r((]'emos'
=s,1-htgnel.
a=w[a&gt;=a/**/


Try it online!

How?

We need a few critical tokens that cannot be split:


some
length
)=&gt;


Line-feeds may be inserted almost anywhere else.

The unrolled payload code reads as:

a =&gt; a[w = a.length - 1, s = 'some']((r, y) =&gt; r[s]((v, x) =&gt; v - a[w - y][w - x]))


and is wrapped inside the following structure:

/**/CODE////*/


which, once reversed, becomes a valid block comment:

/*////EDOC/**/