Block #367,848

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/20/2014, 8:47:14 AM · Difficulty 10.4361 · 6,442,007 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d90b850a1752ec6e4c8117232af347ffcf6eb5ee96e2c1469428f6c6cff9e67a

Height

#367,848

Difficulty

10.436111

Transactions

2

Size

436 B

Version

2

Bits

0a6fa4f2

Nonce

33,363

Timestamp

1/20/2014, 8:47:14 AM

Confirmations

6,442,007

Merkle Root

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

7.027 × 10¹⁰⁰(101-digit number)
70271778917960291093…02902115871810685629
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
7.027 × 10¹⁰⁰(101-digit number)
70271778917960291093…02902115871810685629
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.405 × 10¹⁰¹(102-digit number)
14054355783592058218…05804231743621371259
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.810 × 10¹⁰¹(102-digit number)
28108711567184116437…11608463487242742519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.621 × 10¹⁰¹(102-digit number)
56217423134368232875…23216926974485485039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.124 × 10¹⁰²(103-digit number)
11243484626873646575…46433853948970970079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.248 × 10¹⁰²(103-digit number)
22486969253747293150…92867707897941940159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.497 × 10¹⁰²(103-digit number)
44973938507494586300…85735415795883880319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.994 × 10¹⁰²(103-digit number)
89947877014989172600…71470831591767760639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.798 × 10¹⁰³(104-digit number)
17989575402997834520…42941663183535521279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.597 × 10¹⁰³(104-digit number)
35979150805995669040…85883326367071042559
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,722,927 XPM·at block #6,809,854 · 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