Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 5 of 5 for proof (0.07 seconds)

  1. cmd/utils.go

    	}
    
    	dst := make(map[string][]byte, len(globalProfiler))
    	for typ, prof := range globalProfiler {
    		// Stop the profiler
    		var err error
    		buf, err := prof.Stop()
    		delete(globalProfiler, typ)
    		if err == nil {
    			dst[typ+"."+prof.Extension()] = buf
    		}
    		for name, buf := range prof.Records() {
    			if len(buf) > 0 {
    				dst[typ+"-"+name+"."+prof.Extension()] = buf
    			}
    		}
    	}
    	return dst, nil
    }
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 33K bytes
    - Click Count (0)
  2. cmd/admin-handlers.go

    		// Start profiling locally as well.
    		prof, err := startProfiler(profiler)
    		if err != nil {
    			hostErrs = append(hostErrs, NotificationPeerErr{
    				Host: *thisAddr,
    				Err:  err,
    			})
    		} else {
    			globalProfiler[profiler] = prof
    			hostErrs = append(hostErrs, NotificationPeerErr{
    				Host: *thisAddr,
    			})
    		}
    	}
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 99.7K bytes
    - Click Count (0)
  3. cmd/peer-rest-server.go

    			if p == k {
    				v.Stop()
    				delete(globalProfiler, k)
    			}
    		}
    	}
    
    	for _, profiler := range profiles {
    		prof, err := startProfiler(profiler)
    		if err != nil {
    			s.writeErrorResponse(w, err)
    			return
    		}
    		globalProfiler[profiler] = prof
    	}
    }
    
    // DownloadProfilingDataHandler - returns profiled data.
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 53.6K bytes
    - Click Count (0)
  4. lib/fips140/v1.0.0-c2097c7c.zip

    extended binary GCD algorithm described in the Handbook of // Applied Cryptography, Algorithm 14.61, adapted by BoringSSL to bound // coefficients and avoid negative numbers. For more details and proof of // correctness, see https://github.com/mit-plv/fiat-crypto/pull/333/files. // // Following the proof linked in the PR above, the changes are: // // 1. Negate [B] and [C] so they are positive. The invariant now involves a // subtraction. // 2. If step 2 (both [x] and [y] are even) runs, abort immediately....
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  5. lib/fips140/v1.1.0-rc1.zip

    extended binary GCD algorithm described in the Handbook of // Applied Cryptography, Algorithm 14.61, adapted by BoringSSL to bound // coefficients and avoid negative numbers. For more details and proof of // correctness, see https://github.com/mit-plv/fiat-crypto/pull/333/files. // // Following the proof linked in the PR above, the changes are: // // 1. Negate [B] and [C] so they are positive. The invariant now involves a // subtraction. // 2. If step 2 (both [x] and [y] are even) runs, abort immediately....
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
Back to Top