Block #471,725

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/2/2014, 6:57:43 PM · Difficulty 10.4350 · 6,353,862 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c9d7b77e23a99318d60cf7f3c93c97f6b2a3ea809a2e9068a0a0d0de88d6b9bd

Height

#471,725

Difficulty

10.435034

Transactions

1

Size

1004 B

Version

2

Bits

0a6f5e5e

Nonce

3,743

Timestamp

4/2/2014, 6:57:43 PM

Confirmations

6,353,862

Merkle Root

1435ba0275984e79e54ee34b88f5880efa413cc9950fe5ea3b77d2354cdcf9d5
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.

9.516 × 10⁹⁶(97-digit number)
95169564235328220388…12689751070375960951
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
9.516 × 10⁹⁶(97-digit number)
95169564235328220388…12689751070375960951
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.903 × 10⁹⁷(98-digit number)
19033912847065644077…25379502140751921901
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.806 × 10⁹⁷(98-digit number)
38067825694131288155…50759004281503843801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.613 × 10⁹⁷(98-digit number)
76135651388262576310…01518008563007687601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.522 × 10⁹⁸(99-digit number)
15227130277652515262…03036017126015375201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.045 × 10⁹⁸(99-digit number)
30454260555305030524…06072034252030750401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.090 × 10⁹⁸(99-digit number)
60908521110610061048…12144068504061500801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.218 × 10⁹⁹(100-digit number)
12181704222122012209…24288137008123001601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.436 × 10⁹⁹(100-digit number)
24363408444244024419…48576274016246003201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.872 × 10⁹⁹(100-digit number)
48726816888488048838…97152548032492006401
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,848,795 XPM·at block #6,825,586 · 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