rshasum - recursive shasum.


version 0.8.0


    rshasum --digest=SHA-256
    rshasum --digest=SHA-256 --skip='\.sw[a-zA-Z]*\z' --skip='~\z'
    rshasum --digest=SHA-256 --start-path='/home/random-j-user'


A recursive digest calculator that prints digests for all files in a directory tree, as well as a total, summary, digest of the output.



The digest algorithm to use. Required. E.g:



Perl 5 regexes which when matched against the relative paths, skip and prune them.

Can be specified more than one time.


The start path for the traversal. Defaults to "." (the current working directory).

SEE ALSO - "recursive hash". Seems to emit the tree in an unpredictable, not-always-sorted, order. - also on CPAN. Dumps metadata and supports caching the digests. - written in golang, but slurps entire files into memory (see ).



The following websites have more information about this module, and may be of help to you. As always, in addition to those websites please use your favorite search engine to discover more resources.

Bugs / Feature Requests

Please report any bugs or feature requests by email to bug-app-rshasum at, or through the web interface at You will be automatically notified of any progress on the request by the system.

Source Code

The code is open to the world, and available for you to hack on. Please feel free to browse it and play with it, or whatever. If you want to contribute patches, please send me a diff or prod me to pull from your repository :)

  git clone


Shlomi Fish <>


Please report any bugs or feature requests on the bugtracker website

When submitting a bug or request, please include a test-file or a patch to an existing test-file that illustrates the bug or desired feature.


This software is Copyright (c) 2019 by Shlomi Fish.

This is free software, licensed under:

  The MIT (X11) License