Bootstrapping, a complex and computationally intensive component of Fully Homomorphic Encryption (FHE), is central to enabling the evaluation of arbitrary computations on encrypted data without accessing the secret key. The concept, first proposed by Craig Gentry in 2008, involves homomorphically evaluating the decryption procedure to refresh noisy ciphertexts, allowing further computations. This document aims to clarify bootstrapping's intricacies, correct common misconceptions, and compare various methods, such as those used in CKKS, DM/CGGI, and BGV/BFV schemes, highlighting their respective trade-offs and performance. Each method's suitability varies depending on the application, with CKKS being optimal for real-number computations, DM/CGGI for arbitrary functions over small integers, and BGV/BFV for large vectors of small integers. The document also discusses practical guidelines and the potential for hardware acceleration to improve efficiency, offering recommendations for deploying FHE in different contexts. The OpenFHE library incorporates bootstrapping for several schemes, with ongoing developments to enhance its capabilities.