Block #2,303,961

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/21/2017, 9:09:45 PM · Difficulty 10.9187 · 4,527,764 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
423c650f2c0ca2c388a89a0d397b054166b1946cda90b29d252be3c8191aa374

Height

#2,303,961

Difficulty

10.918739

Transactions

2

Size

1015 B

Version

2

Bits

0aeb3281

Nonce

687,624,244

Timestamp

9/21/2017, 9:09:45 PM

Confirmations

4,527,764

Merkle Root

732ec503c52bf2b1b1ad439d44345aa0e5ebf8d46004b1699e9c9026434f5e3b
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.155 × 10⁹⁴(95-digit number)
11557536084466909629…02710802452635037801
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.155 × 10⁹⁴(95-digit number)
11557536084466909629…02710802452635037801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.311 × 10⁹⁴(95-digit number)
23115072168933819258…05421604905270075601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.623 × 10⁹⁴(95-digit number)
46230144337867638517…10843209810540151201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.246 × 10⁹⁴(95-digit number)
92460288675735277035…21686419621080302401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.849 × 10⁹⁵(96-digit number)
18492057735147055407…43372839242160604801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.698 × 10⁹⁵(96-digit number)
36984115470294110814…86745678484321209601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.396 × 10⁹⁵(96-digit number)
73968230940588221628…73491356968642419201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.479 × 10⁹⁶(97-digit number)
14793646188117644325…46982713937284838401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.958 × 10⁹⁶(97-digit number)
29587292376235288651…93965427874569676801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.917 × 10⁹⁶(97-digit number)
59174584752470577302…87930855749139353601
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,897,903 XPM·at block #6,831,724 · 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