Block #2,273,406

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/29/2017, 1:38:53 PM · Difficulty 10.9545 · 4,569,164 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bd9b1dade53ed6380cc560b58f1d57c6e5618e06ba483b1449b6d6081435b99c

Height

#2,273,406

Difficulty

10.954455

Transactions

2

Size

3.02 KB

Version

2

Bits

0af45727

Nonce

154,021,762

Timestamp

8/29/2017, 1:38:53 PM

Confirmations

4,569,164

Merkle Root

2905cfc4ed23e640309e0e5af400b001accfa775b477979d6a2b258035bee361
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.588 × 10⁹²(93-digit number)
15885687428480669474…94623153083748972439
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.588 × 10⁹²(93-digit number)
15885687428480669474…94623153083748972439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.177 × 10⁹²(93-digit number)
31771374856961338948…89246306167497944879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.354 × 10⁹²(93-digit number)
63542749713922677897…78492612334995889759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.270 × 10⁹³(94-digit number)
12708549942784535579…56985224669991779519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.541 × 10⁹³(94-digit number)
25417099885569071158…13970449339983559039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.083 × 10⁹³(94-digit number)
50834199771138142317…27940898679967118079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.016 × 10⁹⁴(95-digit number)
10166839954227628463…55881797359934236159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.033 × 10⁹⁴(95-digit number)
20333679908455256927…11763594719868472319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.066 × 10⁹⁴(95-digit number)
40667359816910513854…23527189439736944639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.133 × 10⁹⁴(95-digit number)
81334719633821027708…47054378879473889279
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,984,987 XPM·at block #6,842,569 · 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