Block #533,287

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/9/2014, 2:55:23 PM · Difficulty 10.8994 · 6,276,359 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
28abb3b62c75ea809c84afeef3d1714f471524341360e4f1ebd3ebc0767399dc

Height

#533,287

Difficulty

10.899381

Transactions

7

Size

1.53 KB

Version

2

Bits

0ae63dce

Nonce

27,718,622

Timestamp

5/9/2014, 2:55:23 PM

Confirmations

6,276,359

Merkle Root

74ca004710d4ecdba3d8a017d70dd935e7d312fb17a3e41ef4f721e9c7f4c157
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.

7.243 × 10⁹⁹(100-digit number)
72430534138673792912…36488162823317134079
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
7.243 × 10⁹⁹(100-digit number)
72430534138673792912…36488162823317134079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.448 × 10¹⁰⁰(101-digit number)
14486106827734758582…72976325646634268159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.897 × 10¹⁰⁰(101-digit number)
28972213655469517164…45952651293268536319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.794 × 10¹⁰⁰(101-digit number)
57944427310939034329…91905302586537072639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.158 × 10¹⁰¹(102-digit number)
11588885462187806865…83810605173074145279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.317 × 10¹⁰¹(102-digit number)
23177770924375613731…67621210346148290559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.635 × 10¹⁰¹(102-digit number)
46355541848751227463…35242420692296581119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.271 × 10¹⁰¹(102-digit number)
92711083697502454927…70484841384593162239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.854 × 10¹⁰²(103-digit number)
18542216739500490985…40969682769186324479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.708 × 10¹⁰²(103-digit number)
37084433479000981971…81939365538372648959
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,721,248 XPM·at block #6,809,645 · 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