Block #193,907

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/4/2013, 7:25:03 PM · Difficulty 9.8779 · 6,649,229 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f2c7e88c3dcdc553ef643da0d9339b5845b36da723c7895c01ba9648ffe15232

Height

#193,907

Difficulty

9.877923

Transactions

2

Size

4.72 KB

Version

2

Bits

09e0bf8d

Nonce

1,164,765,188

Timestamp

10/4/2013, 7:25:03 PM

Confirmations

6,649,229

Merkle Root

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

3.137 × 10⁹⁰(91-digit number)
31375854635038319226…60009093112649663999
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
3.137 × 10⁹⁰(91-digit number)
31375854635038319226…60009093112649663999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.275 × 10⁹⁰(91-digit number)
62751709270076638453…20018186225299327999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.255 × 10⁹¹(92-digit number)
12550341854015327690…40036372450598655999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.510 × 10⁹¹(92-digit number)
25100683708030655381…80072744901197311999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.020 × 10⁹¹(92-digit number)
50201367416061310762…60145489802394623999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.004 × 10⁹²(93-digit number)
10040273483212262152…20290979604789247999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.008 × 10⁹²(93-digit number)
20080546966424524305…40581959209578495999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.016 × 10⁹²(93-digit number)
40161093932849048610…81163918419156991999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.032 × 10⁹²(93-digit number)
80322187865698097220…62327836838313983999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.606 × 10⁹³(94-digit number)
16064437573139619444…24655673676627967999
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,989,452 XPM·at block #6,843,135 · 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