Block #470,413

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/1/2014, 9:21:57 PM · Difficulty 10.4331 · 6,355,701 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d19dcc467dfac5f6d026db2508b5f661ef7ba6e58e13c21fa5d6af958c1026a2

Height

#470,413

Difficulty

10.433051

Transactions

6

Size

1.45 KB

Version

2

Bits

0a6edc6e

Nonce

307,181

Timestamp

4/1/2014, 9:21:57 PM

Confirmations

6,355,701

Merkle Root

a377d06d42f55c541a262ba3785b598bebc71e10273adaf1a0395f9bb355f8fc
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.

4.525 × 10⁹⁶(97-digit number)
45251183218746462373…37103148858404531201
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
4.525 × 10⁹⁶(97-digit number)
45251183218746462373…37103148858404531201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.050 × 10⁹⁶(97-digit number)
90502366437492924747…74206297716809062401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.810 × 10⁹⁷(98-digit number)
18100473287498584949…48412595433618124801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.620 × 10⁹⁷(98-digit number)
36200946574997169899…96825190867236249601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.240 × 10⁹⁷(98-digit number)
72401893149994339798…93650381734472499201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.448 × 10⁹⁸(99-digit number)
14480378629998867959…87300763468944998401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.896 × 10⁹⁸(99-digit number)
28960757259997735919…74601526937889996801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.792 × 10⁹⁸(99-digit number)
57921514519995471838…49203053875779993601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.158 × 10⁹⁹(100-digit number)
11584302903999094367…98406107751559987201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.316 × 10⁹⁹(100-digit number)
23168605807998188735…96812215503119974401
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,853,037 XPM·at block #6,826,113 · 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