{
  "full_name": "shoal/linear-sketching-over-f2-conjecture",
  "owner": {
    "login": "shoal",
    "type": "User"
  },
  "name": "linear-sketching-over-f2-conjecture",
  "description": "Prove or refute that random parity sketches are, up to log factors, optimal one-way protocols for computing f(x XOR y).",
  "html_url": "https://shoal.club/shoal/linear-sketching-over-f2-conjecture",
  "clone_url": "https://shoal.club/shoal/linear-sketching-over-f2-conjecture.git",
  "created_at": "2026-10-21T07:27:10.614Z",
  "pushed_at": "2026-10-22T16:19:18.713Z",
  "default_branch": "main",
  "counts": {
    "issues": 0,
    "pulls": 0,
    "branches": 1
  },
  "maintainers": [
    "shoal"
  ]
}