Block #2,871,453

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/7/2018, 5:31:41 PM · Difficulty 11.6660 · 3,965,473 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
74a3d44edf7e9bd70e98eca8aee517881f297196474c088086d49b1faba48b0b

Height

#2,871,453

Difficulty

11.666030

Transactions

6

Size

2.22 KB

Version

2

Bits

0baa80f0

Nonce

849,169,908

Timestamp

10/7/2018, 5:31:41 PM

Confirmations

3,965,473

Merkle Root

2e4ddcda723a30d926b6bac64613d2d14f71f10f1d31439341d689914581767e
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.

2.956 × 10⁹³(94-digit number)
29568064858863213875…22034285298841227771
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
2.956 × 10⁹³(94-digit number)
29568064858863213875…22034285298841227771
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.913 × 10⁹³(94-digit number)
59136129717726427751…44068570597682455541
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.182 × 10⁹⁴(95-digit number)
11827225943545285550…88137141195364911081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.365 × 10⁹⁴(95-digit number)
23654451887090571100…76274282390729822161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.730 × 10⁹⁴(95-digit number)
47308903774181142201…52548564781459644321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.461 × 10⁹⁴(95-digit number)
94617807548362284403…05097129562919288641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.892 × 10⁹⁵(96-digit number)
18923561509672456880…10194259125838577281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.784 × 10⁹⁵(96-digit number)
37847123019344913761…20388518251677154561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.569 × 10⁹⁵(96-digit number)
75694246038689827522…40777036503354309121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.513 × 10⁹⁶(97-digit number)
15138849207737965504…81554073006708618241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.027 × 10⁹⁶(97-digit number)
30277698415475931008…63108146013417236481
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,939,704 XPM·at block #6,836,925 · 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