Block #362,575

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/16/2014, 7:36:27 PM · Difficulty 10.4149 · 6,453,772 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3fa0513f1940d8bde324036b5905fa6e141609162655bd538b55e34e2c3bab60

Height

#362,575

Difficulty

10.414929

Transactions

2

Size

2.04 KB

Version

2

Bits

0a6a38ce

Nonce

173,049

Timestamp

1/16/2014, 7:36:27 PM

Confirmations

6,453,772

Merkle Root

f78256e3771732eaafd1e5b17cf270849b0a682eeb014ede5489135be485d196
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.427 × 10⁹²(93-digit number)
74279947401166208776…03193732571049587919
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.427 × 10⁹²(93-digit number)
74279947401166208776…03193732571049587919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.485 × 10⁹³(94-digit number)
14855989480233241755…06387465142099175839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.971 × 10⁹³(94-digit number)
29711978960466483510…12774930284198351679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.942 × 10⁹³(94-digit number)
59423957920932967021…25549860568396703359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.188 × 10⁹⁴(95-digit number)
11884791584186593404…51099721136793406719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.376 × 10⁹⁴(95-digit number)
23769583168373186808…02199442273586813439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.753 × 10⁹⁴(95-digit number)
47539166336746373617…04398884547173626879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.507 × 10⁹⁴(95-digit number)
95078332673492747234…08797769094347253759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.901 × 10⁹⁵(96-digit number)
19015666534698549446…17595538188694507519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.803 × 10⁹⁵(96-digit number)
38031333069397098893…35191076377389015039
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,774,900 XPM·at block #6,816,346 · 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