8 More Discussions You Might Find Interesting
1. UNIX and Linux Applications
Dear All,
Is it possible to using 2 envelope options on fetchmail ?
Here is fetchmailrc configuration :
envelope "Envelope-To"
envelope "X-Apparently-To"
Thx :) (0 Replies)
Discussion started by: rhein_onizuka@y
0 Replies
2. Linux
Hello there Unix & Linux Guru's and Gifted ones,
Can anyone help me configure fetchmail on my redhat 9.0
This sounds to be silly but really I'm new to linux.
I really need step by step installation and configuration on our company's required Redhat 9.0 (shrike) OS.
Thank you and God... (2 Replies)
Discussion started by: struggled_boy
2 Replies
3. UNIX for Dummies Questions & Answers
Hi,
I'm searching for an solution for the following problem.
I want fetch some mails via pop3 from a@a.com with fetchmail.
That works perfectly. Now any incoming mail should forwarded to b@b.com via smtp obv. But I don't know how to configure that. All online tutorials describe forwarding to... (0 Replies)
Discussion started by: mcW
0 Replies
4. Linux
Hello All.
I was messing around with Fetchmail on a Test Email account. Here's what my fetchmailrc file looks like:
poll imap.gmail.com proto IMAP fetchall
ssl
When I ran this, it removed all the test emails from my Google Account. There were a few emails that I needed, however, I... (3 Replies)
Discussion started by: drewrockshard
3 Replies
5. UNIX for Dummies Questions & Answers
Guys,
could you tell me how to create an imap gmail ssl certificate?
in my .fetchmailrc file I have
poll imap.gmail.com protocol IMAP user "xxxxx@gmail.com" there with password "xxxx" nofetchall keep ssl
but I'm getting an error
fetchmail: Server certificate verification error:... (13 Replies)
Discussion started by: c19h28O2
13 Replies
6. UNIX for Dummies Questions & Answers
Hi peeps,
We are having around 60 users.
The time set to retrieve the mail is 300 sec.
But it's taking around 1 hour to deliver mails.
I am using debian sarge 3.1.
any clues?
And how it will affect if I decrease the time?
My machine has got 1 p4 3.0 GHZ processor and 1 GB ram.
The home... (2 Replies)
Discussion started by: squid04
2 Replies
7. IP Networking
once i used kmail (or sometimes outlook express) for my e-mail client.
i had no problem with that.
now being with unix console, i want to retrieve pop3 mails, using fetchmail.
(where i can browse my mailbox(es) later)
and it seems something i'm missing or do not understand.
assuming my e-mail... (2 Replies)
Discussion started by: jaguar
2 Replies
8. UNIX for Dummies Questions & Answers
Hi all.
I'm currently building my own webmail server but I will need to collect my mail from several different account scattered around the 'Net.
I know fetchmail can do this. The problem I have is that my main POP3 mailbox at my ISP lumps all users' e-mails into one box.
This means that... (0 Replies)
Discussion started by: DraconianTimes
0 Replies
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)