Block #168,493

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/17/2013, 8:20:53 AM · Difficulty 9.8684 · 6,641,034 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0d17a32e1ef640e0f3d90de635eae749f6c8c49503388bd1a23db73fb6595684

Height

#168,493

Difficulty

9.868411

Transactions

2

Size

358 B

Version

2

Bits

09de502f

Nonce

118,672

Timestamp

9/17/2013, 8:20:53 AM

Confirmations

6,641,034

Merkle Root

b83ffe75292576ce12c0d97580588db16e2f04fb458c0ca4f1e6882f14ddf605
Transactions (2)
1 in → 1 out10.2600 XPM109 B
1 in → 1 out10.4200 XPM158 B
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.

7.777 × 10⁹⁵(96-digit number)
77776374514855781303…14729579183934340479
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
7.777 × 10⁹⁵(96-digit number)
77776374514855781303…14729579183934340479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.555 × 10⁹⁶(97-digit number)
15555274902971156260…29459158367868680959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.111 × 10⁹⁶(97-digit number)
31110549805942312521…58918316735737361919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.222 × 10⁹⁶(97-digit number)
62221099611884625042…17836633471474723839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.244 × 10⁹⁷(98-digit number)
12444219922376925008…35673266942949447679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.488 × 10⁹⁷(98-digit number)
24888439844753850017…71346533885898895359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.977 × 10⁹⁷(98-digit number)
49776879689507700034…42693067771797790719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.955 × 10⁹⁷(98-digit number)
99553759379015400068…85386135543595581439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.991 × 10⁹⁸(99-digit number)
19910751875803080013…70772271087191162879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.982 × 10⁹⁸(99-digit number)
39821503751606160027…41544542174382325759
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,720,293 XPM·at block #6,809,526 · 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.

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