Block #2,274,712

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/30/2017, 10:36:11 AM · Difficulty 10.9549 · 4,568,878 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3561162b97915fd5c93a5b6ab94ef6368afa08e00592341cf43c2efd330a4003

Height

#2,274,712

Difficulty

10.954923

Transactions

4

Size

844 B

Version

2

Bits

0af475d6

Nonce

888,508,350

Timestamp

8/30/2017, 10:36:11 AM

Confirmations

4,568,878

Merkle Root

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

4.603 × 10⁹⁶(97-digit number)
46032434892438210726…65061987070894643199
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
4.603 × 10⁹⁶(97-digit number)
46032434892438210726…65061987070894643199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.206 × 10⁹⁶(97-digit number)
92064869784876421452…30123974141789286399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.841 × 10⁹⁷(98-digit number)
18412973956975284290…60247948283578572799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.682 × 10⁹⁷(98-digit number)
36825947913950568580…20495896567157145599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.365 × 10⁹⁷(98-digit number)
73651895827901137161…40991793134314291199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.473 × 10⁹⁸(99-digit number)
14730379165580227432…81983586268628582399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.946 × 10⁹⁸(99-digit number)
29460758331160454864…63967172537257164799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.892 × 10⁹⁸(99-digit number)
58921516662320909729…27934345074514329599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.178 × 10⁹⁹(100-digit number)
11784303332464181945…55868690149028659199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.356 × 10⁹⁹(100-digit number)
23568606664928363891…11737380298057318399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.713 × 10⁹⁹(100-digit number)
47137213329856727783…23474760596114636799
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,993,080 XPM·at block #6,843,589 · 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