Block #539,830

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/12/2014, 9:26:46 PM · Difficulty 10.9302 · 6,274,178 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c172df06dc0de7cc6a643770e6ee0a502027a18d7718fbbdc4979cb5ba56d492

Height

#539,830

Difficulty

10.930223

Transactions

6

Size

1.77 KB

Version

2

Bits

0aee2315

Nonce

1,662,569,227

Timestamp

5/12/2014, 9:26:46 PM

Confirmations

6,274,178

Merkle Root

1a9851b2992dd54e9f04388f9b94b67690dc3bf83a9bc964db8d2cf4796ede8a
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.

3.061 × 10⁹¹(92-digit number)
30617341373009202972…64168167972733548519
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
3.061 × 10⁹¹(92-digit number)
30617341373009202972…64168167972733548519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.123 × 10⁹¹(92-digit number)
61234682746018405945…28336335945467097039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.224 × 10⁹²(93-digit number)
12246936549203681189…56672671890934194079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.449 × 10⁹²(93-digit number)
24493873098407362378…13345343781868388159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.898 × 10⁹²(93-digit number)
48987746196814724756…26690687563736776319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.797 × 10⁹²(93-digit number)
97975492393629449512…53381375127473552639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.959 × 10⁹³(94-digit number)
19595098478725889902…06762750254947105279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.919 × 10⁹³(94-digit number)
39190196957451779804…13525500509894210559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.838 × 10⁹³(94-digit number)
78380393914903559609…27051001019788421119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.567 × 10⁹⁴(95-digit number)
15676078782980711921…54102002039576842239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.135 × 10⁹⁴(95-digit number)
31352157565961423843…08204004079153684479
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 consecutive prime numbers forming a Cunningham Chain of the First 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,756,146 XPM·at block #6,814,007 · 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