Block #1,897,955

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/17/2016, 7:46:49 AM · Difficulty 10.7534 · 4,928,808 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a6aaea4c72f3542065f2fcb7c28e416e5c6c892015323a0a03c5d73f5ad46cc9

Height

#1,897,955

Difficulty

10.753394

Transactions

2

Size

1.28 KB

Version

2

Bits

0ac0de6f

Nonce

535,588,875

Timestamp

12/17/2016, 7:46:49 AM

Confirmations

4,928,808

Merkle Root

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

3.418 × 10⁹³(94-digit number)
34181582073670616356…77697536567048410981
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
3.418 × 10⁹³(94-digit number)
34181582073670616356…77697536567048410981
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.836 × 10⁹³(94-digit number)
68363164147341232713…55395073134096821961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.367 × 10⁹⁴(95-digit number)
13672632829468246542…10790146268193643921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.734 × 10⁹⁴(95-digit number)
27345265658936493085…21580292536387287841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.469 × 10⁹⁴(95-digit number)
54690531317872986170…43160585072774575681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.093 × 10⁹⁵(96-digit number)
10938106263574597234…86321170145549151361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.187 × 10⁹⁵(96-digit number)
21876212527149194468…72642340291098302721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.375 × 10⁹⁵(96-digit number)
43752425054298388936…45284680582196605441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.750 × 10⁹⁵(96-digit number)
87504850108596777873…90569361164393210881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.750 × 10⁹⁶(97-digit number)
17500970021719355574…81138722328786421761
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,858,264 XPM·at block #6,826,762 · 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