Block #534,471

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/10/2014, 8:30:44 AM · Difficulty 10.9020 · 6,292,758 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f0b3f88e683cadd19b0e31513dd155bf4816e1e0f16400f1c59c40cf30bc6d7a

Height

#534,471

Difficulty

10.902005

Transactions

6

Size

1.49 KB

Version

2

Bits

0ae6e9c9

Nonce

117,447,127

Timestamp

5/10/2014, 8:30:44 AM

Confirmations

6,292,758

Merkle Root

62dfd4f880f766a6a8d02e549d35afef0fa03b53b22efc83f2564f81fc6c86d8
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.782 × 10⁹⁶(97-digit number)
17821077407375832192…10020787878560082561
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.782 × 10⁹⁶(97-digit number)
17821077407375832192…10020787878560082561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.564 × 10⁹⁶(97-digit number)
35642154814751664384…20041575757120165121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.128 × 10⁹⁶(97-digit number)
71284309629503328768…40083151514240330241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.425 × 10⁹⁷(98-digit number)
14256861925900665753…80166303028480660481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.851 × 10⁹⁷(98-digit number)
28513723851801331507…60332606056961320961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.702 × 10⁹⁷(98-digit number)
57027447703602663014…20665212113922641921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.140 × 10⁹⁸(99-digit number)
11405489540720532602…41330424227845283841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.281 × 10⁹⁸(99-digit number)
22810979081441065205…82660848455690567681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.562 × 10⁹⁸(99-digit number)
45621958162882130411…65321696911381135361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.124 × 10⁹⁸(99-digit number)
91243916325764260823…30643393822762270721
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,861,931 XPM·at block #6,827,228 · 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