Block #2,455,674

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/3/2018, 12:01:42 PM · Difficulty 10.9531 · 4,387,507 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3dde943f8e1f4f07e03a60d59c4667f00f7baa2fc6cda75f39795cc68843d945

Height

#2,455,674

Difficulty

10.953050

Transactions

2

Size

2.73 KB

Version

2

Bits

0af3fb1c

Nonce

1,393,343,946

Timestamp

1/3/2018, 12:01:42 PM

Confirmations

4,387,507

Merkle Root

3c37e9043b98eadeddefcf7fb08dba11ea24df382ec08a37f4e632b993dc9a7f
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.

9.089 × 10⁹³(94-digit number)
90898105381739090233…46531516131276320921
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.089 × 10⁹³(94-digit number)
90898105381739090233…46531516131276320921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.817 × 10⁹⁴(95-digit number)
18179621076347818046…93063032262552641841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.635 × 10⁹⁴(95-digit number)
36359242152695636093…86126064525105283681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.271 × 10⁹⁴(95-digit number)
72718484305391272186…72252129050210567361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.454 × 10⁹⁵(96-digit number)
14543696861078254437…44504258100421134721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.908 × 10⁹⁵(96-digit number)
29087393722156508874…89008516200842269441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.817 × 10⁹⁵(96-digit number)
58174787444313017749…78017032401684538881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.163 × 10⁹⁶(97-digit number)
11634957488862603549…56034064803369077761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.326 × 10⁹⁶(97-digit number)
23269914977725207099…12068129606738155521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.653 × 10⁹⁶(97-digit number)
46539829955450414199…24136259213476311041
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,989,816 XPM·at block #6,843,180 · 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