Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 7 of 7 for corruption (0.05 sec)

  1. docs/erasure/README.md

    # MinIO Erasure Code Quickstart Guide [![Slack](https://slack.min.io/slack?type=svg)](https://slack.min.io)
    
    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?
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  2. SECURITY.md

      - A description of the technical details of the vulnerabilities.
      - A minimal example of the vulnerability. It is very important to let us know
        how we can reproduce your findings. For memory corruption triggerable in
        TensorFlow models, please demonstrate an exploit against one of Alphabet's
        models in <https://tfhub.dev/>
      - An explanation of who can exploit this vulnerability, and what they gain
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Wed Oct 16 16:10:43 UTC 2024
    - 9.6K bytes
    - Viewed (0)
  3. okhttp/src/jvmTest/kotlin/okhttp3/CacheCorruptionTest.kt

      }
    
      private fun corruptMetadata(corruptor: (String) -> String) {
        val metadataFile =
          fileSystem.allPaths.find {
            it.name.endsWith(".0")
          }
    
        if (metadataFile != null) {
          val contents =
            fileSystem.read(metadataFile) {
              readUtf8()
            }
    
          fileSystem.write(metadataFile) {
            writeUtf8(corruptor(contents))
          }
        }
      }
    
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Wed Jun 18 12:28:21 UTC 2025
    - 6K bytes
    - Viewed (0)
  4. cmd/bitrot.go

    // algorithms compute correct checksums. If any algorithm
    // produces an incorrect checksum it fails with a hard error.
    //
    // bitrotSelfTest tries to catch any issue in the bitrot implementation
    // early instead of silently corrupting data.
    func bitrotSelfTest() {
    	checksums := map[BitrotAlgorithm]string{
    		SHA256:          "a7677ff19e0182e4d52e3a3db727804abc82a5818749336369552e54b838b004",
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Wed Feb 26 19:26:13 UTC 2025
    - 7.7K bytes
    - Viewed (0)
  5. src/archive/tar/strconv.go

    			nanoDigits[i] = c
    		}
    	}
    	nsecs, _ := strconv.ParseInt(string(nanoDigits[:]), 10, 64) // Must succeed after validation
    	if len(ss) > 0 && ss[0] == '-' {
    		return time.Unix(secs, -1*nsecs), nil // Negative correction
    	}
    	return time.Unix(secs, nsecs), nil
    }
    
    // formatPAXTime converts ts into a time of the form %d.%d as described in the
    // PAX specification. This function is capable of negative timestamps.
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon Sep 08 17:08:20 UTC 2025
    - 9.1K bytes
    - Viewed (0)
  6. CODE_OF_CONDUCT.md

    reporter of any incident.
    
    ## Enforcement Guidelines
    
    Community leaders will follow these Community Impact Guidelines in determining
    the consequences for any action they deem in violation of this Code of Conduct:
    
    ### 1. Correction
    
    **Community Impact**: Use of inappropriate language or other behavior deemed
    unprofessional or unwelcome in the community.
    
    **Consequence**: A private, written warning from community leaders, providing
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Thu Oct 17 06:18:13 UTC 2024
    - 5K bytes
    - Viewed (0)
  7. cmd/erasure-coding.go

    // produces an incorrect value it fails with a hard error.
    //
    // erasureSelfTest tries to catch any issue in the erasure implementation
    // early instead of silently corrupting data.
    func erasureSelfTest() {
    	// Approx runtime ~1ms
    	var testConfigs [][2]uint8
    	for total := uint8(4); total < 16; total++ {
    		for data := total / 2; data < total; data++ {
    			parity := total - data
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 8.5K bytes
    - Viewed (0)
Back to top