Block #400,673

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/12/2014, 6:27:32 AM · Difficulty 10.4288 · 6,406,897 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e9600c4923d4f7588cfa39bdfb3e6b50af83514bbf05a536abafa437fb26e8e8

Height

#400,673

Difficulty

10.428787

Transactions

1

Size

970 B

Version

2

Bits

0a6dc4fe

Nonce

35,069

Timestamp

2/12/2014, 6:27:32 AM

Confirmations

6,406,897

Merkle Root

7918345692176f92e71fdcbcf9451002af7248cf3650e0fbc7cf30cc22eb3504
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.866 × 10⁹⁶(97-digit number)
48668763511052175375…95714496695681008001
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.866 × 10⁹⁶(97-digit number)
48668763511052175375…95714496695681008001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.733 × 10⁹⁶(97-digit number)
97337527022104350750…91428993391362016001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.946 × 10⁹⁷(98-digit number)
19467505404420870150…82857986782724032001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.893 × 10⁹⁷(98-digit number)
38935010808841740300…65715973565448064001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.787 × 10⁹⁷(98-digit number)
77870021617683480600…31431947130896128001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.557 × 10⁹⁸(99-digit number)
15574004323536696120…62863894261792256001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.114 × 10⁹⁸(99-digit number)
31148008647073392240…25727788523584512001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.229 × 10⁹⁸(99-digit number)
62296017294146784480…51455577047169024001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.245 × 10⁹⁹(100-digit number)
12459203458829356896…02911154094338048001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.491 × 10⁹⁹(100-digit number)
24918406917658713792…05822308188676096001
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,704,590 XPM·at block #6,807,569 · 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