Block #541,263

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/13/2014, 10:51:02 AM · Difficulty 10.9384 · 6,275,746 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d2dca19cb68e69104044465f9d6af3d2acce81b6a1365f06973061e0841cd582

Height

#541,263

Difficulty

10.938440

Transactions

6

Size

1.31 KB

Version

2

Bits

0af03d9b

Nonce

55,076,268

Timestamp

5/13/2014, 10:51:02 AM

Confirmations

6,275,746

Merkle Root

c265f587615cfcbe38cf24c740054ae786de2fb49fd951a3d43d123c305a6a47
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.

5.905 × 10⁹⁹(100-digit number)
59054058179965054368…17689271628963650559
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
5.905 × 10⁹⁹(100-digit number)
59054058179965054368…17689271628963650559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.181 × 10¹⁰⁰(101-digit number)
11810811635993010873…35378543257927301119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.362 × 10¹⁰⁰(101-digit number)
23621623271986021747…70757086515854602239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.724 × 10¹⁰⁰(101-digit number)
47243246543972043494…41514173031709204479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.448 × 10¹⁰⁰(101-digit number)
94486493087944086989…83028346063418408959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.889 × 10¹⁰¹(102-digit number)
18897298617588817397…66056692126836817919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.779 × 10¹⁰¹(102-digit number)
37794597235177634795…32113384253673635839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.558 × 10¹⁰¹(102-digit number)
75589194470355269591…64226768507347271679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.511 × 10¹⁰²(103-digit number)
15117838894071053918…28453537014694543359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.023 × 10¹⁰²(103-digit number)
30235677788142107836…56907074029389086719
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 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
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 1CC formula:

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