I'm hoping one of you scripting experts can help me.
I'm trying to find out the IP Address of every printer on my HP-UX server. (There's 256 of them)
I'm trying to do it using the PERIPH= value in /etc/lp/interface/<printername>, but I'm having problems scripting it as I'm a bit of a newbie.
... (2 Replies)
i've seen a few posts regarding this issue, and i've tried the resolutions,
but i keep running into the same problem.
i'm trying to compile OpenSSL with the use of rsaref-2.0 (i'm running
through this tutorial... (1 Reply)
I hv the below script , that is work fine on unix sytem ( ksh ) , but it is not work in my RH system ,
the script can kill the idle user who have idel for 120 minutes but exclude the user in the exception.lst the error happen when run the statemnt " (( time = $TIMEOU + 1 )) " , could suggest... (3 Replies)
hI
I m very new to unix ,...
I m facing an issue
I have to search though a list of directorys, find all .gz files which are older than 7 days and delete that ,,,
Any one knows a single command to do this ..
Thnks in advance
BInu (3 Replies)
hi,
I have this script in python
#!/usr/bin/env python
from Crypto.Cipher import DES3
def desEncrypt(key, data):
d = des4me(key)
return d.encrypt(data)
def des4me(key):
return DES3.new(key, DES3.MODE_ECB)
... (8 Replies)
I am trying to compile nrpe 2.12 against openssl 1.0 on Solaris 10 however I am getting core dumps for some reason. Anyone know a way to fix this?
Here is the output of make:
bash-3.00# make all
cd ./src/; make ; cd ..
gcc -g -fPIC -Wall -O2 -I/usr/local/ssl/include... (0 Replies)
I am trying to run an old script to modify an image file with a modified header to bypass the md5 check but it comes up with an error message. The image file is for use on a Expressgate SSD so that I can add sqx files to it. This is a link from where I got the script:-... (3 Replies)
Hello,
I hope this means something to someone. I have an odd problem that just started happening recently. I am not the system admin, so I don't have full info on any changes to the system lately. Except that I did upgrade OpenSSL to version 1.0.1.c from 1.0.0j.
Anyway, I am trying to... (4 Replies)
Hi Guys sorry about post the code in portuguese but now i fix almost parts of code. now i can encryped and decryped the files but have a small problem. When not writte nathing generate automatically a random cypher but after the value of this cypher not appear igual than variable $saved_key. And... (2 Replies)
Discussion started by: Xremix30
2 Replies
LEARN ABOUT DEBIAN
bup-margin
bup-margin(1) General Commands Manual bup-margin(1)NAME
bup-margin - figure out your deduplication safety margin
SYNOPSIS
bup margin [options...]
DESCRIPTION
bup margin iterates through all objects in your bup repository, calculating the largest number of prefix bits shared between any two
entries. This number, n, identifies the longest subset of SHA-1 you could use and still encounter a collision between your object ids.
For example, one system that was tested had a collection of 11 million objects (70 GB), and bup margin returned 45. That means a 46-bit
hash would be sufficient to avoid all collisions among that set of objects; each object in that repository could be uniquely identified by
its first 46 bits.
The number of bits needed seems to increase by about 1 or 2 for every doubling of the number of objects. Since SHA-1 hashes have 160 bits,
that leaves 115 bits of margin. Of course, because SHA-1 hashes are essentially random, it's theoretically possible to use many more bits
with far fewer objects.
If you're paranoid about the possibility of SHA-1 collisions, you can monitor your repository by running bup margin occasionally to see if
you're getting dangerously close to 160 bits.
OPTIONS --predict
Guess the offset into each index file where a particular object will appear, and report the maximum deviation of the correct answer
from the guess. This is potentially useful for tuning an interpolation search algorithm.
--ignore-midx
don't use .midx files, use only .idx files. This is only really useful when used with --predict.
EXAMPLE
$ bup margin
Reading indexes: 100.00% (1612581/1612581), done.
40
40 matching prefix bits
1.94 bits per doubling
120 bits (61.86 doublings) remaining
4.19338e+18 times larger is possible
Everyone on earth could have 625878182 data sets
like yours, all in one repository, and we would
expect 1 object collision.
$ bup margin --predict
PackIdxList: using 1 index.
Reading indexes: 100.00% (1612581/1612581), done.
915 of 1612581 (0.057%)
SEE ALSO bup-midx(1), bup-save(1)BUP
Part of the bup(1) suite.
AUTHORS
Avery Pennarun <apenwarr@gmail.com>.
Bup unknown-bup-margin(1)