Block #174,495

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/21/2013, 4:56:14 PM · Difficulty 9.8615 · 6,641,493 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
05386767439b9345576b9650b32a30eea5bf7c410816f18df5b814598f7c8f52

Height

#174,495

Difficulty

9.861529

Transactions

2

Size

573 B

Version

2

Bits

09dc8d30

Nonce

61,931

Timestamp

9/21/2013, 4:56:14 PM

Confirmations

6,641,493

Merkle Root

2ce3a739731e0e2eac329fcf0345eebd906ba4eebc12a993b5a38f6f467f5c67
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.

5.151 × 10⁹⁵(96-digit number)
51517882810114991951…17020389572419300039
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
5.151 × 10⁹⁵(96-digit number)
51517882810114991951…17020389572419300039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.030 × 10⁹⁶(97-digit number)
10303576562022998390…34040779144838600079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.060 × 10⁹⁶(97-digit number)
20607153124045996780…68081558289677200159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.121 × 10⁹⁶(97-digit number)
41214306248091993561…36163116579354400319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.242 × 10⁹⁶(97-digit number)
82428612496183987123…72326233158708800639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.648 × 10⁹⁷(98-digit number)
16485722499236797424…44652466317417601279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.297 × 10⁹⁷(98-digit number)
32971444998473594849…89304932634835202559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.594 × 10⁹⁷(98-digit number)
65942889996947189698…78609865269670405119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.318 × 10⁹⁸(99-digit number)
13188577999389437939…57219730539340810239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.637 × 10⁹⁸(99-digit number)
26377155998778875879…14439461078681620479
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,772,019 XPM·at block #6,815,987 · 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