On Fri, Sep 14, 2012 at 3:57 AM, Scott Howard wrote:
> This idea is from a Debian user [1].
>
> What do you think of moving the > 2 GB db to $HOME/.cache/bitcoin and
> leaving the wallet and other config files in $HOME/.bitcoin? This is
> so backups can skip the .cache directory and the proposal
Linux typically uses the FHS, which various distros often bastardize:
http://www.linuxfoundation.org/collaborate/workgroups/lsb/fhs
BSD typically uses the traditional hierarchy, for which admins
often add /home and /opt:
http://svnweb.freebsd.org/base/head/share/man/man7/hier.7?revision=HEAD&vi
> I like this idea, although I would say the blockchain should go in
> /var/lib/bitcoin
> by default, right? I'm just a longtime LInux guy, not a formal sysadmin,
> though.
Further, bitcoin doesn't allow easy separation of the files without
detachdb (off by default), nor does it supply a user ag
I like this idea, although I would say the blockchain should go in
/var/lib/bitcoin by default, right? I'm just a longtime LInux guy, not a
formal sysadmin, though.
Peter
On Fri, Sep 14, 2012 at 11:15 AM, grarpamp wrote:
> I mentioned this somewhere a while ago.
> It is enough of a sysadmin pro
I mentioned this somewhere a while ago.
It is enough of a sysadmin problem to warrant a feature ticket.
Open one on github for it.
XDGBDS is not canon. So don't hardcode said paths.
All paths should be specifiable in bitcoin the config file, whose
location should itself be specifiable on the comman
This idea is from a Debian user [1].
What do you think of moving the > 2 GB db to $HOME/.cache/bitcoin and
leaving the wallet and other config files in $HOME/.bitcoin? This is
so backups can skip the .cache directory and the proposal follows the
freedesktop.org XDG Base Directory Specification [2]
On 13 Sep 2012, at 19:59, Pieter Wuille wrote:
> You want to parallellize block downloads, while at the same time preventing
> re-download of transactions that are already known.
> To do so, a requesting node would first request (for example) the 8 level-3
> hashes, then start 8 parallel threa
On Thu, Sep 13, 2012 at 06:49:49PM +0100, Matthew Mitchell wrote:
> A merkle tree root is found by hashing the two children together and those
> children are found the same way until you get to the greatest level down the
> tree. This means you can validate children as being correct as long as th
On 13 Sep 2012, at 16:51, Gregory Maxwell wrote:
> I thoroughly understand the value of tree hashes. That wasn't what I
> was asking about.
>
> If you're validating a block you need all the transactions, once you
> have them or their hashes you can build the tree without transferring
> more, e.
On 13 Sep 2012, at 16:16, Gregory Maxwell wrote:
> Sorry, I'm still not seeing what the value is. How is the tree level
> useful to anyone? If you did want to get only parts of the
> transaction list, why not just ranges from the lowest level?
Obtaining a particular tree level allows you to v
On Thu, Sep 13, 2012 at 10:05 AM, Matthew Mitchell
wrote:
> @Gregory
>
>> But you only need to request the transactions you don't have. Most of
>> time you should already have almost all of the transactions.
>
> Yes, my proposal allows you to do this. You skip out transactions your
> already hav
On 13 Sep 2012, at 09:42, Mike Hearn wrote:
> For what it's worth I disagree with Gregory on nearly all these
> points, so don't take it as some kind of consensus from the Bitcoin
> community ;)
>
> Matts change is reasonable but I think we all agree it has minimal
> impact at the moment relativ
For what it's worth I disagree with Gregory on nearly all these
points, so don't take it as some kind of consensus from the Bitcoin
community ;)
Matts change is reasonable but I think we all agree it has minimal
impact at the moment relative to other things, so something even more
complex than tha
13 matches
Mail list logo
