Block #377,114

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/26/2014, 9:18:13 PM · Difficulty 10.4244 · 6,437,199 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
dde70c6c5929f4b4119d902a4422ca9d37ea8435bb7b0de60130b7ce824e327e

Height

#377,114

Difficulty

10.424387

Transactions

14

Size

3.86 KB

Version

2

Bits

0a6ca4a6

Nonce

167,780,230

Timestamp

1/26/2014, 9:18:13 PM

Confirmations

6,437,199

Merkle Root

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

3.882 × 10⁹⁶(97-digit number)
38825503347476309887…86783024737528328319
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
3.882 × 10⁹⁶(97-digit number)
38825503347476309887…86783024737528328319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.765 × 10⁹⁶(97-digit number)
77651006694952619775…73566049475056656639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.553 × 10⁹⁷(98-digit number)
15530201338990523955…47132098950113313279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.106 × 10⁹⁷(98-digit number)
31060402677981047910…94264197900226626559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.212 × 10⁹⁷(98-digit number)
62120805355962095820…88528395800453253119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.242 × 10⁹⁸(99-digit number)
12424161071192419164…77056791600906506239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.484 × 10⁹⁸(99-digit number)
24848322142384838328…54113583201813012479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.969 × 10⁹⁸(99-digit number)
49696644284769676656…08227166403626024959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.939 × 10⁹⁸(99-digit number)
99393288569539353312…16454332807252049919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.987 × 10⁹⁹(100-digit number)
19878657713907870662…32908665614504099839
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,758,567 XPM·at block #6,814,312 · 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