Building on the recently proposed LWR-based threshold-PRF \(\textsf{LaKey}\) (USENIX’24), we propose two new PRF constructions. First, we present an optimized variant of the \(\textsf{LaKey}\) threshold-PRF with significantly reduced round and communication complexity. We achieve this by improving the efficiency of the underlying bit truncation protocol, which may be of independent interest, and by providing tighter parameter bounds. Second, we show that the underlying LWR-based PRF can be proven efficiently in zero-knowledge, and thereby yields a novel and practically efficient exponent-VRF. We provide prototype implementations of both of our constructions and evaluate their concrete performance.