Block #229,365

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/27/2013, 3:44:24 AM · Difficulty 9.9380 · 6,611,947 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c8e39c2fb571478d20dc2cdb6106a359f68b7c72ab598d3398caf88a0623b1c7

Height

#229,365

Difficulty

9.938009

Transactions

2

Size

719 B

Version

2

Bits

09f02162

Nonce

6,234

Timestamp

10/27/2013, 3:44:24 AM

Confirmations

6,611,947

Merkle Root

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

4.248 × 10⁹²(93-digit number)
42480354224081191611…20534351557779387249
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
4.248 × 10⁹²(93-digit number)
42480354224081191611…20534351557779387249
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.496 × 10⁹²(93-digit number)
84960708448162383223…41068703115558774499
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.699 × 10⁹³(94-digit number)
16992141689632476644…82137406231117548999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.398 × 10⁹³(94-digit number)
33984283379264953289…64274812462235097999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.796 × 10⁹³(94-digit number)
67968566758529906578…28549624924470195999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.359 × 10⁹⁴(95-digit number)
13593713351705981315…57099249848940391999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.718 × 10⁹⁴(95-digit number)
27187426703411962631…14198499697880783999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.437 × 10⁹⁴(95-digit number)
54374853406823925262…28396999395761567999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.087 × 10⁹⁵(96-digit number)
10874970681364785052…56793998791523135999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.174 × 10⁹⁵(96-digit number)
21749941362729570105…13587997583046271999
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,974,857 XPM·at block #6,841,311 · 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