How does this system handle problems with the lower chains after they have
been "locked-in"?
The rule is that if a block in the child chain is pointed to by its parent,
then it effectively has infinite POW?
The point of the system is that a node monitoring the parent chain only has
to watch the h
Github has a nice feature that lets you link to a specific line of code:
https://github.com/bitcoin/bitcoin/blob/master/src/main.cpp#L3549
Is it the line you're referring to? It just flags the peer as at that point
we know we don't have more addresses to learn from it (peers send 1000
addrs). The
Thank you for all the explanations on how to use regtest to reproduce
the example scenarios.
It seems like a private mode wouldn't be particularly helpful for
testing so I won't create a pull request and will just work on the
private chains separately from bitcoind.
Going back to chainparam modes
On Thu, Apr 17, 2014 at 12:09 PM, Jorge Timón wrote:
> So it seems a new mode only makes sense if the -private mode makes
> sense, which in turn only makes sense to include in bitcoind if it's
> useful enough for the network attack simulations, which remains the
> open question.
>
Unless I misun
Not necessarily. Running a private server involves listening to the p2p
network for incoming transactions, performing validation on receipt and
organizing a mempool, performing transaction selection, and relaying
blocks to auditors - none of which is tested in a reindex.
A reindex would give you a
On 4/17/14, Mike Hearn wrote:
>>
>> 2) If I wanted to measure validation performance, to get the number of
>> peak tps that could be processed without taking block sides or network
>> latency into account, how would I do that? Has anybody tried this
>> before?
>
>
> You can just reindex/replay the
>
> 2) If I wanted to measure validation performance, to get the number of
> peak tps that could be processed without taking block sides or network
> latency into account, how would I do that? Has anybody tried this
> before?
You can just reindex/replay the chain. It's been done many times.
-
On 4/17/14, Gavin Andresen wrote:
> How is this different from just running in -regtest mode and asking the
> nodes to generate a block after 1 or 2 seconds?
There's no difference, the -timedtest mode does exactly that. But
automatically instead of having to manually ask for a new block every
sec
"So my question to the community is, how invasive is this to bitcoin's
source code?"
I'd say not very considering you have regression testing mode.
On Thu, Apr 17, 2014 at 8:25 AM, Jorge Timón wrote:
> I'm implementing a new testing mode that produces blocks
> periodically. You can get what I
How is this different from just running in -regtest mode and asking the
nodes to generate a block after 1 or 2 seconds?
--
--
Gavin Andresen
--
Learn Graph Databases - Download FREE O'Reilly Book
"Graph Databases" is the
I'm implementing a new testing mode that produces blocks
periodically. You can get what I have so far here:
https://github.com/jtimon/bitcoin/tree/timed
It depends on pull request #3824 with some improvements on
CChainParams, but after that the changes required to add this new
mode are very small
Hi, in main.cpp, ProcessMessage(), the line:
if (vAddr.size() < 1000) that appears at about line 3290
(not sure which, as I have made changes.)
What is the purpose of this line?
vAddr.size() was already checked at about line 3240, and if it was >
1000, the function has returned.
Is pfrom->fGetAddr
On Thu, Apr 17, 2014 at 12:06 AM, Gregory Maxwell wrote:
> Bringing the thread back on-topic:
>
Thanks.
> On Wed, Apr 16, 2014 at 1:14 AM, Wladimir wrote:
> > Hello,
> > Today I noticed that even my bank is warning people to not do internet
> > banking with Windows XP.
> > If it is no longer
On Wed, Apr 16, 2014 at 10:14 PM, Ben Carroll wrote:
While forcefully dropping XP support would seem like a waste of time, and
> somewhat arbitrary. If windows builds just stops working for XP, it just
> stops working, however I don't foresee that happening. I would make a
> reasonable guess th
14 matches
Mail list logo
