Abstract
We define and construct a fully-local somewhere statistically binding (SSB) hash family, in which local openings are succinct and, crucially, can be verified against a succinct digest of the hash value. We use this hash family to boost the succinctness of any nontrivial non-interactive batch argument (BARG) scheme to the best possible, given the extractability property we need. This immediately gives us two applications: multi-hop aggregate signatures and incrementally verifiable computation.