Block #2,837,171

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/13/2018, 8:09:24 AM · Difficulty 11.7161 · 4,003,623 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f16bd5f70c02076905649747f4ac5aa25e8322f2b1c344cee09f5090328652ff

Height

#2,837,171

Difficulty

11.716130

Transactions

8

Size

2.53 KB

Version

2

Bits

0bb7544d

Nonce

1,346,439,503

Timestamp

9/13/2018, 8:09:24 AM

Confirmations

4,003,623

Merkle Root

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

1.751 × 10⁹³(94-digit number)
17516404921530606923…78689899526401436321
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
1.751 × 10⁹³(94-digit number)
17516404921530606923…78689899526401436321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.503 × 10⁹³(94-digit number)
35032809843061213846…57379799052802872641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.006 × 10⁹³(94-digit number)
70065619686122427692…14759598105605745281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.401 × 10⁹⁴(95-digit number)
14013123937224485538…29519196211211490561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.802 × 10⁹⁴(95-digit number)
28026247874448971077…59038392422422981121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.605 × 10⁹⁴(95-digit number)
56052495748897942154…18076784844845962241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.121 × 10⁹⁵(96-digit number)
11210499149779588430…36153569689691924481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.242 × 10⁹⁵(96-digit number)
22420998299559176861…72307139379383848961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.484 × 10⁹⁵(96-digit number)
44841996599118353723…44614278758767697921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.968 × 10⁹⁵(96-digit number)
89683993198236707446…89228557517535395841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.793 × 10⁹⁶(97-digit number)
17936798639647341489…78457115035070791681
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,970,699 XPM·at block #6,840,793 · 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