Block #375,943

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/26/2014, 1:59:03 AM · Difficulty 10.4226 · 6,449,377 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
150b46fd265ab15817b629e3777740fe823d8b8d7fba2a64344371ec6ffb076d

Height

#375,943

Difficulty

10.422641

Transactions

6

Size

1.44 KB

Version

2

Bits

0a6c322c

Nonce

73,607

Timestamp

1/26/2014, 1:59:03 AM

Confirmations

6,449,377

Merkle Root

2037012e0066f4748fc68f837655dcac034aee5e74a2d839de033894a55f8399
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.210 × 10⁹⁸(99-digit number)
12104370252748783334…52558666640168204879
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.210 × 10⁹⁸(99-digit number)
12104370252748783334…52558666640168204879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.420 × 10⁹⁸(99-digit number)
24208740505497566669…05117333280336409759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.841 × 10⁹⁸(99-digit number)
48417481010995133339…10234666560672819519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.683 × 10⁹⁸(99-digit number)
96834962021990266678…20469333121345639039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.936 × 10⁹⁹(100-digit number)
19366992404398053335…40938666242691278079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.873 × 10⁹⁹(100-digit number)
38733984808796106671…81877332485382556159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.746 × 10⁹⁹(100-digit number)
77467969617592213342…63754664970765112319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.549 × 10¹⁰⁰(101-digit number)
15493593923518442668…27509329941530224639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.098 × 10¹⁰⁰(101-digit number)
30987187847036885337…55018659883060449279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.197 × 10¹⁰⁰(101-digit number)
61974375694073770674…10037319766120898559
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,846,665 XPM·at block #6,825,319 · 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