Block #2,781,729

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/6/2018, 1:20:13 PM · Difficulty 11.6494 · 4,051,134 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
dab3c3ed38dc634cd1d77fac47918d416ba94dcbf10ab065f16daeac046e3d31

Height

#2,781,729

Difficulty

11.649446

Transactions

2

Size

1.14 KB

Version

2

Bits

0ba64211

Nonce

499,647,780

Timestamp

8/6/2018, 1:20:13 PM

Confirmations

4,051,134

Merkle Root

3b78aeb4516c120680883d402586f68165828ed94de392d1e1b59410bab2f202
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.

6.197 × 10⁹⁵(96-digit number)
61971175139713454376…58133237390712778241
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
6.197 × 10⁹⁵(96-digit number)
61971175139713454376…58133237390712778241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.239 × 10⁹⁶(97-digit number)
12394235027942690875…16266474781425556481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.478 × 10⁹⁶(97-digit number)
24788470055885381750…32532949562851112961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.957 × 10⁹⁶(97-digit number)
49576940111770763501…65065899125702225921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.915 × 10⁹⁶(97-digit number)
99153880223541527002…30131798251404451841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.983 × 10⁹⁷(98-digit number)
19830776044708305400…60263596502808903681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.966 × 10⁹⁷(98-digit number)
39661552089416610801…20527193005617807361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.932 × 10⁹⁷(98-digit number)
79323104178833221602…41054386011235614721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.586 × 10⁹⁸(99-digit number)
15864620835766644320…82108772022471229441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.172 × 10⁹⁸(99-digit number)
31729241671533288640…64217544044942458881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.345 × 10⁹⁸(99-digit number)
63458483343066577281…28435088089884917761
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,907,073 XPM·at block #6,832,862 · 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