Block #2,661,463

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/15/2018, 3:43:07 AM · Difficulty 11.6331 · 4,175,345 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
73cdcd0fc0d29b2f5b50579e94dc3217eabcd6f82a95d99a94ad82fd85fa2963

Height

#2,661,463

Difficulty

11.633110

Transactions

20

Size

8.13 KB

Version

2

Bits

0ba2137f

Nonce

108,071,309

Timestamp

5/15/2018, 3:43:07 AM

Confirmations

4,175,345

Merkle Root

e5f38f31a273cb811b7157780593f52f7332a81ebd9b4180b511ee2caf904b94
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.322 × 10⁹⁵(96-digit number)
33229184062644390623…94829238238363012961
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.322 × 10⁹⁵(96-digit number)
33229184062644390623…94829238238363012961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.645 × 10⁹⁵(96-digit number)
66458368125288781247…89658476476726025921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.329 × 10⁹⁶(97-digit number)
13291673625057756249…79316952953452051841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.658 × 10⁹⁶(97-digit number)
26583347250115512498…58633905906904103681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.316 × 10⁹⁶(97-digit number)
53166694500231024997…17267811813808207361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.063 × 10⁹⁷(98-digit number)
10633338900046204999…34535623627616414721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.126 × 10⁹⁷(98-digit number)
21266677800092409999…69071247255232829441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.253 × 10⁹⁷(98-digit number)
42533355600184819998…38142494510465658881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.506 × 10⁹⁷(98-digit number)
85066711200369639996…76284989020931317761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.701 × 10⁹⁸(99-digit number)
17013342240073927999…52569978041862635521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.402 × 10⁹⁸(99-digit number)
34026684480147855998…05139956083725271041
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,938,747 XPM·at block #6,836,807 · 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