Block #444,849

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/15/2014, 12:30:09 PM · Difficulty 10.3519 · 6,372,822 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6813cd72a342f958dd197c2b4a070208acf26a0aee4f225b79531341cf4d5c7a

Height

#444,849

Difficulty

10.351913

Transactions

8

Size

7.63 KB

Version

2

Bits

0a5a16f9

Nonce

84,619

Timestamp

3/15/2014, 12:30:09 PM

Confirmations

6,372,822

Merkle Root

0e3054ce5bd582d4facfecc93d41186bcc34bd207d657b5494c40d2750a56d41
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.

1.098 × 10⁹⁵(96-digit number)
10984222098478084102…34561075825123307519
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
1.098 × 10⁹⁵(96-digit number)
10984222098478084102…34561075825123307519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.196 × 10⁹⁵(96-digit number)
21968444196956168204…69122151650246615039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.393 × 10⁹⁵(96-digit number)
43936888393912336409…38244303300493230079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.787 × 10⁹⁵(96-digit number)
87873776787824672818…76488606600986460159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.757 × 10⁹⁶(97-digit number)
17574755357564934563…52977213201972920319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.514 × 10⁹⁶(97-digit number)
35149510715129869127…05954426403945840639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.029 × 10⁹⁶(97-digit number)
70299021430259738254…11908852807891681279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.405 × 10⁹⁷(98-digit number)
14059804286051947650…23817705615783362559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.811 × 10⁹⁷(98-digit number)
28119608572103895301…47635411231566725119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.623 × 10⁹⁷(98-digit number)
56239217144207790603…95270822463133450239
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,785,424 XPM·at block #6,817,670 · 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