Block #472,623

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/3/2014, 9:51:36 AM · Difficulty 10.4361 · 6,344,692 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ef8dab00af609d7a7819c65c96141ba719549204d85f9daf7b6fb827e9e40943

Height

#472,623

Difficulty

10.436101

Transactions

4

Size

2.18 KB

Version

2

Bits

0a6fa44a

Nonce

114,476

Timestamp

4/3/2014, 9:51:36 AM

Confirmations

6,344,692

Merkle Root

49024e7bc35c9b8d4034fbf9696356067dafbfa37682da00ff6bc2de742dfcff
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.213 × 10¹⁰²(103-digit number)
22131372326011753850…21317021811444243199
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.213 × 10¹⁰²(103-digit number)
22131372326011753850…21317021811444243199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.426 × 10¹⁰²(103-digit number)
44262744652023507700…42634043622888486399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.852 × 10¹⁰²(103-digit number)
88525489304047015400…85268087245776972799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.770 × 10¹⁰³(104-digit number)
17705097860809403080…70536174491553945599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.541 × 10¹⁰³(104-digit number)
35410195721618806160…41072348983107891199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.082 × 10¹⁰³(104-digit number)
70820391443237612320…82144697966215782399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.416 × 10¹⁰⁴(105-digit number)
14164078288647522464…64289395932431564799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.832 × 10¹⁰⁴(105-digit number)
28328156577295044928…28578791864863129599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.665 × 10¹⁰⁴(105-digit number)
56656313154590089856…57157583729726259199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.133 × 10¹⁰⁵(106-digit number)
11331262630918017971…14315167459452518399
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,782,565 XPM·at block #6,817,314 · 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