Block #190,720

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/2/2013, 4:26:21 PM · Difficulty 9.8743 · 6,619,461 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
778862ade2b2604fa3dcf9ae58096d37ffa58cc0281157eb889b10cf0db36421

Height

#190,720

Difficulty

9.874339

Transactions

3

Size

878 B

Version

2

Bits

09dfd4af

Nonce

861

Timestamp

10/2/2013, 4:26:21 PM

Confirmations

6,619,461

Merkle Root

fc8893a3155aa9efa3bdb7a39c3f303ae65b48f00399ab6dfdf60215bbc7ca3f
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.

2.991 × 10⁹⁵(96-digit number)
29911407589040291455…48051089070271802879
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
2.991 × 10⁹⁵(96-digit number)
29911407589040291455…48051089070271802879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.982 × 10⁹⁵(96-digit number)
59822815178080582910…96102178140543605759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.196 × 10⁹⁶(97-digit number)
11964563035616116582…92204356281087211519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.392 × 10⁹⁶(97-digit number)
23929126071232233164…84408712562174423039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.785 × 10⁹⁶(97-digit number)
47858252142464466328…68817425124348846079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.571 × 10⁹⁶(97-digit number)
95716504284928932657…37634850248697692159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.914 × 10⁹⁷(98-digit number)
19143300856985786531…75269700497395384319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.828 × 10⁹⁷(98-digit number)
38286601713971573062…50539400994790768639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.657 × 10⁹⁷(98-digit number)
76573203427943146125…01078801989581537279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.531 × 10⁹⁸(99-digit number)
15314640685588629225…02157603979163074559
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,517 XPM·at block #6,810,180 · 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