Block #391,945

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/6/2014, 4:11:24 AM · Difficulty 10.4311 · 6,447,887 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
28f7f0988ef14b4b4a2ea68425c8197db8ef216ddfe4a6121d4d314e03640857

Height

#391,945

Difficulty

10.431060

Transactions

2

Size

1.57 KB

Version

2

Bits

0a6e59ed

Nonce

728,269

Timestamp

2/6/2014, 4:11:24 AM

Confirmations

6,447,887

Merkle Root

d03dc23af2ccab7cf2cac0f221f9e17b88ca95c1d50848ec317f6d591526ae57
Transactions (2)
1 in → 1 out9.2000 XPM110 B
12 in → 1 out115.5600 XPM1.38 KB
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.283 × 10⁹⁶(97-digit number)
22831669732440874494…41678530858089070099
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.283 × 10⁹⁶(97-digit number)
22831669732440874494…41678530858089070099
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.566 × 10⁹⁶(97-digit number)
45663339464881748988…83357061716178140199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.132 × 10⁹⁶(97-digit number)
91326678929763497977…66714123432356280399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.826 × 10⁹⁷(98-digit number)
18265335785952699595…33428246864712560799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.653 × 10⁹⁷(98-digit number)
36530671571905399191…66856493729425121599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.306 × 10⁹⁷(98-digit number)
73061343143810798382…33712987458850243199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.461 × 10⁹⁸(99-digit number)
14612268628762159676…67425974917700486399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.922 × 10⁹⁸(99-digit number)
29224537257524319352…34851949835400972799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.844 × 10⁹⁸(99-digit number)
58449074515048638705…69703899670801945599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.168 × 10⁹⁹(100-digit number)
11689814903009727741…39407799341603891199
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,962,953 XPM·at block #6,839,831 · 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