Block #566,253

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/28/2014, 7:27:27 PM · Difficulty 10.9659 · 6,267,301 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
29b6f3015520f1f8512b495db5ab912644b42b71a2b2f5a1fa5741317af4dea5

Height

#566,253

Difficulty

10.965888

Transactions

5

Size

13.05 KB

Version

2

Bits

0af74474

Nonce

238,593,597

Timestamp

5/28/2014, 7:27:27 PM

Confirmations

6,267,301

Merkle Root

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

8.142 × 10⁹⁹(100-digit number)
81429013045380514065…86777623281501439999
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
8.142 × 10⁹⁹(100-digit number)
81429013045380514065…86777623281501439999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.628 × 10¹⁰⁰(101-digit number)
16285802609076102813…73555246563002879999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.257 × 10¹⁰⁰(101-digit number)
32571605218152205626…47110493126005759999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.514 × 10¹⁰⁰(101-digit number)
65143210436304411252…94220986252011519999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.302 × 10¹⁰¹(102-digit number)
13028642087260882250…88441972504023039999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.605 × 10¹⁰¹(102-digit number)
26057284174521764500…76883945008046079999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.211 × 10¹⁰¹(102-digit number)
52114568349043529001…53767890016092159999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.042 × 10¹⁰²(103-digit number)
10422913669808705800…07535780032184319999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.084 × 10¹⁰²(103-digit number)
20845827339617411600…15071560064368639999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.169 × 10¹⁰²(103-digit number)
41691654679234823201…30143120128737279999
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,912,632 XPM·at block #6,833,553 · 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