Block #571,689

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/1/2014, 3:31:30 PM · Difficulty 10.9655 · 6,254,543 confirmations

2CC
Cunningham Chain of the Second Kind

A sequence where each prime is double the previous prime minus one.

Block Header
Block Hash
36006ce7fd587710499f31ffe8383bc3ca102e78a0759286e8c7d7e40f19658a

Height

#571,689

Difficulty

10.965465

Transactions

3

Size

659 B

Version

2

Bits

0af728b0

Nonce

56,565,421

Timestamp

6/1/2014, 3:31:30 PM

Confirmations

6,254,543

Merkle Root

95a1315f303b396cc3b54caf6a094f571a4e50588cc43a62c052e0659650a457
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

2.245 × 10⁹⁹(100-digit number)
22454604448017375670…19068178743851386881
Discovered Prime Numbers
p_k = 2^k × origin + 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin + 1
2.245 × 10⁹⁹(100-digit number)
22454604448017375670…19068178743851386881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.490 × 10⁹⁹(100-digit number)
44909208896034751340…38136357487702773761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.981 × 10⁹⁹(100-digit number)
89818417792069502681…76272714975405547521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.796 × 10¹⁰⁰(101-digit number)
17963683558413900536…52545429950811095041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.592 × 10¹⁰⁰(101-digit number)
35927367116827801072…05090859901622190081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.185 × 10¹⁰⁰(101-digit number)
71854734233655602145…10181719803244380161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.437 × 10¹⁰¹(102-digit number)
14370946846731120429…20363439606488760321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.874 × 10¹⁰¹(102-digit number)
28741893693462240858…40726879212977520641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.748 × 10¹⁰¹(102-digit number)
57483787386924481716…81453758425955041281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.149 × 10¹⁰²(103-digit number)
11496757477384896343…62907516851910082561
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the Second Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★☆☆☆
Rarity
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,853,987 XPM·at block #6,826,231 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.
Privacy Policy·

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy