Block #2,234,622

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/3/2017, 4:02:20 AM · Difficulty 10.9457 · 4,591,599 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
69fae0bdea6b0a7b58ee6e8ffb7a71c905ff909101413f5d33eed900cd329ebf

Height

#2,234,622

Difficulty

10.945710

Transactions

7

Size

2.29 KB

Version

2

Bits

0af21a0b

Nonce

658,564,529

Timestamp

8/3/2017, 4:02:20 AM

Confirmations

4,591,599

Merkle Root

41275d83d694be5307c7747c710ae6a0210d9bcb4022fa094fd65ab2b595e3a3
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.414 × 10⁹⁴(95-digit number)
14148250061481488624…09058623390752317759
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.414 × 10⁹⁴(95-digit number)
14148250061481488624…09058623390752317759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.829 × 10⁹⁴(95-digit number)
28296500122962977248…18117246781504635519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.659 × 10⁹⁴(95-digit number)
56593000245925954496…36234493563009271039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.131 × 10⁹⁵(96-digit number)
11318600049185190899…72468987126018542079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.263 × 10⁹⁵(96-digit number)
22637200098370381798…44937974252037084159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.527 × 10⁹⁵(96-digit number)
45274400196740763597…89875948504074168319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.054 × 10⁹⁵(96-digit number)
90548800393481527195…79751897008148336639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.810 × 10⁹⁶(97-digit number)
18109760078696305439…59503794016296673279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.621 × 10⁹⁶(97-digit number)
36219520157392610878…19007588032593346559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.243 × 10⁹⁶(97-digit number)
72439040314785221756…38015176065186693119
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,853,901 XPM·at block #6,826,220 · 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