Block #534,702

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/10/2014, 11:49:15 AM · Difficulty 10.9026 · 6,272,045 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b26a41d2e60b9db518518e9f97b27279f64796c96ffcb7d32b8502efce093bf1

Height

#534,702

Difficulty

10.902612

Transactions

5

Size

1.71 KB

Version

2

Bits

0ae7118e

Nonce

1,272,086,924

Timestamp

5/10/2014, 11:49:15 AM

Confirmations

6,272,045

Merkle Root

bbe877dfcda1a7c454815f2b7752ab95d0f30a4482fb31f3978d96db6d14b9eb
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.528 × 10⁹⁰(91-digit number)
25281694728036989466…70404945675656730741
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.528 × 10⁹⁰(91-digit number)
25281694728036989466…70404945675656730741
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.056 × 10⁹⁰(91-digit number)
50563389456073978932…40809891351313461481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.011 × 10⁹¹(92-digit number)
10112677891214795786…81619782702626922961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.022 × 10⁹¹(92-digit number)
20225355782429591572…63239565405253845921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.045 × 10⁹¹(92-digit number)
40450711564859183145…26479130810507691841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.090 × 10⁹¹(92-digit number)
80901423129718366291…52958261621015383681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.618 × 10⁹²(93-digit number)
16180284625943673258…05916523242030767361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.236 × 10⁹²(93-digit number)
32360569251887346516…11833046484061534721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.472 × 10⁹²(93-digit number)
64721138503774693033…23666092968123069441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.294 × 10⁹³(94-digit number)
12944227700754938606…47332185936246138881
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,074 XPM·at block #6,806,746 · 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