Block #327,822

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/24/2013, 8:17:58 PM · Difficulty 10.1722 · 6,513,284 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
161b5f5c0c6544dc466b984282e34dfe3f689627ed5ee1f042b95eaa870e4642

Height

#327,822

Difficulty

10.172250

Transactions

8

Size

2.03 KB

Version

2

Bits

0a2c1891

Nonce

24,460

Timestamp

12/24/2013, 8:17:58 PM

Confirmations

6,513,284

Merkle Root

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

9.547 × 10⁹⁵(96-digit number)
95474373965430250622…53197290087815042559
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
9.547 × 10⁹⁵(96-digit number)
95474373965430250622…53197290087815042559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.909 × 10⁹⁶(97-digit number)
19094874793086050124…06394580175630085119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.818 × 10⁹⁶(97-digit number)
38189749586172100249…12789160351260170239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.637 × 10⁹⁶(97-digit number)
76379499172344200498…25578320702520340479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.527 × 10⁹⁷(98-digit number)
15275899834468840099…51156641405040680959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.055 × 10⁹⁷(98-digit number)
30551799668937680199…02313282810081361919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.110 × 10⁹⁷(98-digit number)
61103599337875360398…04626565620162723839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.222 × 10⁹⁸(99-digit number)
12220719867575072079…09253131240325447679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.444 × 10⁹⁸(99-digit number)
24441439735150144159…18506262480650895359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.888 × 10⁹⁸(99-digit number)
48882879470300288318…37012524961301790719
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,973,213 XPM·at block #6,841,105 · 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