Block #375,440

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/25/2014, 5:24:30 PM · Difficulty 10.4239 · 6,433,845 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
82a71b37c95b91133924ef3047938d151a353055e38a39539a57c9300defa281

Height

#375,440

Difficulty

10.423868

Transactions

3

Size

799 B

Version

2

Bits

0a6c82a5

Nonce

43,686

Timestamp

1/25/2014, 5:24:30 PM

Confirmations

6,433,845

Merkle Root

371260c544a042fbc42efb95c702dc96c82bddb090e8791574da5e9e3b2661a6
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.672 × 10⁹⁷(98-digit number)
16726423942166667468…87598018770984818299
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.672 × 10⁹⁷(98-digit number)
16726423942166667468…87598018770984818299
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.345 × 10⁹⁷(98-digit number)
33452847884333334936…75196037541969636599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.690 × 10⁹⁷(98-digit number)
66905695768666669872…50392075083939273199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.338 × 10⁹⁸(99-digit number)
13381139153733333974…00784150167878546399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.676 × 10⁹⁸(99-digit number)
26762278307466667948…01568300335757092799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.352 × 10⁹⁸(99-digit number)
53524556614933335897…03136600671514185599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.070 × 10⁹⁹(100-digit number)
10704911322986667179…06273201343028371199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.140 × 10⁹⁹(100-digit number)
21409822645973334359…12546402686056742399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.281 × 10⁹⁹(100-digit number)
42819645291946668718…25092805372113484799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.563 × 10⁹⁹(100-digit number)
85639290583893337436…50185610744226969599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.712 × 10¹⁰⁰(101-digit number)
17127858116778667487…00371221488453939199
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,718,350 XPM·at block #6,809,284 · 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