Block #170,136

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/18/2013, 1:22:16 PM · Difficulty 9.8659 · 6,639,998 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1f08a8bc18322dc97ffe7ec9307827c6b23a816ff03d6b9337c7af91dae05718

Height

#170,136

Difficulty

9.865921

Transactions

3

Size

798 B

Version

2

Bits

09ddacfe

Nonce

31,106

Timestamp

9/18/2013, 1:22:16 PM

Confirmations

6,639,998

Merkle Root

1f8ac3ca40373fb7bdd6a400dabf7bfd29668cb994d0af32be20483a4a462107
Transactions (3)
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.333 × 10⁹³(94-digit number)
13334418564383980191…13710913746920620439
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.333 × 10⁹³(94-digit number)
13334418564383980191…13710913746920620439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.666 × 10⁹³(94-digit number)
26668837128767960383…27421827493841240879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.333 × 10⁹³(94-digit number)
53337674257535920767…54843654987682481759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.066 × 10⁹⁴(95-digit number)
10667534851507184153…09687309975364963519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.133 × 10⁹⁴(95-digit number)
21335069703014368306…19374619950729927039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.267 × 10⁹⁴(95-digit number)
42670139406028736613…38749239901459854079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.534 × 10⁹⁴(95-digit number)
85340278812057473227…77498479802919708159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.706 × 10⁹⁵(96-digit number)
17068055762411494645…54996959605839416319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.413 × 10⁹⁵(96-digit number)
34136111524822989291…09993919211678832639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.827 × 10⁹⁵(96-digit number)
68272223049645978582…19987838423357665279
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,725,139 XPM·at block #6,810,133 · 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