Block #2,232,155

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/1/2017, 9:59:04 AM · Difficulty 10.9462 · 4,594,253 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5a03bba36788cc46b3073d08270c8e7b2d79d7e2031ee6d911a39f1909e63d25

Height

#2,232,155

Difficulty

10.946229

Transactions

2

Size

574 B

Version

2

Bits

0af23c13

Nonce

652,775,225

Timestamp

8/1/2017, 9:59:04 AM

Confirmations

4,594,253

Merkle Root

69b69916eac052f196f357c4a2500442f614cf905147cef73bde9ad48c98640a
Transactions (2)
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.

6.722 × 10⁹⁴(95-digit number)
67228164926366040334…82699495580842776959
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
6.722 × 10⁹⁴(95-digit number)
67228164926366040334…82699495580842776959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.344 × 10⁹⁵(96-digit number)
13445632985273208066…65398991161685553919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.689 × 10⁹⁵(96-digit number)
26891265970546416133…30797982323371107839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.378 × 10⁹⁵(96-digit number)
53782531941092832267…61595964646742215679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.075 × 10⁹⁶(97-digit number)
10756506388218566453…23191929293484431359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.151 × 10⁹⁶(97-digit number)
21513012776437132906…46383858586968862719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.302 × 10⁹⁶(97-digit number)
43026025552874265813…92767717173937725439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.605 × 10⁹⁶(97-digit number)
86052051105748531627…85535434347875450879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.721 × 10⁹⁷(98-digit number)
17210410221149706325…71070868695750901759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.442 × 10⁹⁷(98-digit number)
34420820442299412651…42141737391501803519
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,855,396 XPM·at block #6,826,407 · 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