Block #473,840

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/4/2014, 5:00:55 AM · Difficulty 10.4451 · 6,357,369 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7fc323883f2954befcfb282e9555733208c23bda6b450d7d91152ee9f941478d

Height

#473,840

Difficulty

10.445100

Transactions

7

Size

2.97 KB

Version

2

Bits

0a71f214

Nonce

34,151

Timestamp

4/4/2014, 5:00:55 AM

Confirmations

6,357,369

Merkle Root

57d136c70eeecd8f0dce899945f693e6dc16405b4eb052e5f133ccb47039414f
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.

3.766 × 10⁹⁷(98-digit number)
37666246385588953180…27810394149773194739
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
3.766 × 10⁹⁷(98-digit number)
37666246385588953180…27810394149773194739
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.533 × 10⁹⁷(98-digit number)
75332492771177906360…55620788299546389479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.506 × 10⁹⁸(99-digit number)
15066498554235581272…11241576599092778959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.013 × 10⁹⁸(99-digit number)
30132997108471162544…22483153198185557919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.026 × 10⁹⁸(99-digit number)
60265994216942325088…44966306396371115839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.205 × 10⁹⁹(100-digit number)
12053198843388465017…89932612792742231679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.410 × 10⁹⁹(100-digit number)
24106397686776930035…79865225585484463359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.821 × 10⁹⁹(100-digit number)
48212795373553860070…59730451170968926719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.642 × 10⁹⁹(100-digit number)
96425590747107720141…19460902341937853439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.928 × 10¹⁰⁰(101-digit number)
19285118149421544028…38921804683875706879
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,893,820 XPM·at block #6,831,208 · 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