Block #232,502

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/29/2013, 4:00:37 AM · Difficulty 9.9411 · 6,585,245 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b54145008a92bae0e9b3af06052f3a5d9b47ce4a9f90d2a36a3db76943b72f06

Height

#232,502

Difficulty

9.941077

Transactions

5

Size

2.49 KB

Version

2

Bits

09f0ea64

Nonce

120,975

Timestamp

10/29/2013, 4:00:37 AM

Confirmations

6,585,245

Merkle Root

a3ed9bbf091acb4cea6f3b629dfc94b32b219c3997405bce42646081372687f4
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.628 × 10⁹⁴(95-digit number)
26282365508356211715…43802267958360179839
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.628 × 10⁹⁴(95-digit number)
26282365508356211715…43802267958360179839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.256 × 10⁹⁴(95-digit number)
52564731016712423431…87604535916720359679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.051 × 10⁹⁵(96-digit number)
10512946203342484686…75209071833440719359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.102 × 10⁹⁵(96-digit number)
21025892406684969372…50418143666881438719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.205 × 10⁹⁵(96-digit number)
42051784813369938745…00836287333762877439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.410 × 10⁹⁵(96-digit number)
84103569626739877490…01672574667525754879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.682 × 10⁹⁶(97-digit number)
16820713925347975498…03345149335051509759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.364 × 10⁹⁶(97-digit number)
33641427850695950996…06690298670103019519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.728 × 10⁹⁶(97-digit number)
67282855701391901992…13380597340206039039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.345 × 10⁹⁷(98-digit number)
13456571140278380398…26761194680412078079
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,786,029 XPM·at block #6,817,746 · 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