Block #2,318,256

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/2/2017, 1:15:09 AM · Difficulty 10.9133 · 4,524,640 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a13b2df259a1b0b48cd16fecc700ad770845f02451c7131f5cb16efd986b5c33

Height

#2,318,256

Difficulty

10.913313

Transactions

2

Size

1.72 KB

Version

2

Bits

0ae9cedd

Nonce

1,207,428,782

Timestamp

10/2/2017, 1:15:09 AM

Confirmations

4,524,640

Merkle Root

65b3fdab06fe47ea9ce2e932efe1de1710d75a73c835e41649c72da7032362ac
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.212 × 10⁹³(94-digit number)
62121422206932564385…44012180771587725361
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.212 × 10⁹³(94-digit number)
62121422206932564385…44012180771587725361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.242 × 10⁹⁴(95-digit number)
12424284441386512877…88024361543175450721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.484 × 10⁹⁴(95-digit number)
24848568882773025754…76048723086350901441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.969 × 10⁹⁴(95-digit number)
49697137765546051508…52097446172701802881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.939 × 10⁹⁴(95-digit number)
99394275531092103016…04194892345403605761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.987 × 10⁹⁵(96-digit number)
19878855106218420603…08389784690807211521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.975 × 10⁹⁵(96-digit number)
39757710212436841206…16779569381614423041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.951 × 10⁹⁵(96-digit number)
79515420424873682413…33559138763228846081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.590 × 10⁹⁶(97-digit number)
15903084084974736482…67118277526457692161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.180 × 10⁹⁶(97-digit number)
31806168169949472965…34236555052915384321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.361 × 10⁹⁶(97-digit number)
63612336339898945930…68473110105830768641
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,516 XPM·at block #6,842,895 · 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