Block #849,413

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/11/2014, 7:26:11 PM · Difficulty 10.9713 · 5,991,936 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bb5626c827ae1a319384f0b40504b3b6ee52101601c911fd20fdcc3227574b8b

Height

#849,413

Difficulty

10.971316

Transactions

7

Size

1.53 KB

Version

2

Bits

0af8a826

Nonce

1,709,655,318

Timestamp

12/11/2014, 7:26:11 PM

Confirmations

5,991,936

Merkle Root

94a4f13ef2d0433a23debc239ff25c28f30815b0e6f74003fd9a59765b6d313a
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.301 × 10⁹⁵(96-digit number)
33010909359210950891…63427392784625085759
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.301 × 10⁹⁵(96-digit number)
33010909359210950891…63427392784625085759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.602 × 10⁹⁵(96-digit number)
66021818718421901782…26854785569250171519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.320 × 10⁹⁶(97-digit number)
13204363743684380356…53709571138500343039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.640 × 10⁹⁶(97-digit number)
26408727487368760713…07419142277000686079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.281 × 10⁹⁶(97-digit number)
52817454974737521426…14838284554001372159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.056 × 10⁹⁷(98-digit number)
10563490994947504285…29676569108002744319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.112 × 10⁹⁷(98-digit number)
21126981989895008570…59353138216005488639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.225 × 10⁹⁷(98-digit number)
42253963979790017140…18706276432010977279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.450 × 10⁹⁷(98-digit number)
84507927959580034281…37412552864021954559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.690 × 10⁹⁸(99-digit number)
16901585591916006856…74825105728043909119
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,975,159 XPM·at block #6,841,348 · 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