Block #2,621,675

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/20/2018, 2:47:25 AM · Difficulty 11.2283 · 4,221,184 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3924d5d109f0b2448a9ed6a8d208b126f790711cf2cc56ce7953958c5f6f40bb

Height

#2,621,675

Difficulty

11.228345

Transactions

59

Size

16.00 KB

Version

2

Bits

0b3a74d4

Nonce

27,214,928

Timestamp

4/20/2018, 2:47:25 AM

Confirmations

4,221,184

Merkle Root

5bbd734fd5e7e9e5d2d2eb5a5b7db62a3bdc507912bd551ed14522ae9ba6df73
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.

3.054 × 10⁹⁴(95-digit number)
30549233460496421198…00326653279530700801
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
3.054 × 10⁹⁴(95-digit number)
30549233460496421198…00326653279530700801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.109 × 10⁹⁴(95-digit number)
61098466920992842396…00653306559061401601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.221 × 10⁹⁵(96-digit number)
12219693384198568479…01306613118122803201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.443 × 10⁹⁵(96-digit number)
24439386768397136958…02613226236245606401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.887 × 10⁹⁵(96-digit number)
48878773536794273917…05226452472491212801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.775 × 10⁹⁵(96-digit number)
97757547073588547834…10452904944982425601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.955 × 10⁹⁶(97-digit number)
19551509414717709566…20905809889964851201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.910 × 10⁹⁶(97-digit number)
39103018829435419133…41811619779929702401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.820 × 10⁹⁶(97-digit number)
78206037658870838267…83623239559859404801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.564 × 10⁹⁷(98-digit number)
15641207531774167653…67246479119718809601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.128 × 10⁹⁷(98-digit number)
31282415063548335307…34492958239437619201
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,987,219 XPM·at block #6,842,858 · 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