Block #239,035

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/1/2013, 9:00:07 PM · Difficulty 9.9537 · 6,570,125 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
aebe00200220c8f64f1746239b0dcae433c3545009c70cc3c3d4bb7dafffb2b9

Height

#239,035

Difficulty

9.953721

Transactions

1

Size

1.54 KB

Version

2

Bits

09f4270c

Nonce

15,916

Timestamp

11/1/2013, 9:00:07 PM

Confirmations

6,570,125

Merkle Root

21814f1255ae73fb06e201a46b1e03791ede8d51b6c6ea20944d30f6e4ee407d
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.575 × 10⁹⁹(100-digit number)
25756687037729020822…60927942919592747839
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.575 × 10⁹⁹(100-digit number)
25756687037729020822…60927942919592747839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.151 × 10⁹⁹(100-digit number)
51513374075458041645…21855885839185495679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.030 × 10¹⁰⁰(101-digit number)
10302674815091608329…43711771678370991359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.060 × 10¹⁰⁰(101-digit number)
20605349630183216658…87423543356741982719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.121 × 10¹⁰⁰(101-digit number)
41210699260366433316…74847086713483965439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.242 × 10¹⁰⁰(101-digit number)
82421398520732866632…49694173426967930879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.648 × 10¹⁰¹(102-digit number)
16484279704146573326…99388346853935861759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.296 × 10¹⁰¹(102-digit number)
32968559408293146653…98776693707871723519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.593 × 10¹⁰¹(102-digit number)
65937118816586293306…97553387415743447039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.318 × 10¹⁰²(103-digit number)
13187423763317258661…95106774831486894079
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,717,341 XPM·at block #6,809,159 · 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.

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