Block #551,228

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/18/2014, 4:55:22 PM · Difficulty 10.9620 · 6,265,553 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8a9d1a6bba59c70ef921f389024b46ef6d8f17fdeaeec78b22628f59ced700ac

Height

#551,228

Difficulty

10.962035

Transactions

2

Size

911 B

Version

2

Bits

0af647eb

Nonce

287,565,995

Timestamp

5/18/2014, 4:55:22 PM

Confirmations

6,265,553

Merkle Root

7bcb1fdde49c189baa38b97b6f93568e02d019adfbfa04086a85f6171b5e5ab5
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.073 × 10⁹⁹(100-digit number)
20738843446588414708…56896482823786885439
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.073 × 10⁹⁹(100-digit number)
20738843446588414708…56896482823786885439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.147 × 10⁹⁹(100-digit number)
41477686893176829416…13792965647573770879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.295 × 10⁹⁹(100-digit number)
82955373786353658832…27585931295147541759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.659 × 10¹⁰⁰(101-digit number)
16591074757270731766…55171862590295083519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.318 × 10¹⁰⁰(101-digit number)
33182149514541463532…10343725180590167039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.636 × 10¹⁰⁰(101-digit number)
66364299029082927065…20687450361180334079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.327 × 10¹⁰¹(102-digit number)
13272859805816585413…41374900722360668159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.654 × 10¹⁰¹(102-digit number)
26545719611633170826…82749801444721336319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.309 × 10¹⁰¹(102-digit number)
53091439223266341652…65499602889442672639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.061 × 10¹⁰²(103-digit number)
10618287844653268330…30999205778885345279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.123 × 10¹⁰²(103-digit number)
21236575689306536661…61998411557770690559
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,778,283 XPM·at block #6,816,780 · 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