Block #429,247

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/4/2014, 3:49:39 PM · Difficulty 10.3467 · 6,386,608 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
17c1997f95e0b7b75c5799f8b0d236b60f10153158f2ede259972a58131a9845

Height

#429,247

Difficulty

10.346658

Transactions

5

Size

1.34 KB

Version

2

Bits

0a58be9b

Nonce

103,729

Timestamp

3/4/2014, 3:49:39 PM

Confirmations

6,386,608

Merkle Root

3b2454c47b8c4ef770be8aa0fb779458459f20ff04393eab9e81f8609f277d06
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.

6.392 × 10⁹²(93-digit number)
63923935931252656616…78421777990129464321
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
6.392 × 10⁹²(93-digit number)
63923935931252656616…78421777990129464321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.278 × 10⁹³(94-digit number)
12784787186250531323…56843555980258928641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.556 × 10⁹³(94-digit number)
25569574372501062646…13687111960517857281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.113 × 10⁹³(94-digit number)
51139148745002125293…27374223921035714561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.022 × 10⁹⁴(95-digit number)
10227829749000425058…54748447842071429121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.045 × 10⁹⁴(95-digit number)
20455659498000850117…09496895684142858241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.091 × 10⁹⁴(95-digit number)
40911318996001700234…18993791368285716481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.182 × 10⁹⁴(95-digit number)
81822637992003400469…37987582736571432961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.636 × 10⁹⁵(96-digit number)
16364527598400680093…75975165473142865921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.272 × 10⁹⁵(96-digit number)
32729055196801360187…51950330946285731841
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,770,951 XPM·at block #6,815,854 · 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