docs: typo fixes
Signed-off-by: Thomas Lamprecht <t.lamprecht@proxmox.com>
This commit is contained in:
		@ -143,7 +143,7 @@ Ext.onReady(function() {
 | 
			
		||||
	    permhtml += "</div></div>";
 | 
			
		||||
	} else {
 | 
			
		||||
	    //console.log(permission);
 | 
			
		||||
	    permhtml += "Unknown systax!";
 | 
			
		||||
	    permhtml += "Unknown syntax!";
 | 
			
		||||
	}
 | 
			
		||||
 | 
			
		||||
	return permhtml;
 | 
			
		||||
 | 
			
		||||
@ -472,7 +472,7 @@ located in ``/etc``, you could do the following:
 | 
			
		||||
  pxar:/ > restore target/ --pattern etc/**/*.conf
 | 
			
		||||
  ...
 | 
			
		||||
 | 
			
		||||
The above will scan trough all the directories below ``/etc`` and restore all
 | 
			
		||||
The above will scan through all the directories below ``/etc`` and restore all
 | 
			
		||||
files ending in ``.conf``.
 | 
			
		||||
 | 
			
		||||
.. todo:: Explain interactive restore in more detail
 | 
			
		||||
 | 
			
		||||
@ -123,6 +123,6 @@ you need to run:
 | 
			
		||||
  # apt-get install proxmox-backup-client
 | 
			
		||||
 | 
			
		||||
 | 
			
		||||
.. note:: The client-only repository should be useable by most recent Debian
 | 
			
		||||
   and Ubuntu derivatives.
 | 
			
		||||
.. note:: The client-only repository should be usable by most recent Debian and
 | 
			
		||||
   Ubuntu derivatives.
 | 
			
		||||
 | 
			
		||||
 | 
			
		||||
@ -76,7 +76,7 @@ Main Features
 | 
			
		||||
:Open Source: No secrets. Proxmox Backup Server is free and open-source
 | 
			
		||||
   software. The source code is licensed under AGPL, v3.
 | 
			
		||||
 | 
			
		||||
:No Limits: Proxmox Backup Server has no artifical limits for backup storage or
 | 
			
		||||
:No Limits: Proxmox Backup Server has no artificial limits for backup storage or
 | 
			
		||||
   backup-clients.
 | 
			
		||||
 | 
			
		||||
:Enterprise Support: Proxmox Server Solutions GmbH offers enterprise support in
 | 
			
		||||
 | 
			
		||||
@ -148,7 +148,7 @@ are checked again. The interface for creating verify jobs can be found under the
 | 
			
		||||
**Verify Jobs** tab of the datastore.
 | 
			
		||||
 | 
			
		||||
.. Note:: It is recommended that you reverify all backups at least monthly, even
 | 
			
		||||
  if a previous verification was successful. This is becuase physical drives
 | 
			
		||||
  if a previous verification was successful. This is because physical drives
 | 
			
		||||
  are susceptible to damage over time, which can cause an old, working backup
 | 
			
		||||
  to become corrupted in a process known as `bit rot/data degradation
 | 
			
		||||
  <https://en.wikipedia.org/wiki/Data_degradation>`_. It is good practice to
 | 
			
		||||
 | 
			
		||||
@ -260,7 +260,7 @@ It's worth noting that some of the smaller tape libraries don't have
 | 
			
		||||
such slots. While they have something called a "Mail Slot", that slot
 | 
			
		||||
is just a way to grab the tape from the gripper. They are unable
 | 
			
		||||
to hold media while the robot does other things. They also do not
 | 
			
		||||
expose that "Mail Slot" over the SCSI interface, so you wont see them in
 | 
			
		||||
expose that "Mail Slot" over the SCSI interface, so you won't see them in
 | 
			
		||||
the status output.
 | 
			
		||||
 | 
			
		||||
As a workaround, you can mark some of the normal slots as export
 | 
			
		||||
 | 
			
		||||
@ -100,7 +100,7 @@ can be encrypted, and they are handled in a slightly different manner than
 | 
			
		||||
normal chunks.
 | 
			
		||||
 | 
			
		||||
The hashes of encrypted chunks are calculated not with the actual (encrypted)
 | 
			
		||||
chunk content, but with the plaintext content concatenated with the encryption
 | 
			
		||||
chunk content, but with the plain-text content concatenated with the encryption
 | 
			
		||||
key. This way, two chunks of the same data encrypted with different keys
 | 
			
		||||
generate two different checksums and no collisions occur for multiple
 | 
			
		||||
encryption keys.
 | 
			
		||||
@ -138,7 +138,7 @@ will see that the probability of a collision in that scenario is:
 | 
			
		||||
 | 
			
		||||
For context, in a lottery game of guessing 6 out of 45, the chance to correctly
 | 
			
		||||
guess all 6 numbers is only :math:`1.2277 * 10^{-7}`, that means the chance of
 | 
			
		||||
collission is about the same as winning 13 such lotto games *in a row*.
 | 
			
		||||
a collision is about the same as winning 13 such lotto games *in a row*.
 | 
			
		||||
 | 
			
		||||
In conclusion, it is extremely unlikely that such a collision would occur by
 | 
			
		||||
accident in a normal datastore.
 | 
			
		||||
 | 
			
		||||
		Reference in New Issue
	
	Block a user