Block #555,978

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/21/2014, 10:39:03 PM · Difficulty 10.9629 · 6,256,768 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1bff4d76098eaf9263f3c4d567881828d241594c3a26602e9155e830374ad877

Height

#555,978

Difficulty

10.962857

Transactions

6

Size

1.88 KB

Version

2

Bits

0af67dc9

Nonce

564,870,953

Timestamp

5/21/2014, 10:39:03 PM

Confirmations

6,256,768

Merkle Root

ea4a59679847c82cf7831748862f802814e4e91ed9c2f504d77defded0c26434
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.470 × 10⁹⁹(100-digit number)
84702654430910405973…02679362267768862719
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.470 × 10⁹⁹(100-digit number)
84702654430910405973…02679362267768862719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.694 × 10¹⁰⁰(101-digit number)
16940530886182081194…05358724535537725439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.388 × 10¹⁰⁰(101-digit number)
33881061772364162389…10717449071075450879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.776 × 10¹⁰⁰(101-digit number)
67762123544728324779…21434898142150901759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.355 × 10¹⁰¹(102-digit number)
13552424708945664955…42869796284301803519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.710 × 10¹⁰¹(102-digit number)
27104849417891329911…85739592568603607039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.420 × 10¹⁰¹(102-digit number)
54209698835782659823…71479185137207214079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.084 × 10¹⁰²(103-digit number)
10841939767156531964…42958370274414428159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.168 × 10¹⁰²(103-digit number)
21683879534313063929…85916740548828856319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.336 × 10¹⁰²(103-digit number)
43367759068626127858…71833481097657712639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.673 × 10¹⁰²(103-digit number)
86735518137252255717…43666962195315425279
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,746,011 XPM·at block #6,812,745 · 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