Block #108,288

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/9/2013, 11:05:06 PM · Difficulty 9.6450 · 6,699,843 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c6a7d51b2ec05b2461f95eb6153d295ee4430ad130b01d8a85a4b058af742b53

Height

#108,288

Difficulty

9.645001

Transactions

2

Size

6.35 KB

Version

2

Bits

09a51ecc

Nonce

545,926

Timestamp

8/9/2013, 11:05:06 PM

Confirmations

6,699,843

Merkle Root

ff4e46a558479c1bde510c851ca5f22290a60856e40a4ad78fb01d6c4f7891de
Transactions (2)
1 in → 1 out10.8000 XPM109 B
55 in → 1 out601.8000 XPM6.16 KB
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.

8.341 × 10⁹⁵(96-digit number)
83412741420821120468…52235025688116013759
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
8.341 × 10⁹⁵(96-digit number)
83412741420821120468…52235025688116013759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.668 × 10⁹⁶(97-digit number)
16682548284164224093…04470051376232027519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.336 × 10⁹⁶(97-digit number)
33365096568328448187…08940102752464055039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.673 × 10⁹⁶(97-digit number)
66730193136656896374…17880205504928110079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.334 × 10⁹⁷(98-digit number)
13346038627331379274…35760411009856220159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.669 × 10⁹⁷(98-digit number)
26692077254662758549…71520822019712440319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.338 × 10⁹⁷(98-digit number)
53384154509325517099…43041644039424880639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.067 × 10⁹⁸(99-digit number)
10676830901865103419…86083288078849761279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.135 × 10⁹⁸(99-digit number)
21353661803730206839…72166576157699522559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.270 × 10⁹⁸(99-digit number)
42707323607460413679…44333152315399045119
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,709,089 XPM·at block #6,808,130 · 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