Block #470,741

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/2/2014, 3:29:31 AM · Difficulty 10.4288 · 6,339,639 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b88c53a43df9b37f0b29055d7450364acb511d7873d299ebca5c08d8c24b1be5

Height

#470,741

Difficulty

10.428756

Transactions

2

Size

1.28 KB

Version

2

Bits

0a6dc2f8

Nonce

366,173

Timestamp

4/2/2014, 3:29:31 AM

Confirmations

6,339,639

Merkle Root

a473c7404c4cabbce0322ea668428c9a73fd746d010d0eb2eb0c807a6db50bf5
Transactions (2)
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.

6.333 × 10⁹⁷(98-digit number)
63337303164736066458…62202691133058182929
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
6.333 × 10⁹⁷(98-digit number)
63337303164736066458…62202691133058182929
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.266 × 10⁹⁸(99-digit number)
12667460632947213291…24405382266116365859
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.533 × 10⁹⁸(99-digit number)
25334921265894426583…48810764532232731719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.066 × 10⁹⁸(99-digit number)
50669842531788853166…97621529064465463439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.013 × 10⁹⁹(100-digit number)
10133968506357770633…95243058128930926879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.026 × 10⁹⁹(100-digit number)
20267937012715541266…90486116257861853759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.053 × 10⁹⁹(100-digit number)
40535874025431082533…80972232515723707519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.107 × 10⁹⁹(100-digit number)
81071748050862165067…61944465031447415039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.621 × 10¹⁰⁰(101-digit number)
16214349610172433013…23888930062894830079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.242 × 10¹⁰⁰(101-digit number)
32428699220344866026…47777860125789660159
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,727,117 XPM·at block #6,810,379 · 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