A combination of the rsync algorithm and content-addressable storage. An efficient way to store and retrieve multiple related versions of large file systems or directory trees. An efficient way to deliver and update OS, VM, IoT and container images over the Internet in an HTTP and CDN friendly way. Let's take a large linear data stream, split it into variable-sized chunks (the size of each being a function of the chunk's contents), and store these chunks in individual, compressed files in some directory, each file named after a strong hash value of its contents, so that the hash value may be used to as key for retrieving the full chunk data. Let's call this directory a "chunk store". At the same time, generate a "chunk index" file that lists these chunk hash values plus their respective chunk sizes in a simple linear array. The chunking algorithm is supposed to create variable, but similarly sized chunks from the data stream.

Features

  • Operations on directory trees
  • Operations on blob index files
  • Operations on archives
  • Operations involving ssh remoting
  • Operations involving the web
  • Encoding and decoding

Project Samples

Project Activity

See All Activity >

License

MIT License

Follow casync

casync Web Site

You Might Also Like
Our Free Plans just got better! | Auth0 by Okta Icon
Our Free Plans just got better! | Auth0 by Okta

With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your secuirty. Auth0 now, thank yourself later.
Try free now
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of casync!

Additional Project Details

Programming Language

C

Related Categories

C HTTP Servers, C HTTP Clients

Registered

2023-05-12