Block #238,705

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/1/2013, 4:47:21 PM · Difficulty 9.9530 · 6,573,586 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d277efa3f33b8ba747e985cfd8fd735a795a03142afa1f0c4c7ff1dff9c63afb

Height

#238,705

Difficulty

9.952994

Transactions

4

Size

952 B

Version

2

Bits

09f3f764

Nonce

137

Timestamp

11/1/2013, 4:47:21 PM

Confirmations

6,573,586

Merkle Root

4e36009b45484df96a281150083e01eb43a3ecee0c06da9143614d2f9c535d71
Transactions (4)
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.

5.950 × 10¹⁰¹(102-digit number)
59503918887729707458…85362698158386329599
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
5.950 × 10¹⁰¹(102-digit number)
59503918887729707458…85362698158386329599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.190 × 10¹⁰²(103-digit number)
11900783777545941491…70725396316772659199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.380 × 10¹⁰²(103-digit number)
23801567555091882983…41450792633545318399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.760 × 10¹⁰²(103-digit number)
47603135110183765966…82901585267090636799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.520 × 10¹⁰²(103-digit number)
95206270220367531933…65803170534181273599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.904 × 10¹⁰³(104-digit number)
19041254044073506386…31606341068362547199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.808 × 10¹⁰³(104-digit number)
38082508088147012773…63212682136725094399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.616 × 10¹⁰³(104-digit number)
76165016176294025546…26425364273450188799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.523 × 10¹⁰⁴(105-digit number)
15233003235258805109…52850728546900377599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.046 × 10¹⁰⁴(105-digit number)
30466006470517610218…05701457093800755199
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,742,347 XPM·at block #6,812,290 · 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