Block #467,415

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/30/2014, 6:46:41 PM · Difficulty 10.4353 · 6,341,597 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
19d4ad8a0240980ec41ce7d34f9204af6bc7b14cf5aa979d21ca314a5eed898a

Height

#467,415

Difficulty

10.435298

Transactions

3

Size

1.56 KB

Version

2

Bits

0a6f6fb8

Nonce

69,106

Timestamp

3/30/2014, 6:46:41 PM

Confirmations

6,341,597

Merkle Root

4760556837422ee3a42aa78e22955d7061db2c37d928433d783fe0d50ff3980c
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.848 × 10¹⁰⁰(101-digit number)
58482189812149700101…94413581874217574399
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.848 × 10¹⁰⁰(101-digit number)
58482189812149700101…94413581874217574399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.169 × 10¹⁰¹(102-digit number)
11696437962429940020…88827163748435148799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.339 × 10¹⁰¹(102-digit number)
23392875924859880040…77654327496870297599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.678 × 10¹⁰¹(102-digit number)
46785751849719760081…55308654993740595199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.357 × 10¹⁰¹(102-digit number)
93571503699439520162…10617309987481190399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.871 × 10¹⁰²(103-digit number)
18714300739887904032…21234619974962380799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.742 × 10¹⁰²(103-digit number)
37428601479775808065…42469239949924761599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.485 × 10¹⁰²(103-digit number)
74857202959551616130…84938479899849523199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.497 × 10¹⁰³(104-digit number)
14971440591910323226…69876959799699046399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.994 × 10¹⁰³(104-digit number)
29942881183820646452…39753919599398092799
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,716,157 XPM·at block #6,809,011 · 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