MinIO protects data against hardware failures and silent data corruption using erasure code and checksums. With the highest level of redundancy, you may lose up to half (N/2) of the total drives and still be able to recover the data.

## What is Erasure Code?

            circuitBreaker.executeWithCircuitBreaker(() -> {
                assertEquals(State.HALF_OPEN, circuitBreaker.getState(), "Should be in HALF_OPEN state");
                throw new RuntimeException("Failure in half-open");
            });
            fail("Should have thrown exception");
        } catch (CIFSException e) {
            // Expected
        }

     * Creates a simple circuit breaker
     *
     * @param name the circuit breaker name
     * @param failureThreshold number of consecutive failures to open circuit
     * @param successThreshold number of successes in half-open to close circuit
     * @param timeoutMillis timeout before attempting to close open circuit
     */
    public SimpleCircuitBreaker(String name, int failureThreshold, int successThreshold, long timeoutMillis) {

        <span class="sponsor-badge">sponsor</span>
        <img class="sponsor-image" src="/img/sponsors/render-banner.svg" />
      </a>
    </div>
    <div class="item">
      <a title="Cut Code Review Time & Bugs in Half with CodeRabbit" style="display: block; position: relative;" href="https://www.coderabbit.ai/?utm_source=fastapi&utm_medium=banner&utm_campaign=fastapi" target="_blank">
        <span class="sponsor-badge">sponsor</span>

    img: https://fastapi.tiangolo.com/img/sponsors/render.svg
  - url: https://www.coderabbit.ai/?utm_source=fastapi&utm_medium=badge&utm_campaign=fastapi
    title: Cut Code Review Time & Bugs in Half with CodeRabbit
    img: https://fastapi.tiangolo.com/img/sponsors/coderabbit.png
  - url: https://subtotal.com/?utm_source=fastapi&utm_medium=sponsorship&utm_campaign=open-source
    title: The Gold Standard in Retail Account Linking

        return (logX2Floor < 2 * logFloor + 1) ? logFloor : logFloor + 1;
    }
    throw new AssertionError();
  }

  /*
   * The maximum number of bits in a square root for which we'll precompute an explicit half power
   * of two. This can be any value, but higher values incur more class load time and linearly
   * increasing memory consumption.
   */
  @VisibleForTesting static final int SQRT2_PRECOMPUTE_THRESHOLD = 256;

	// runtime stack of go routines will be listed with 2 blank spaces between each of them, so split on "\n\n" .
	for g := range strings.SplitSeq(string(buf), "\n\n") {
		// Again split on a new line, the first line of the second half contains the info about the go routine.
		sl := strings.SplitN(g, "\n", 2)
		if len(sl) != 2 {
			continue
		}
		stack := strings.TrimSpace(sl[1])
		// ignore the testing go routine.

      // return condition1 || condition2;
      if (nodeU().equals(other.nodeU())) { // check condition1
        // Here's the tricky bit. We don't have to explicitly check for condition2 in this case.
        // Why? The second half of condition2 requires that nodeV equals other.nodeU.
        // We already know that nodeU equals other.nodeU. Combined with the earlier statement,

     * @param failureThreshold number of failures before opening
     * @param successThreshold number of successes in half-open before closing
     * @param resetTimeoutMillis time to wait before attempting reset (ms)
     * @param halfOpenMaxAttempts max attempts in half-open state
     */

      // return condition1 || condition2;
      if (nodeU().equals(other.nodeU())) { // check condition1
        // Here's the tricky bit. We don't have to explicitly check for condition2 in this case.
        // Why? The second half of condition2 requires that nodeV equals other.nodeU.
        // We already know that nodeU equals other.nodeU. Combined with the earlier statement,