Block #848,220

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/10/2014, 10:26:52 PM · Difficulty 10.9717 · 5,993,594 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
332a09d570390b7e41bf653a195d2e801c19a57dd61d17fa012d908c4897e160

Height

#848,220

Difficulty

10.971657

Transactions

10

Size

4.31 KB

Version

2

Bits

0af8be84

Nonce

123,019,235

Timestamp

12/10/2014, 10:26:52 PM

Confirmations

5,993,594

Merkle Root

1552d85ea5364e68c1dcf842d2e63f19dd9cf761a4f9615719d16e8818f5c887
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.237 × 10⁹³(94-digit number)
72379984353868166652…15848199932100697099
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.237 × 10⁹³(94-digit number)
72379984353868166652…15848199932100697099
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.447 × 10⁹⁴(95-digit number)
14475996870773633330…31696399864201394199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.895 × 10⁹⁴(95-digit number)
28951993741547266661…63392799728402788399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.790 × 10⁹⁴(95-digit number)
57903987483094533322…26785599456805576799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.158 × 10⁹⁵(96-digit number)
11580797496618906664…53571198913611153599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.316 × 10⁹⁵(96-digit number)
23161594993237813328…07142397827222307199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.632 × 10⁹⁵(96-digit number)
46323189986475626657…14284795654444614399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.264 × 10⁹⁵(96-digit number)
92646379972951253315…28569591308889228799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.852 × 10⁹⁶(97-digit number)
18529275994590250663…57139182617778457599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.705 × 10⁹⁶(97-digit number)
37058551989180501326…14278365235556915199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.411 × 10⁹⁶(97-digit number)
74117103978361002652…28556730471113830399
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,978,883 XPM·at block #6,841,813 · 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