News: 0001605193

  ARM Give a man a fire and he's warm for a day, but set fire to him and he's warm for the rest of his life (Terry Pratchett, Jingo)

TrueNAS WebShare: ZFS-Backed, Enterprise-Grade File Sharing From The Web Browser

([Linux Storage] 6 Hours Ago TrueNAS WebShare)


For situations where Samba (SMB) or NFS usage aren't appropriate or desiring the convenience of accessing files from a web browser on any device, TrueNAS is introducing TrueNAS WebShare as an easy-to-use solution for enterprise-grade file sharing in the web browser.

In desiring a more robust solution than WebDAV or the FileBrowser app and for cases where SMB or NFS may not be too straight-forward like for mobile devices on the WAN, iXsystems developed TrueNAS WebShare.

TrueNAS WebShare lets you leverage TrueNAS' OpenZFS file-system usage, HTTPS security by default, full compatibility with NFS and SMB, and the all-around functionality of the modern Linux-based TrueNAS network attached storage platform.

WebShare at least initially is intended as a TrueNAS 26.04 Enterprise feature but it will be made available to TrueNAS Community Edition via TrueNAS Connect.

Those wanting to learn more about TrueNAS WebShare can do so via [1]TrueNAS.com .



[1] https://www.truenas.com/blog/truenas-webshare/


Lemma: All horses are the same color.
Proof (by induction):
Case n = 1: In a set with only one horse, it is obvious that all
horses in that set are the same color.
Case n = k: Suppose you have a set of k+1 horses. Pull one of these
horses out of the set, so that you have k horses. Suppose that all
of these horses are the same color. Now put back the horse that you
took out, and pull out a different one. Suppose that all of the k
horses now in the set are the same color. Then the set of k+1 horses
are all the same color. We have k true => k+1 true; therefore all
horses are the same color.
Theorem: All horses have an infinite number of legs.
Proof (by intimidation):
Everyone would agree that all horses have an even number of legs. It
is also well-known that horses have forelegs in front and two legs in
back. 4 + 2 = 6 legs, which is certainly an odd number of legs for a
horse to have! Now the only number that is both even and odd is
infinity; therefore all horses have an infinite number of legs.
However, suppose that there is a horse somewhere that does not have an
infinite number of legs. Well, that would be a horse of a different
color; and by the Lemma, it doesn't exist.