Block #415,416

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/22/2014, 4:24:19 PM · Difficulty 10.4060 · 6,401,407 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2f1cf0151e7914c4ed7ac8351d3a7d2cbe77622f8dc549a8bcf884dded96948e

Height

#415,416

Difficulty

10.405977

Transactions

2

Size

42.36 KB

Version

2

Bits

0a67ee22

Nonce

390

Timestamp

2/22/2014, 4:24:19 PM

Confirmations

6,401,407

Merkle Root

8df2d73370ba0edd2df5bf3e22f0b16eff2ed4baba9a059c357c6520f4184280
Transactions (2)
1 in → 1 out9.6600 XPM116 B
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.

5.827 × 10¹⁰²(103-digit number)
58272242586816565892…28219931801292588799
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
5.827 × 10¹⁰²(103-digit number)
58272242586816565892…28219931801292588799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.165 × 10¹⁰³(104-digit number)
11654448517363313178…56439863602585177599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.330 × 10¹⁰³(104-digit number)
23308897034726626356…12879727205170355199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.661 × 10¹⁰³(104-digit number)
46617794069453252713…25759454410340710399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.323 × 10¹⁰³(104-digit number)
93235588138906505427…51518908820681420799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.864 × 10¹⁰⁴(105-digit number)
18647117627781301085…03037817641362841599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.729 × 10¹⁰⁴(105-digit number)
37294235255562602171…06075635282725683199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.458 × 10¹⁰⁴(105-digit number)
74588470511125204342…12151270565451366399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.491 × 10¹⁰⁵(106-digit number)
14917694102225040868…24302541130902732799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.983 × 10¹⁰⁵(106-digit number)
29835388204450081736…48605082261805465599
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,778,623 XPM·at block #6,816,822 · 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