aboutsummaryrefslogtreecommitdiffstats
path: root/README.rst
blob: 7388a63fff27090059d918e22310b4ff7568f51f (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
WOTMATE
-------

This is an attempt to reimplement the defunct PGP pathfinder without
needing anything other than your own keyring. This is very much a work
in progress.

Prerequisite:
    ./make-sqlitedb.py

Currently, the following tools are available:

graph-paths.py
~~~~~~~~~~~~~~
Draws the shortest path between each key you have personally signed and
the target key. For simpler setups, it exactly mirrors the web of trust,
but the resulting graph is not necessarily one-to-one (because you can
assign ownertrust to a key you did not directly sign).

Example usage:

    ./graph-paths.py --fromkey torvalds jeyu

.. image:: https://raw.githubusercontent.com/mricon/wotmate/master/examples/torvalds-to-jeyu.png
   :alt: Example graph produced
   :width: 100%
   :align: center


graph-to-full.py
~~~~~~~~~~~~~~~~
Very similar, but finds shortest paths to each fully-trusted key in your
keyring. Handy for open-source projects where someone maintains a "web
of trust."

Example usage:

    ./graph-to-full.py jeyu

.. image:: https://raw.githubusercontent.com/mricon/wotmate/master/examples/full-to-jeyu.png
   :alt: Example graph produced
   :width: 100%
   :align: center