Block #2,272,043

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/28/2017, 3:34:33 PM · Difficulty 10.9541 · 4,564,810 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c39e21a740ce1643de76b761fb5b5a815a7614cf6a6d6977c3b02107b31b7578

Height

#2,272,043

Difficulty

10.954080

Transactions

2

Size

1.14 KB

Version

2

Bits

0af43e95

Nonce

16,801,507

Timestamp

8/28/2017, 3:34:33 PM

Confirmations

4,564,810

Merkle Root

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

1.421 × 10⁹⁷(98-digit number)
14219450696501116211…67421421081448727041
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.421 × 10⁹⁷(98-digit number)
14219450696501116211…67421421081448727041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.843 × 10⁹⁷(98-digit number)
28438901393002232423…34842842162897454081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.687 × 10⁹⁷(98-digit number)
56877802786004464846…69685684325794908161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.137 × 10⁹⁸(99-digit number)
11375560557200892969…39371368651589816321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.275 × 10⁹⁸(99-digit number)
22751121114401785938…78742737303179632641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.550 × 10⁹⁸(99-digit number)
45502242228803571876…57485474606359265281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.100 × 10⁹⁸(99-digit number)
91004484457607143753…14970949212718530561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.820 × 10⁹⁹(100-digit number)
18200896891521428750…29941898425437061121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.640 × 10⁹⁹(100-digit number)
36401793783042857501…59883796850874122241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.280 × 10⁹⁹(100-digit number)
72803587566085715003…19767593701748244481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.456 × 10¹⁰⁰(101-digit number)
14560717513217143000…39535187403496488961
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,112 XPM·at block #6,836,852 · 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