Block #383,849

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/31/2014, 4:24:07 PM · Difficulty 10.4062 · 6,434,087 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6760b88e071a00dd56a399c514ce0bf6794a1df646691c97a785d6bb4759d755

Height

#383,849

Difficulty

10.406200

Transactions

6

Size

1.29 KB

Version

2

Bits

0a67fcbb

Nonce

145,117

Timestamp

1/31/2014, 4:24:07 PM

Confirmations

6,434,087

Merkle Root

b8096ee20d89916247f735beb1ade254156c4d6e5d555d239dcf0d2dd46b3149
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.031 × 10¹⁰⁴(105-digit number)
10313959040789542800…70424917804891279359
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.031 × 10¹⁰⁴(105-digit number)
10313959040789542800…70424917804891279359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.062 × 10¹⁰⁴(105-digit number)
20627918081579085600…40849835609782558719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.125 × 10¹⁰⁴(105-digit number)
41255836163158171200…81699671219565117439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.251 × 10¹⁰⁴(105-digit number)
82511672326316342400…63399342439130234879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.650 × 10¹⁰⁵(106-digit number)
16502334465263268480…26798684878260469759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.300 × 10¹⁰⁵(106-digit number)
33004668930526536960…53597369756520939519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.600 × 10¹⁰⁵(106-digit number)
66009337861053073920…07194739513041879039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.320 × 10¹⁰⁶(107-digit number)
13201867572210614784…14389479026083758079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.640 × 10¹⁰⁶(107-digit number)
26403735144421229568…28778958052167516159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.280 × 10¹⁰⁶(107-digit number)
52807470288842459136…57557916104335032319
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,787,553 XPM·at block #6,817,935 · 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