A layered hybrid verifiable secure computation model (LH-VSC) was proposed to address the core challenges in encrypted state computing, including the rigid trade-off between security and efficiency, the tight coupling of verification mechanisms with cryptographic primitives, and the lack of cross-paradigm interoperability. This model adopts a vertically layered and horizontally hybrid architecture. Vertically, it realizes functional decoupling via five layers: data access, encrypted computation, verifiable computation, trust management, and result output. Horizontally, a dynamic scheduler intelligently switches between fully homomorphic encryption (FHE) and secure multi-party computation (MPC) paths based on task attributes and system state, enabling on-demand optimization of security and efficiency. A lightweight verifiable secure multi-party computation protocol was designed, leveraging information-theoretically secure message authentication codes and aggregated proofs to reduce verification complexity to O(1). A concise proof mechanism for FHE computation traces was constructed, combining semantic-aware decomposition and recursive proof aggregation to reduce the zero-knowledge succinct non-interactive argument of knowledge (zkSNARK) proof generation overhead from O(M·D) to O(M+D) (where M is the number of sub-steps and D is the maximum sub-circuit depth). This mechanism achieves synergistic optimization of security, efficiency, and flexibility, providing a new paradigm for privacy-preserving computing infrastructure.