Twitter/X

Author (@0xdasha) frames the core problem as repeatedly finding R from…

2026-06-13 · 13:05 UTC ·@0xdasha ·1 min read

Brief

PVAC HFHE library update: octra-labs (pvachfhe) added a recrypt that enables unlimited computation chain depth for the PVAC HFHE scheme and shipped examples. The author emphasizes a hard algebraic task—finding R among 170141183460469231731687303715884105727 (2^127−1) possibilities—with values split into pairs/edges that generate more Rs. Public tests show 63 consecutive reset stages (support up to 16 terms, reset to 4); repo: github.com/octra-labs/pvachfhe_cpp.

Why it matters

Author (@0xdasha) frames the core problem as repeatedly finding R from 170141183460469231731687303715884105727 options (which is 2^127−1); values like 42 are split into 42+m and −m, then into edges that introduce additional R to find.

Key details

  • octra-labs updated pvac_hfhe with a recrypt that converts the HFHE (PVAC version) into a circuit with unlimited computation chain depth; the change is described as the penultimate update and includes usage examples.
  • Public test results: 63 consecutive reset stages passed with per-stage support rising to 16 terms then resetting to 4; test commands shown (make test-hfhe-native; PVAC_HFHE_DEPTH_ROUNDS=63 make test-hfhe-depth) and code at github.com/octra-labs/pvac_hfhe_cpp using Fp with p = 2^127−1.
Source evidence

tldr: find R out of 170141183460469231731687303715884105727 options, then find another R, then find another R, then realize 42 was split into 42+m and -m, then those were split into edges, then those edges have more R

pvac hfhe is just hard R math

λ (@lambda0xE)

a mini update, which actually turned out to be quite large, we updated the library and added the most important part - a recrypt that turns the HFHE (pvac ver) into a circuit with unlimited computation chain depth (we also added a bunch of examples of how to use it)

this is an important part and the penultimate one before the next final update,if you want to understand what this means, run benchmarks and review past results (hfhe against everything)

in the public test, 63 consecutive reset stages pass with support growing to 16 terms per stage and resetting back to 4 terms

run:
make test-hfhe-native

PVACHFHEDEPTH_ROUNDS = 63 make test-hfhe-depth

github.com/octra-labs/pvac_h…

Link

GitHub - octra-labs/pvachfhecpp: pvac-hfhe: PoC for publicly verifiable arithmetic computations...

pvac-hfhe: PoC for publicly verifiable arithmetic computations with hypergraph based homomorphic encryption over Fp (p = 2^127 - 1), omissions for large numbers and excluded the transfer mechanism ...
github.com

— https://nitter.net/lambda0xE/status/2065557301398773984#m