Block #2,880,736

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/14/2018, 12:31:39 PM · Difficulty 11.6317 · 3,958,382 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
66231b9c00275eeab6fb38399b3c35b58ec80ab4ccdd778ddd8fdd61adb947eb

Height

#2,880,736

Difficulty

11.631747

Transactions

8

Size

1.97 KB

Version

2

Bits

0ba1ba26

Nonce

378,426,001

Timestamp

10/14/2018, 12:31:39 PM

Confirmations

3,958,382

Merkle Root

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

7.207 × 10⁹⁶(97-digit number)
72072225500537648606…13417460945060413441
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
7.207 × 10⁹⁶(97-digit number)
72072225500537648606…13417460945060413441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.441 × 10⁹⁷(98-digit number)
14414445100107529721…26834921890120826881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.882 × 10⁹⁷(98-digit number)
28828890200215059442…53669843780241653761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.765 × 10⁹⁷(98-digit number)
57657780400430118885…07339687560483307521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.153 × 10⁹⁸(99-digit number)
11531556080086023777…14679375120966615041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.306 × 10⁹⁸(99-digit number)
23063112160172047554…29358750241933230081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.612 × 10⁹⁸(99-digit number)
46126224320344095108…58717500483866460161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.225 × 10⁹⁸(99-digit number)
92252448640688190216…17435000967732920321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.845 × 10⁹⁹(100-digit number)
18450489728137638043…34870001935465840641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.690 × 10⁹⁹(100-digit number)
36900979456275276086…69740003870931681281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.380 × 10⁹⁹(100-digit number)
73801958912550552173…39480007741863362561
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,957,219 XPM·at block #6,839,117 · 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