(to avoid reader-confusions: This should be a ONE way replication of WHOLE files. It will NOT detect bytewise changes and it will NOT merge changes from both sides.)
The idea behind it is:
1) create a filelist from Point A
2) create a filelist from Point B
3) Use "diff" to find the changes
- a) deleted
b) modified
c) added
...I've thought about using checksum-lists, but I found out that it was sufficient using the plain directory listing which saves a lot of processing time.
This replication is running in an environment where so many files are in ONE folder that ls-ing the contents gives a "bash: /bin/ls: Argument list too long", so you can imagine HOW many files there are...
Of course, going for checksums would be the most reliable way.