Block #711,013

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/7/2014, 2:05:42 PM · Difficulty 10.9562 · 6,095,826 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a14304978f66479a4fc1b0c431d2daddf1cd7f9c34587c219462dbb1d083e636

Height

#711,013

Difficulty

10.956192

Transactions

3

Size

658 B

Version

2

Bits

0af4c905

Nonce

2,595,089,960

Timestamp

9/7/2014, 2:05:42 PM

Confirmations

6,095,826

Merkle Root

89020d1ac9e5a8b38c862cf365f1bf6d16711253fa0c676e789d243dd556ed13
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.

1.084 × 10⁹⁷(98-digit number)
10843758259992023216…88333966728340122881
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
1.084 × 10⁹⁷(98-digit number)
10843758259992023216…88333966728340122881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.168 × 10⁹⁷(98-digit number)
21687516519984046432…76667933456680245761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.337 × 10⁹⁷(98-digit number)
43375033039968092865…53335866913360491521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.675 × 10⁹⁷(98-digit number)
86750066079936185731…06671733826720983041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.735 × 10⁹⁸(99-digit number)
17350013215987237146…13343467653441966081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.470 × 10⁹⁸(99-digit number)
34700026431974474292…26686935306883932161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.940 × 10⁹⁸(99-digit number)
69400052863948948585…53373870613767864321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.388 × 10⁹⁹(100-digit number)
13880010572789789717…06747741227535728641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.776 × 10⁹⁹(100-digit number)
27760021145579579434…13495482455071457281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.552 × 10⁹⁹(100-digit number)
55520042291159158868…26990964910142914561
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,698,815 XPM·at block #6,806,838 · 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.

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