Block #2,094,859

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/30/2017, 9:54:49 PM · Difficulty 10.8718 · 4,732,374 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0f447e2a8a8cf78b29b18cb544a32271516e9d1af97bb99377401395e37972f5

Height

#2,094,859

Difficulty

10.871833

Transactions

2

Size

1.28 KB

Version

2

Bits

0adf3076

Nonce

809,176,768

Timestamp

4/30/2017, 9:54:49 PM

Confirmations

4,732,374

Merkle Root

d294e41caadf612ab18c4de33387015149f1451c82a909a9352a0e2efd6aa8e8
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.517 × 10⁹³(94-digit number)
95171628879088508670…15078380207556730241
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.517 × 10⁹³(94-digit number)
95171628879088508670…15078380207556730241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.903 × 10⁹⁴(95-digit number)
19034325775817701734…30156760415113460481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.806 × 10⁹⁴(95-digit number)
38068651551635403468…60313520830226920961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.613 × 10⁹⁴(95-digit number)
76137303103270806936…20627041660453841921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.522 × 10⁹⁵(96-digit number)
15227460620654161387…41254083320907683841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.045 × 10⁹⁵(96-digit number)
30454921241308322774…82508166641815367681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.090 × 10⁹⁵(96-digit number)
60909842482616645549…65016333283630735361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.218 × 10⁹⁶(97-digit number)
12181968496523329109…30032666567261470721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.436 × 10⁹⁶(97-digit number)
24363936993046658219…60065333134522941441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.872 × 10⁹⁶(97-digit number)
48727873986093316439…20130666269045882881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.745 × 10⁹⁶(97-digit number)
97455747972186632878…40261332538091765761
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,861,964 XPM·at block #6,827,232 · 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