Preset: prototype_medium  q=65537 n=512 k=3 eta=9.5367431640625e-07 n_c=256 m_c=1024 eta_c=9.5367431640625e-07
Overall best feasible screen: 24.00 bits
These are heuristic screening estimates, not certified security levels.

Instance: sparse_lpn_expansion_key  q=65537 n=512 samples=263169 eta=9.53674e-07 row_weight=3
  comment: N GSW matrices with N rows each, screening as sparse-LPN samples
  best feasible screen: 27.00 bits  status=toy/broken-screen
  warning: public/evaluation key exposes at least as many samples as the secret dimension
  warning: very small sparse row weight; use only for tests unless justified by a proof/estimator
  attacks:
    - clean_subset_linear_solve: work=27.00 mem=18.00 feasible=yes
      note: clean-subset trial exponent without linear-algebra overhead is 0.0007044 bits
    - low_weight_structural_warning: work=45.01 mem=18.01 feasible=yes
      note: row_weight=3 is very small; sparse-LPN security normally requires careful asymptotic growth
    - direct_secret_enumeration: work=8192.01 mem=0.00 feasible=yes
      note: baseline upper bound on brute-force work
    - prange_isd: work=43.00 mem=18.00 feasible=yes
      note: uses t=ceil(eta*m)=1 errors for m=263169 samples
    - modern_isd_floor_screen: work=1.42e+04 mem=n/a feasible=yes
      note: heuristic red-flag floor inspired by modern binary ISD asymptotics
    - bkw_proxy: work=340.64 mem=336.00 feasible=no
      note: best block=21, levels=25

Instance: code_lpn_compaction_key  q=65537 n=256 samples=525312 eta=9.53674e-07 row_weight=None
  comment: N CLPN ciphertexts, each with m_c dense q-ary LPN rows
  best feasible screen: 24.00 bits  status=toy/broken-screen
  warning: public/evaluation key exposes at least as many samples as the secret dimension
  attacks:
    - clean_subset_linear_solve: work=24.00 mem=16.00 feasible=yes
      note: clean-subset trial exponent without linear-algebra overhead is 0.0003522 bits
    - direct_secret_enumeration: work=4096.01 mem=0.00 feasible=yes
      note: baseline upper bound on brute-force work
    - prange_isd: work=40.00 mem=16.00 feasible=yes
      note: uses t=ceil(eta*m)=1 errors for m=525312 samples
    - modern_isd_floor_screen: work=2.84e+04 mem=n/a feasible=yes
      note: heuristic red-flag floor inspired by modern binary ISD asymptotics
    - bkw_proxy: work=180.59 mem=176.00 feasible=no
      note: best block=11, levels=24
